Matches in ScholarlyData for { ?s ?p ?o. }
- item-1 hasContent krysta-m-svore.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent maksims-n-volkovs.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent christopher-j-c-burges.
- item-3 previous item-2.
- learning-to-re-rank-query-dependent-image-re-ranki creator manik-varma.
- learning-to-re-rank-query-dependent-image-re-ranki creator vidit-jain.
- learning-to-re-rank-query-dependent-image-re-ranki type InProceedings.
- learning-to-re-rank-query-dependent-image-re-ranki label "Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data".
- learning-to-re-rank-query-dependent-image-re-ranki sameAs learning-to-re-rank-query-dependent-image-re-ranki.
- learning-to-re-rank-query-dependent-image-re-ranki abstract "Our objective is to improve the performance of keyword based image search engines by re-ranking their original results. To this end, we address three limitations of existing search engines in this paper. First, there is no straight-forward, fully automated way of going from textual queries to visual features. Image search engines therefore primarily rely on static and textual features for ranking. Visual features are mainly used for secondary tasks such as finding similar images. Second, image rankers are trained on query-image pairs labeled with relevance judgments determined by human experts. Such labels are well known to be noisy due to various factors including ambiguous queries, unknown user intent and subjectivity in human judgments. This leads to learning a sub-optimal ranker. Finally, a static ranker is typically built to handle disparate user queries. The ranker is therefore unable to adapt its parameters to suit the query at hand which again leads to sub-optimal results. We demonstrate that all of these problems can be mitigated by employing a re-ranking algorithm that leverages aggregate user click data. We hypothesize that images clicked in response to a query are mostly relevant to the query. We therefore re-rank the original search results so as to promote images that are likely to be clicked to the top of the ranked list. Our re-ranking algorithm employs Gaussian Process regression to predict the normalized click count for each image, and combines it with the original ranking score. Our approach is shown to significantly boost the performance of the Bing image search engine on a wide range of tail queries.".
- learning-to-re-rank-query-dependent-image-re-ranki hasAuthorList authorList.
- learning-to-re-rank-query-dependent-image-re-ranki hasTopic multimedia.
- learning-to-re-rank-query-dependent-image-re-ranki hasTopic World_Wide_Web.
- learning-to-re-rank-query-dependent-image-re-ranki isPartOf proceedings.
- learning-to-re-rank-query-dependent-image-re-ranki title "Learning to Re-Rank: Query-Dependent Image Re-Ranking Using Click Data".
- 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 vidit-jain.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent manik-varma.
- item-2 previous item-1.
- like-like-alike-joint-friendship-and-interest-prop creator alex-smola.
- like-like-alike-joint-friendship-and-interest-prop creator bo-long.
- like-like-alike-joint-friendship-and-interest-prop creator hongyuan-zha.
- like-like-alike-joint-friendship-and-interest-prop creator narayanan-sadagopan.
- like-like-alike-joint-friendship-and-interest-prop creator shuang-hong-yang.
- like-like-alike-joint-friendship-and-interest-prop creator zhaohui-zheng.
- like-like-alike-joint-friendship-and-interest-prop type InProceedings.
- like-like-alike-joint-friendship-and-interest-prop label "Like like alike - Joint Friendship and Interest Propagation in Social Networks".
- like-like-alike-joint-friendship-and-interest-prop sameAs like-like-alike-joint-friendship-and-interest-prop.
- like-like-alike-joint-friendship-and-interest-prop abstract "Targeting interest to match a user with services (e.g. news, products, games, advertisements) and predicting friendship to build connections among users are two fundamental tasks for social network systems. In this paper, we show that the information contained in interest networks (i.e. user-service interactions) and friendship networks (i.e. user-user connections) is highly correlated and mutually helpful. We propose a framework that exploits homophily to establish an integrated network linking a user to interested services and connecting different users with common interests, upon which both friendship and interests could be efficiently propagated. The proposed friendship-interest propagation (FIP) framework devises a factor-based random walk model to explain friendship connections, and simultaneously it uses a coupled latent factor model to uncover interest interactions. We discuss the flexibility of the framework in the choices of loss objectives and regularization penalties and benchmark different variants on the Yahoo! Pulse social networking system. Experiments demonstrate that by coupling friendship with interest, FIP achieves much higher performance on both interest targeting and friendship prediction than systems using only one source of information.".
- like-like-alike-joint-friendship-and-interest-prop hasAuthorList authorList.
- like-like-alike-joint-friendship-and-interest-prop hasTopic temporal-dynamics.
- like-like-alike-joint-friendship-and-interest-prop hasTopic World_Wide_Web.
- like-like-alike-joint-friendship-and-interest-prop isPartOf proceedings.
- like-like-alike-joint-friendship-and-interest-prop title "Like like alike - Joint Friendship and Interest Propagation in Social Networks".
- 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 hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent shuang-hong-yang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent bo-long.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent alex-smola.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent narayanan-sadagopan.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent zhaohui-zheng.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent hongyuan-zha.
- item-6 previous item-5.
- limiting-the-spread-of-misinformation-in-social-ne creator amr-el-abbadi.
- limiting-the-spread-of-misinformation-in-social-ne creator ceren-budak.
- limiting-the-spread-of-misinformation-in-social-ne creator divyakant-agrawal.
- limiting-the-spread-of-misinformation-in-social-ne type InProceedings.
- limiting-the-spread-of-misinformation-in-social-ne label "Limiting the Spread of Misinformation in Social Networks".
- limiting-the-spread-of-misinformation-in-social-ne sameAs limiting-the-spread-of-misinformation-in-social-ne.
- limiting-the-spread-of-misinformation-in-social-ne abstract "In this work, we study the notion of competing campaigns in a social network and address the problem of in uence limitation where a bad campaign starts propagating from a certain node in the network and use the notion of limiting campaigns to counteract the effect of misinformation. The problem can be summarized as identifying a subset of individuals that need to be convinced to adopt the competing (or good ) campaign so as to minimize the number of people that adopt the bad campaign at the end of both propagation processes. We show that this optimization problem is NP-hard and provide approximation guarantees for a greedy solution for various de nitions of this problem by proving that they are submodular. We experimentally compare the performance of the greedy method to various heuristics. The experiments reveal that in most cases inexpensive heuristics such as degree centrality compare well with the greedy approach. We also study the in uence limitation problem in the presence of missing data where the current states of nodes in the network are only known with a certain probability and show that prediction in this setting is a supermodular problem. We propose a prediction algorithm that is based on generating random spanning trees and evaluate the performance of this approach. The experiments reveal that using the prediction algorithm, we are able to tolerate about 90% missing data before the performance of the algorithm starts degrading and even with large amounts of missing data the performance degrades only to 75% of the performance that would be achieved with complete data.".
- limiting-the-spread-of-misinformation-in-social-ne hasAuthorList authorList.
- limiting-the-spread-of-misinformation-in-social-ne hasTopic information-credibility.
- limiting-the-spread-of-misinformation-in-social-ne hasTopic World_Wide_Web.
- limiting-the-spread-of-misinformation-in-social-ne isPartOf proceedings.
- limiting-the-spread-of-misinformation-in-social-ne title "Limiting the Spread of Misinformation in Social Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent ceren-budak.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent divyakant-agrawal.