Matches in ScholarlyData for { ?s ?p ?o. }
- item-4 previous item-3.
- layered-label-propagation-a-multiresolution-coordi creator marco-rosa.
- layered-label-propagation-a-multiresolution-coordi creator massimo-santini.
- layered-label-propagation-a-multiresolution-coordi creator paolo-boldi.
- layered-label-propagation-a-multiresolution-coordi creator sebastiano-vigna.
- layered-label-propagation-a-multiresolution-coordi type InProceedings.
- layered-label-propagation-a-multiresolution-coordi label "Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing Social Networks".
- layered-label-propagation-a-multiresolution-coordi sameAs layered-label-propagation-a-multiresolution-coordi.
- layered-label-propagation-a-multiresolution-coordi abstract "We continue the line of research on graph compression started with WebGraph, but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the approaches that have been used for a long time to compress web graphs rely on a specific ordering of the nodes (lexicographical URL ordering) whose extension to general social networks is not trivial. In this paper, we propose a solution that mixes clusterings and orders, and devise a new algorithm, called Layered Label Propagation, that builds on previous work on scalable clustering and can be used to reorder very large graphs (billions of nodes). Our implementation uses task decomposition to perform aggressively on multi-core architecture, making it possible to reorder graphs of more than 600 millions nodes in a few hours. Experiments performed on a wide array of web graphs and social networks show that combining the order produced by the proposed algorithm with the WebGraph compression framework provides a major increase in compression with respect to all currently known techniques, both on web graphs and on social networks. These improvements make it possible to analyse in main memory significantly larger graphs.".
- layered-label-propagation-a-multiresolution-coordi hasAuthorList authorList.
- layered-label-propagation-a-multiresolution-coordi hasTopic clustering.
- layered-label-propagation-a-multiresolution-coordi hasTopic World_Wide_Web.
- layered-label-propagation-a-multiresolution-coordi isPartOf proceedings.
- layered-label-propagation-a-multiresolution-coordi title "Layered Label Propagation: A Multiresolution Coordinate-Free Ordering for Compressing 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 hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent paolo-boldi.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent marco-rosa.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent massimo-santini.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent sebastiano-vigna.
- item-4 previous item-3.
- learning-to-model-relatedness-for-news-recommendat creator pranam-kolari.
- learning-to-model-relatedness-for-news-recommendat creator taesup-moon.
- learning-to-model-relatedness-for-news-recommendat creator xuanhui-wang.
- learning-to-model-relatedness-for-news-recommendat creator yi-chang.
- learning-to-model-relatedness-for-news-recommendat creator yuanhua-lv.
- learning-to-model-relatedness-for-news-recommendat creator zhaohui-zheng.
- learning-to-model-relatedness-for-news-recommendat type InProceedings.
- learning-to-model-relatedness-for-news-recommendat label "Learning to Model Relatedness for News Recommendation".
- learning-to-model-relatedness-for-news-recommendat sameAs learning-to-model-relatedness-for-news-recommendat.
- learning-to-model-relatedness-for-news-recommendat abstract "With the explosive growth of online news readership, recommending interesting news articles to users has become extremely important. While existing Web services such as Yahoo! and Digg attract users' initial clicks by leveraging various kinds of signals, how to engage such users algorithmically after their initial visit is largely under-explored. In this paper, we study the problem of post-click news recommendation. Given that a user has perused a current news article, our idea is to automatically identify ``related" news articles which the user would like to read afterwards. Specifically, we propose to characterize relatedness between news articles across four aspects: relevance, novelty, connection clarity, and transition smoothness. Motivated by this understanding, we define a set of features to capture each of these aspects and put forward a learning approach to model relatedness. In order to quantitatively evaluate our proposed measures and learn a unified relatedness function, we construct a large test collection based on a four-month commercial news corpus with editorial judgments. The experimental results show that the proposed heuristics can indeed capture relatedness, and that the learned unified relatedness function works quite effectively.".
- learning-to-model-relatedness-for-news-recommendat hasAuthorList authorList.
- learning-to-model-relatedness-for-news-recommendat hasTopic recommendation.
- learning-to-model-relatedness-for-news-recommendat hasTopic World_Wide_Web.
- learning-to-model-relatedness-for-news-recommendat isPartOf proceedings.
- learning-to-model-relatedness-for-news-recommendat title "Learning to Model Relatedness for News Recommendation".
- 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 yuanhua-lv.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent taesup-moon.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent pranam-kolari.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent zhaohui-zheng.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent xuanhui-wang.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent yi-chang.
- item-6 previous item-5.
- learning-to-rank-with-multiple-objective-functions creator christopher-j-c-burges.
- learning-to-rank-with-multiple-objective-functions creator krysta-m-svore.
- learning-to-rank-with-multiple-objective-functions creator maksims-n-volkovs.
- learning-to-rank-with-multiple-objective-functions type InProceedings.
- learning-to-rank-with-multiple-objective-functions label "Learning to Rank with Multiple Objective Functions".
- learning-to-rank-with-multiple-objective-functions sameAs learning-to-rank-with-multiple-objective-functions.
- learning-to-rank-with-multiple-objective-functions abstract "We investigate the problem of learning to rank with document retrieval from the perspective of learning for multiple objective functions. We present solutions to two open problems in learning to rank: first, we show how multiple measures can be combined into a single graded measure that can be learned. This solves the problem of learning from a scorecard of measures by making such scorecards comparable, and we show results where a standard web relevance measure (NDCG) is used for the top-tier measure, and a relevance measure derived from click data is used for the second-tier measure; the second-tier measure is shown to significantly improve while leaving the top-tier measure largely unchanged. Second, we note that the learning-to-rank problem can itself be viewed as changing as the ranking model learns: for example, early in learning, adjusting the rank of all documents can be advantageous, but later during training, it becomes more desirable to concentrate on correcting the top few documents for each query. We show how an analysis of these problems leads to an improved, iteration-dependent cost function that interpolates between a cost function that is more appropriate for early learning, with one that is more appropriate for late-stage learning. The approach results in a significant improvement in accuracy with the same size models. We investigate these ideas using LambdaMART, a state-of-the-art ranking algorithm.".
- learning-to-rank-with-multiple-objective-functions hasAuthorList authorList.
- learning-to-rank-with-multiple-objective-functions hasTopic ranking.
- learning-to-rank-with-multiple-objective-functions hasTopic World_Wide_Web.
- learning-to-rank-with-multiple-objective-functions isPartOf proceedings.
- learning-to-rank-with-multiple-objective-functions title "Learning to Rank with Multiple Objective Functions".
- 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.