TY - GEN
T1 - Predicting the popularity of web 2.0 items based on user comments
AU - He, Xiangnan
AU - Gao, Ming
AU - Kan, Min Yen
AU - Liu, Yiqun
AU - Sugiyama, Kazunari
PY - 2014
Y1 - 2014
N2 - In the current Web 2.0 era, the popularity of Web resources fluctuates ephemerally, based on trends and social interest. As a result, content-based relevance signals are insufficient to meet users' constantly evolving information needs in searching for Web 2.0 items. Incorporating future popularity into ranking is one way to counter this. However, predicting popularity as a third party (as in the case of general search engines) is difficult in practice, due to their limited access to item view histories. To enable popularity prediction externally without excessive crawling, we propose an alternative solution by leveraging user comments, which are more accessible than view counts. Due to the sparsity of comments, traditional solutions that are solely based on view histories do not perform well. To deal with this sparsity, we mine comments to recover additional signal, such as social influence. By modeling comments as a time-aware bipartite graph, we propose a regularization-based ranking algorithm that accounts for temporal, social influence and current popularity factors to predict the future popularity of items. Experimental results on three real-world datasets - crawled from YouTube, Flickr and Last.fm - show that our method consistently outperforms competitive baselines in several evaluation tasks.
AB - In the current Web 2.0 era, the popularity of Web resources fluctuates ephemerally, based on trends and social interest. As a result, content-based relevance signals are insufficient to meet users' constantly evolving information needs in searching for Web 2.0 items. Incorporating future popularity into ranking is one way to counter this. However, predicting popularity as a third party (as in the case of general search engines) is difficult in practice, due to their limited access to item view histories. To enable popularity prediction externally without excessive crawling, we propose an alternative solution by leveraging user comments, which are more accessible than view counts. Due to the sparsity of comments, traditional solutions that are solely based on view histories do not perform well. To deal with this sparsity, we mine comments to recover additional signal, such as social influence. By modeling comments as a time-aware bipartite graph, we propose a regularization-based ranking algorithm that accounts for temporal, social influence and current popularity factors to predict the future popularity of items. Experimental results on three real-world datasets - crawled from YouTube, Flickr and Last.fm - show that our method consistently outperforms competitive baselines in several evaluation tasks.
KW - BUIR
KW - Bipartite graph ranking
KW - Comments mining
KW - Item ranking
KW - Popularity prediction
UR - https://www.scopus.com/pages/publications/84904580359
U2 - 10.1145/2600428.2609558
DO - 10.1145/2600428.2609558
M3 - 会议稿件
AN - SCOPUS:84904580359
SN - 9781450322591
T3 - SIGIR 2014 - Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval
SP - 233
EP - 242
BT - SIGIR 2014 - Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval
PB - Association for Computing Machinery
T2 - 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2014
Y2 - 6 July 2014 through 11 July 2014
ER -