Skip to Main content Skip to Navigation
New interface
Conference papers

Messages Ranking in Social Network

Abstract : Nowadays, people engage more and more in social networks, such as Twitter, FaceBook, and Orkut, etc. In these social network sites, users create relationship with familiar or unfamiliar persons and share short messages between each other. One arising problem for these social networks is information is real-time and updates so quickly that users often feel lost in such huge information flow and struggle to find what really interest them. In this paper, we study the problem of personalized ranking in social network and use the SSRankBoost algorithm, a kind of pairwise learning to rank method to solve this problem. We evaluate our approach using a real microblog dataset for experiment and analyze the result empirically. The result shows clear improvement compared to those without ranking criteria. abstract environment.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, May 19, 2017 - 10:43:09 AM
Last modification on : Thursday, March 5, 2020 - 5:41:50 PM
Long-term archiving on: : Monday, August 21, 2017 - 12:59:47 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Bo Li, Fengxian Shi, Enhong Chen. Messages Ranking in Social Network. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.268-275, ⟨10.1007/978-3-642-32891-6_34⟩. ⟨hal-01524946⟩



Record views


Files downloads