The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In online social networks (OSNs), user connections can be represented as a network. The network formed has distinct properties that distinguish it from other network topologies. In this work, we consider an unstructured keyword based social network topology where each edge has a trust value associated with it to
Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases, and the Web. Conceptually, these algorithms require a query-time PageRank-style iterative computation over the full graph. This
using keywords graph to contribute special techniques for exploring those groups and the relationships among them. Interactions between users and the created keywords graph are also provided. Compared to other applications on blog visualization, our approach utilized the ontology knowledge to analysis and automatically
retrieve images through existing commercial search engines. This method significantly saves userspsila time by avoiding multiple search keywords that are usually required in generic search engines. It benefits both naive user who does not possess a large vocabulary (e.g., students) and professionals who look for images on a
for discussion analysis. It is based on message-based graphs where each vertex represents a message object and each edge points out which message the specific node replies to. The edges can be weighted by the keywords that characterize the exchanged messages. This model allows a content-oriented representation of the
) information content due to occurrence of a property with respect to all the properties in a description base ii) unpredictability of an association due to participation of its properties in multiple domains iii) the extent of match between user specified keywords and properties and iv) the popularity of nodes involved in a
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.