论文信息 - TiCom: A Time-Compensation Based Review Ranking Algorithm for Mobile Clients

TiCom: A Time-Compensation Based Review Ranking Algorithm for Mobile Clients

Mobile environment has been one of focuses of computing, communication and management. Mobile review ranking problem, for the first time, is brought out in this paper. Also, a novel ranking algorithm, TiCom, is proposed for mobile review ranking. TiCom is based on the idea of time compensation, and is used to prevent fresh voting item from being ranked too high or too low. Experimental results show that TiCom effectively improves the review process, e.g. music review ranking, especially in mobile environments.

Jianmin Wang | Dapeng Zhao | Shengfei Shi | Chaokun Wang | Wei Zheng

[1] Alfred Z. Spector,et al. A weighted voting algorithm for replicated directories , 1987, JACM.

[2] Ralph Morelli,et al. Teaching about the risks of electronic voting technology , 2005, ITiCSE '05.

[3] Taher H. Haveliwala. Efficient Computation of PageRank , 1999 .

[4] Dell Zhang,et al. An efficient algorithm to rank Web resources , 2000, Comput. Networks.

[5] Panagiotis G. Ipeirotis,et al. Designing novel review ranking systems: predicting the usefulness and impact of reviews , 2007, ICEC.

[6] Sushil Jajodia,et al. Dynamic voting algorithms for maintaining the consistency of a replicated database , 1990, TODS.

[7] Bernhard Schölkopf,et al. Ranking on Data Manifolds , 2003, NIPS.

[8] Aravind K. Joshi,et al. An SVM-based voting algorithm with application to parse reranking , 2003, CoNLL.

[9] Michael Collins,et al. New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron , 2002, ACL.