Matches in ScholarlyData for { ?s ?p ?o. }
- item-1 hasContent mangesh-gupte.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent pravin-shankar.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent jing-li.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent s-muthukrishnan.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent liviu-iftode.
- item-5 previous item-4.
- finding-the-bias-and-prestige-of-nodes-in-networks creator abhinav-mishra.
- finding-the-bias-and-prestige-of-nodes-in-networks creator arnab-bhattacharya.
- finding-the-bias-and-prestige-of-nodes-in-networks type InProceedings.
- finding-the-bias-and-prestige-of-nodes-in-networks label "Finding the Bias and Prestige of Nodes in Networks based on Trust Scores".
- finding-the-bias-and-prestige-of-nodes-in-networks sameAs finding-the-bias-and-prestige-of-nodes-in-networks.
- finding-the-bias-and-prestige-of-nodes-in-networks abstract "Many real-life graphs such as social networks and peer-to-peer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such networks includes trust prediction, finding the most reliable or trusted node in a local subgraph, etc. For many of these applications, it is crucial to assess the prestige and bias of a node. The bias of a node denotes its propensity to trust/mistrust its neighbours and is closely related to truthfulness. If a node trusts all its neighbours, its recommendation of another node as trustworthy is less reliable. It is based on the idea that the recommendation of a highly biased node should weigh less. In this paper, we propose an algorithm to compute the bias and prestige of nodes in networks where the edge weight denotes the trust score. Unlike most other graph-based algorithms, our method works even when the edge weights are not necessarily positive. The algorithm is iterative and runs in O(km) time where k is the number of iterations and m is the total number of edges in the network. The algorithm exhibits several other desirable properties. It converges to a unique value very quickly. Also, the error in bias and prestige values at any particular iteration is bounded. Further, experiments show that our model conforms well to social theories such as the balance theory (enemy of a friend is an enemy, etc.).".
- finding-the-bias-and-prestige-of-nodes-in-networks hasAuthorList authorList.
- finding-the-bias-and-prestige-of-nodes-in-networks hasTopic social-network-analysis.
- finding-the-bias-and-prestige-of-nodes-in-networks hasTopic World_Wide_Web.
- finding-the-bias-and-prestige-of-nodes-in-networks isPartOf proceedings.
- finding-the-bias-and-prestige-of-nodes-in-networks title "Finding the Bias and Prestige of Nodes in Networks based on Trust Scores".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent abhinav-mishra.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent arnab-bhattacharya.
- item-2 previous item-1.
- generalized-link-suggestions-via-web-site-clusteri creator bo-pang.
- generalized-link-suggestions-via-web-site-clusteri creator evgeniy-gabrilovich.
- generalized-link-suggestions-via-web-site-clusteri creator fernando-diaz.
- generalized-link-suggestions-via-web-site-clusteri creator jangwon-seo.
- generalized-link-suggestions-via-web-site-clusteri creator vanja-josifovski.
- generalized-link-suggestions-via-web-site-clusteri type InProceedings.
- generalized-link-suggestions-via-web-site-clusteri label "Generalized Link Suggestions Via Web Site Clustering".
- generalized-link-suggestions-via-web-site-clusteri sameAs generalized-link-suggestions-via-web-site-clusteri.
- generalized-link-suggestions-via-web-site-clusteri abstract "Proactive link suggestion leads to improved user experience by allowing users to reach relevant information with fewer clicks, fewer pages to read, or simply faster because the right pages are prefetched just in time. In this paper we tackle two new scenarios for link suggestion, which were not covered in prior work owing to scarcity of historical browsing data. In the web search scenario, we propose a method for generating quick links---additional entry points into Web sites, which are shown for top search results for navigational queries - for tail sites, for which little browsing statistics is available. Beyond Web search, we also propose a method for link suggestion in general web browsing, effectively anticipating the next link to be followed by the user. Our approach performs clustering of Web sites in order to aggregate information across multiple sites, and enables relevant link suggestion for virtually any site, including tail sites and brand new sites for which little historical data is available. Empirical evaluation confirms the validity of our method using editorially labeled data as well as real-life search and browsing data from a major US search engine.".
- generalized-link-suggestions-via-web-site-clusteri hasAuthorList authorList.
- generalized-link-suggestions-via-web-site-clusteri hasTopic web-mining.
- generalized-link-suggestions-via-web-site-clusteri hasTopic World_Wide_Web.
- generalized-link-suggestions-via-web-site-clusteri isPartOf proceedings.
- generalized-link-suggestions-via-web-site-clusteri title "Generalized Link Suggestions Via Web Site Clustering".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent jangwon-seo.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent fernando-diaz.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent evgeniy-gabrilovich.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent vanja-josifovski.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent bo-pang.
- item-5 previous item-4.
- geographical-topic-discovery-and-comparison creator chengxiang-zhai.
- geographical-topic-discovery-and-comparison creator jiawei-han.
- geographical-topic-discovery-and-comparison creator liangliang-cao.
- geographical-topic-discovery-and-comparison creator thomas-huang.
- geographical-topic-discovery-and-comparison creator zhijun-yin.
- geographical-topic-discovery-and-comparison type InProceedings.
- geographical-topic-discovery-and-comparison label "Geographical Topic Discovery and Comparison".
- geographical-topic-discovery-and-comparison sameAs geographical-topic-discovery-and-comparison.
- geographical-topic-discovery-and-comparison abstract "This paper studies the problem of discovering and comparing geographical topics from GPS-associated documents. GPS-associated documents become popular with the pervasiveness of location-acquisition technologies. For example, in Flickr, the geo-tagged photos are associated with tags and GPS locations. In Twitter, the locations of the tweets can be identified by the GPS locations from smart phones. Many interesting concepts, including cultures, scenes, and product sales, correspond to specialized geographical distributions. In this paper, we are interested in two questions: (1) how to discover different topics of interests that are coherent in geographical regions? (2) how to compare several topics across different geographical locations? To answer these questions, this paper proposes and compares three ways of modeling geographical topics: location-driven model, text-driven model, and a novel joint model called LGTA (Latent Geographical Topic Analysis) that combines location and text. To make a fair comparison, we collect several representative datasets from Flickr website including Landscape, Activity, Manhattan, National park, Festival, Car, and Food. The results show that the first two methods work in some datasets but fail in others. LGTA works well in all these datasets at not only finding regions of interests but also providing effective comparisons of the topics across different locations. The results confirm our hypothesis that the geographical distributions can help modeling topics, while topics provide important cues to group different geographical regions.".
- geographical-topic-discovery-and-comparison hasAuthorList authorList.
- geographical-topic-discovery-and-comparison hasTopic spatio-temporal-analysis.
- geographical-topic-discovery-and-comparison hasTopic World_Wide_Web.
- geographical-topic-discovery-and-comparison isPartOf proceedings.
- geographical-topic-discovery-and-comparison title "Geographical Topic Discovery and Comparison".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.