基于用户兴趣建模的推荐方法及应用研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
如何对混杂无序的信息进行筛选和过滤,并将用户最关注和最感兴趣的信息进行展现,成为信息爆炸时代最重要的挑战性问题之一。在此背景下,推荐系统应运而生,它不像搜索引擎一样仅对用户提供的显式需求进行被动匹配,而是可以根据用户潜在的兴趣和爱好主动进行信息(项目)推荐,因此可以最大程度上提升用户体验、提高服务质量。然而,已有推荐算法经常受用户兴趣过拟合和用户冷启动等问题的困扰,导致了推荐效果的不理想。为此,本文提出对推荐系统中的用户进行兴趣建模,准确理解用户当前情境下的需求,然后,设计高效的推荐算法,以提高用户满意度和商家收益。本文的工作与贡献可以概括如下:
     首先,提出了基于概率主题模型的用户兴趣表示方法,构建了基于随机游走的兴趣扩展模型。当前协同过滤推荐算法往往只关注用户和系统的交互信息,缺乏对用户兴趣深度理解。针对该问题,本文探索了用户和项目之间存在的隐式兴趣层。具体而言,设计了用户-兴趣-项目的三层推荐表示模型,在利用概率主题模型获取用户当前兴趣后,提出基于随机游走的用户兴趣扩展与兴趣传播算法,并将符合用户兴趣的项目进行推荐。基于此,构建了一个面向项目、基于模型的协同过滤推荐算法iExpand。在三个标准数据集上的大量实验结果表明,iExpand生成的推荐列表可以更准确地把握用户当前兴趣。
     其次,提出了情境丰富时的游客兴趣建模方法,设计了Cocktail旅游套餐个性化推荐算法。针对移动推荐的情境感知特性和数据稀疏等挑战,对游客的旅游行为数据进行了细致分析,发现了旅游套餐中的旅游景点之间隐含的时空关联性。基于此发现,提出融合情境信息的游客兴趣表示方法TAST,将具有相似旅游偏好(如旅游季节和地点)的游客映射到相近的隐空间,实现游客兴趣和套餐内容的可比较性。基于该兴趣模型和套餐价格约束等,设计实现了Cocktail旅游套餐推荐算法,为游客进行个性化的旅游套餐推荐服务。在一个旅游公司十年真实数据上的实验结果表明,与当前具有代表性的推荐算法相比,该系统显著提高了推荐精度。
     最后,提出对新用户进行兴趣引导的最优初始项目推荐算法。针对如何从商家收益的角度对新用户进行初始项目推荐的问题,研究了网络中的最有影响力结点(项目)识别方法。首先,提出项目消费网络中的最优项目启发式选择算法,为新用户推荐最有影响力的项目,从而诱导他们消费更多的项目;其次,提出基于PageRank线性信息传播模型的最优初始项目识别算法,给定用户的已有消费项目集合(已有兴趣),利用贪心策略寻找能够带来最多潜在消费的一组项目进行推荐,结合商家潜在收益,对推荐的有效性进行评价。
One of the most important challenges in the era of information explosion is the way to filter out the disordered mixed information and then select the part that a given user may like. Along this line, recommender systems were proposed. Unlike search engines, which extract and return information according to user queries, recommender systems could automatically make item recommendations by mining user latent interests without user interventions. Thus, this technique has been successfully applied for improving the quality of services in a number of fields. However, existing recommendation algorithms often suffer from user interest overspecialization problem and cold-start problem. To that end, in this paper, we make a focused study of designing and applying recommenders based on user interests modeling for further enhancing both user experience and profit of the system. Our contributions could be summarized as:
     Firstly, we propose a method to represent user interests in collaborative filter-ing, and then describe a user interests expansion model by personalized ranking. Existing collaborative filtering based recommender systems usually focus on ex-ploiting the information about the user's interaction with the systems, and the information about latent user interests is largely under-explored. Since learning to leverage the information about user interests is often critical for making better recommendations, we introduce a three-layer, user-interests-item, representation scheme. Specifically, after a topic model based method is used to capture each user's interests, personalized ranking is developed for predicting user's possible interests expansion. Moreover, a diverse recommendation list is generated by us-ing user latent interests as an intermediate layer between users and items. This recommendation strategy is summarized into an item-oriented model-based col-laborative framework, named iExpand. The extensive experimental results show that iExpand can lead to better ranking performance than state-of-the-arts.
     Secondly, we propose a way for context-rich tourist interest modeling, and design a cocktail approach (Cocktail) on personalized travel package recommen-dation. To deal with the technical and domain challenges in travel recommenda-tion, we first analyze the unique characteristics of travel packages and discover the spatial-temporal autocorrelations among their landscapes. Then develop the TAST model for representing the interests of the tourists, which can extract the interests conditioned on both the tourists and the intrinsic features (i.e., loca-tions, travel seasons) of the landscapes. Based on this TAST model, Cocktail is developed for personalized travel package recommendation by considering some additional factors. Finally, we evaluate TAST model and Cocktail on real-world travel package data (last for ten years) provided by a travel company in Chi-na. The experimental results show that the TAST model can effectively capture the unique characteristics of the travel data and the Cocktail is thus much more effective than traditional methods for travel package recommendation.
     Lastly, we provide an idea of recommending seed items to cold-start users for user interest elicitation. For choosing and evaluating seed items from a systematic perspective, we propose to identify influential seed nodes(items) from the item consumption network. Specifically, we first provide several influential seed items selection heuristics, which recommend the most influential items that can bring in more consumptions; Then, we present a seed items selection algorithm based on a linear information propagation model similar to PageRank. Different from the previous heuristics which do not consider the possible influence overlaps between seed items and select all the items simultaneously, the linear algorithm identifies the independent influence of each item and selects the seeds one by one following a greedy strategy. Finally, we show the effectiveness of these methods by the expected number of consumptions of cold-start users.
引文
[1]李国杰.大数据研究的科学价值.中国计算机学会通讯,2012,8(9):8-15.
    [2]Kantor P B, Ricci F, Rokach L, et al. Recommender systems handbook.2010..
    [3]Abowd G, Dey A, Brown P, et al. Towards a better understanding of context and context-awareness. Proceedings of Handheld and Ubiquitous Computing,1999.304-307.
    [4]Tammel A. How to survive as an ISP. Proceedings of Proceedings of Networld Interop, volume 97, 1997.
    [5]Metcalfe B. Metcalfe's Law:A network becomes more valuable as it reaches more users. In-foworld,1995,17(40):53-54.
    [6]Page L, Brin S, Motwani R, et al. The PageRank citation ranking:bringing order to the web. 1999..
    [7]Cao H, Jiang D, Pei J, et al. Context-aware query suggestion by mining click-through and session data. Proceedings of Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2008.875-883.
    [8]Cao H, Hu D H, Shen D, et al. Context-aware query classification. Proceedings of Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval. ACM,2009.3-10.
    [9]Cao H, Jiang D, Pei J, et al. Towards context-aware search by learning a very large variable length hidden markov model from search logs. Proceedings of Proceedings of the 18th International Conference on World Wide Web,2009.191-200.
    [10]刘建国,周涛,汪秉宏.个性化推荐系统的研究进展.自然科学进展,2009,19(1):1-15.
    [11]Resnick P, Iacovou N, Suchak M, et al. GroupLens:an open architecture for collaborative filtering of netnews. Proceedings of Proceedings of the 1994 ACM conference on Computer supported cooperative work. ACM,1994.175-186.
    [12]Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems:A survey of the state-of-the-art and possible extensions. Knowledge and Data Engineering, IEEE Transactions on,2005,17(6):734-749.
    [13]Rendle S. Factorization Machines with libFM. ACM Trans. Intell. Syst. Technol.,2012, 3(3):57:1-57:22.
    [14]Herlocker J L, Konstan J A, Terveen L G, et al. Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems (TOIS),2004,22(1):5-53.
    [15]Zhang L, Tang L, Luo P, et al. Harnessing the wisdom of the crowds for accurate web page clipping. Proceedings of Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2012.570-578.
    [16]Linden G, Smith B, York J. Amazon, com recommendations:Item-to-item collaborative filtering. Internet Computing, IEEE,2003,7(1):76-80.
    [17]Davidson J, Liebald B, Liu J, et al. The YouTube video recommendation system. Proceedings of Proceedings of the fourth ACM conference on Recommender systems. ACM,2010.293-296.
    [18]Ding Y, Li X. Time weight collaborative filtering. Proceedings of Proceedings of the 14th ACM international conference on Information and knowledge management. ACM,2005.485-492.
    [19]Kohrs A, Merialdo B. Improving collaborative filtering for new users by smart object selection. Proceedings of Proceedings of International Conference on Media Features (ICMF),2001.
    [20]Weng L T, Xu Y, Li Y, et al. Exploiting item taxonomy for solving cold-start problem in recom-mendation making. Proceedings of Tools with Artificial Intelligence,2008. ICTAI'08.20th IEEE International Conference on, volume 2. IEEE,2008.113-120.
    [21]Lam X N, Vu T, Le T D, et al. Addressing cold-start problem in recommendation systems. Proceedings of Proceedings of the 2nd international conference on Ubiquitous information man-agement and communication. ACM,2008.208-211.
    [22]Salakhutdinov R, Mnih A. Probabilistic matrix factorization. Advances in neural information processing systems,2008,20:1257-1264.
    [23]Blei D, Ng A, Jordan M. Latent dirichlet allocation. The Journal of Machine Learning Research, 2003,3:993-1022.
    [24]Chen S, Moore J L, Turnbull D, et al. Playlist prediction via metric embedding. Proceedings of Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2012.714-722.
    [25]Koren Y. Collaborative filtering with temporal dynamics. Proceedings of Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2009. 447-456.
    [26]Koren Y. Collaborative filtering with temporal dynamics. Communications of the ACM,2010, 53(4):89-97.
    [27]Agarwal D, Chen B. fLDA: matrix factorization through latent dirichlet allocation. Proceedings of Proceedings of the third ACM international conference on Web search and data mining. ACM, 2010.91-100.
    [28]Wu L, Chen E, Liu Q, et al. Leveraging tagging for neighborhood-aware probabilistic matrix factorization. Proceedings of Proceedings of the 21st ACM international conference on Information and knowledge management. ACM,2012.1854-1858.
    [29]Wang J, Zeng C, He C, et al. Context-aware role mining for mobile service recommendation. Proceedings of Proceedings of the 27th Annual ACM Symposium on Applied Computing. ACM, 2012.173-178.
    [30]Giannotti F, Nanni M, Pinelli F, et al. Trajectory pattern mining. Proceedings of Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2007.330-339.
    [31]Mooney R, Roy L. Content-based book recommending using learning for text categorization. Proceedings of Proceedings of the fifth ACM conference on Digital libraries. ACM,2000.195—204.
    [32]Mooney R J, Bennett P N, Roy L. Book recommending using text categorization with extracted information. Proceedings of Proc. Recommender Systems Papers from 1998 Workshop, Technical Report WS-98-08,1998.
    [33]Iaquinta L, De Gemmis M, Lops P, et al. Introducing serendipity in a content-based recommender system. Proceedings of Hybrid Intelligent Systems,2008. HIS'08. Eighth International Conference on. IEEE,2008.168-173.
    [34]Chien Y H, George E I. A bayesian model for collaborative filtering. Proceedings of Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics. San Francisco:Morgan Kaufman Publishers,[http://uncertain.ty99. microsoft, com/proceedings, htm],1999.
    [35]Koren Y. Factorization meets the neighborhood:a multifaceted. collaborative filtering model. Proceedings of Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2008.426-434.
    [36]Fouss F, Pirotte A, Renders J M, et al. Random-walk computation of similarities between nodes of a graph with application, to collaborative recommendation.. Knowledge and Data Engineering, IEEE Transactions on,2007,19(3):355-369.
    [37]Song X, Tseng B, Lin C, et al. Personalized recommendation driven by information flow. Pro-ceedings of Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM,2006.509-516.
    [38]Koren Y, Bell R, Volinsky C. Matrix factorization techniques for recommender systems. Computer, 2009,42(8):30-37.
    [39]Luo X, Ouyang Y, Zhang X. Improving Matrix Factorization-Based Recommender via En-semble Methods. International Journal of Information Technology and Decision Making,2011, 10(3):539-561.
    [40]Gantner Z, Drumond L, Freudenthaler C, et al. Learning attribute-to-feature mappings for cold-start recommendations. Proceedings of Data Mining (ICDM),2010 IEEE 10th International Conference on. IEEE,2010.176-185.
    [41]Ahn H J. A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem. Information Sciences,2008,178(1):37-51.
    [42]Papagelis M, Plexousakis D, Kutsuras T. Alleviating the sparsity problem of collaborative filtering using trust inferences. Proceedings of Trust management. Springer,2005:224-239.
    [43]Ma H, King I, Lyu M. Learning to recommend with explicit and implicit social relations. ACM Transactions on Intelligent Systems and Technology (TIST),2011,2(3):29.
    [44]Wang J, Zhang Y. Utilizing marginal net utility for recommendation in e-commerce. Proceedings of Proceedings of the 34th international ACM SIGIR conference on Research and development in Information. ACM,2011.1003-1012.
    [45]Burke R. Hybrid web recommender systems. Proceedings of The adaptive web. Springer,2007: 377-408.
    [46]Pan R, Zhou Y, Cao B, et al. One-class collaborative filtering. Proceedings of Data Mining,2008. ICDM'08. Eighth IEEE International Conference on. Ieee,2008.502-511.
    [47]Gori M, Pucci A. ItemRank:a random-walk based scoring algorithm for recommender engines. Proceedings of Proceedings of the 20th international joint conference on Artifical intelligence. Morgan Kaufmann Publishers Inc.,2007.2766-2771.
    [48]Liu Q, Chen E, Xiong H, et al. Enhancing collaborative filtering by user interest expansion via personalized ranking. Systems, Man, and Cybernetics, Part B:Cybernetics, IEEE Transactions on,2012,42(1):218-233.
    [49]Lemire D, Maclachlan A. Slope one predictors for online rating-based collaborative filtering. Society for Industrial Mathematics,2005,5:471-480.
    [50]Karatzoglou A, Amatriain X, Baltrunas L, et al. Multiverse recommendation:n-dimensional tensor factorization for context-aware collaborative filtering. Proceedings of Proceedings of the fourth ACM conference on Recommender systems. ACM,2010.79-86.
    [51]Quercia D, Capra L. FriendSensing:recommending friends using mobile phones. Proceedings of Proceedings of the third ACM conference on Recommender systems. ACM,2009.273-276.
    [52]Schafer J B, Frankowski D, Herlocker J, et al. Collaborative filtering recommender systems. Proceedings of The adaptive web. Springer,2007:291-324.
    [53]Crane M. The New User Problem in Collaborative Filtering. University of Otago,2011..
    [54]Park S T, Pennock D, Madani O, et al. Naive filterbots for robust cold-start recommendations. Proceedings of Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2006.699-705.
    [55]Rashid A M, Albert I, Cosley D, et al. Getting to know you:learning new user preferences in rec-ommender systems. Proceedings of Proceedings of the 7th international conference on Intelligent user interfaces. ACM,2002.127-134.
    [56]Huang Z, Chen H, Zeng D. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Transactions on Information Systems (TOIS),2004, 22(1):116-142.
    [57]Yildirim H, Krishnamoorthy M S. A random walk method for alleviating the sparsity problem in collaborative filtering. Proceedings of Proceedings of the 2008 ACM conference on Recommender systems. ACM,2008.131-138.
    [58]Jamali M, Ester M. TrustWalker:a random walk model for combining trust-based and item-based recommendation. Proceedings of Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2009.397-406.
    [59]Ma H, Zhou T, Lyu M, et al. Improving recommender systems by incorporating social contextual information. ACM Transactions on Information Systems (TOIS),2011,29(2):9.
    [60]Xiang L, Yuan Q, Zhao S, et al. Temporal recommendation on graphs via long-and short-term preference fusion. Proceedings of Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2010.723-732.
    [61]Cao H, Chen E, Yang J, et al. Enhancing recommender systems under volatile userinterest drifts. Proceedings of Proceedings of the 18th ACM conference on Information and knowledge manage-ment. ACM,2009.1257-1266.
    [62]Billsus D, Pazzani M J. User modeling for adaptive news access. User modeling and user-adapted interaction,2000,10(2-3):147-180.
    [63]Pucci A, Gori M, Maggini M. A random-walk based scoring' algorithm applied to recommender engines. Proceedings of Proceedings of the 8th Knowledge discovery on the web international conference on Advances in web mining and web usage analysis. Springer-Verlag,2006.127-146.
    [64]Nakatsuji M, Pujiwara Y, Tanaka A, et al. Classical music for rock fans?:novel recommendations for expanding user interests. Proceedings of Proceedings of the 19th ACM international conference on Information and knowledge management. ACM,2010.949-958.
    [65]Ziegler C N, McNee S M, Konstan J A, et al. Improving recommendation lists through topic diversification. Proceedings of Proceedings of the 14th international conference on World Wide Web. ACM,2005.22-32.
    [66]Zhang M, Hurley N. Avoiding monotony:improving the diversity of recommendation lists. Pro-ceedings of Proceedings of the 2008 ACM conference on Recommender systems. ACM,2008. 123-130.
    [67]Zhang M. Enhancing diversity in top-n recommendation. Proceedings of Proceedings of the third ACM conference on Recommender systems. ACM,2009.397-400.
    [68]Shi Y, Zhao X, Wang J, et al.. Adaptive diversification of recommendation results via latent factor portfolio. Proceedings of Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. ACM,2012.175-184.
    [69]Adamopoulos P, Tuzhilin A. On unexpectedness in recommender systems:or how to expect the unexpected. Proc. ACM RecSys,2011,11:11-18.
    [70]Ge M, Delgado-Battenfeld C, Jannach D. Beyond accuracy:evaluating recommender systems by coverage and serendipity. Proceedings of Proceedings of the fourth ACM conference on Recom-mender systems. ACM,2010.257-260.
    [71]Jameson A, Smyth B. Recommendation to groups. Proceedings of The adaptive web. Springer, 2007:596-627.
    [72]Yu Z, Zhou X, Hao Y, et al. TV program recommendation for multiple viewers based on user profile merging. User Modeling and User-Adapted Interaction,2006,16(1):63—82.
    [73]Masthoff J. Group modeling:Selecting a sequence of television items to suit a group of viewers. User Modeling and User-Adapted Interaction,2004,14(1):37-85.
    [74]Baltrunas L, Makcinskas T, Ricci F. Group recommendations with rank aggregation and col-laborative filtering. Proceedings of Proceedings of the fourth ACM conference on Recommender systems. ACM,2010.119-126.
    [75]Recio-Garcia J A, Jimenez-Diaz G, Sanchez-Ruiz A A, et al. Personality aware recommendations to groups. Proceedings of Proceedings of the third ACM conference on Recommender systems. ACM,2009.325-328.
    [76]Quijano-Sanchez L, Recio-Garcia J A, Diaz-Agudo B. Personality and social trust in group rec-ommendations. Proceedings of Tools with Artificial Intelligence (ICTAI),2010 22nd IEEE Inter-national Conference on, volume 2. IEEE,2010.121-126.
    [77]Liu Q, Ma H, Chen E, et al. A survey of context-aware mobile recommendations. International Journal of Information Technology & Decision Making,2013,12(01):139-172.
    [78]Scellato S, Noulas A, Mascolo C. Exploiting place features in link prediction on location-based social networks. Proceedings of Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2011.1046-1054.
    [79]Quercia D, Lathia N, Calabrese F, et al. Recommending social events from mobile phone location data. Proceedings of Data Mining (ICDM),2010 IEEE 10th International Conference on. IEEE, 2010.971-976.
    [80]Lawrence R, Almasi G, Kotlyar V, et al. Personalization of supermarket product recommendations. Data Mining and Knowledge Discovery,2001,5(1):11-32.
    [81]Kidokoro H, Kamei K, Shinozawa K, et al. You stopped by there? I recommend this:changing customer behaviors with robots. Proceedings of Proceedings of the 13th international conference on Ubiquitous computing. ACM,2011.569-570.
    [82]Kalnikaitev V, Rogers Y, Bird J, et al. How to nudge in situ:Designing lambent devices to deliver salience information in supermarkets.2011..
    [83]Ge Y, Xiong H, Tuzhilin A, et al. An energy-efficient mobile recommender system. Proceedings of Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2010.899-908.
    [84]Yuan J, Zheng Y, Zhang C, et al. T-drive:driving directions based on taxi trajectories. Proceed-ings of Proceedings of the 18th SIGSPATIAL International conference on advances in geographic information systems. ACM,2010.99-108.
    [85]Zhu H, Yu K, Cao H, et al. Mining Personal Context-Aware Preferences for Mobile Users. Pro-ceedings of the 2012 IEEE International Conference on Data Mining,2012..
    [86]Zhuang J, Mei T, Hoi S, et al. When recommendation meets mobile:contextual and personalized recommendation on the go. Proceedings of Proceedings of the 13th international conference on Ubiquitous computing. ACM,2011.153-162.
    [87]Marmasse N, Schmandt C. Location-aware information delivery with commotion. Proceedings of Handheld and Ubiquitous Computing. Springer,2000.361-370.
    [88]Zheng Y, Zhang L, Xie X, et al. Mining interesting locations and travel sequences from GPS trajectories. Proceedings of Proceedings of the 18th international conference on World wide web. ACM,2009.791-800.
    [89]Park M, Hong J, Cho S. Location-based recommendation system using Bayesian user's preference model in mobile devices. Ubiquitous Intelligence and Computing,2007.1130-1139.
    [90]Ye M, Shou D, Lee W, et al. On the semantic annotation of places in location-based social networks. Proceedings of Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2011.520-528.
    [91]Isaacman S, Becker R, Caceres R, et al. Identifying important places in people's lives from cellular network data. Pervasive Computing,2011.133-151.
    [92]Alvares L, Bogorny V, Kuijpers B, et al. Towards semantic trajectory knowledge discovery. Re-latorio tecnico. Hasselt University,2007.12.
    [93]Li Q, Zheng Y, Xie X, et al. Mining user similarity based on location history. Proceedings of Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems. ACM,2008.34.
    [94]Zheng Y, Zhang L, Ma Z, et al. Recommending friends and locations based on individual location history. ACM Transactions on the Web (TWEB),2011,5(1):5.
    [95]Xiao X, Zheng Y, Luo Q, et al. Finding similar users using category-based location history. Proceedings of Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM,2010.442-445.
    [96]Agrawal R, Srikant R, et al. Fast algorithms for mining association rules. Proceedings of Proc. 20th Int. Conf. Very Large Data Bases, VLDB, volume 1215,1994.487-499.
    [97]Cao H, Bao T, Yang Q, et al. An effective approach for mining mobile user habits. Proceedings of Proceedings of the 19th ACM international conference on Information and knowledge manage-ment. ACM,2010.1677-1680.
    [98]Mabroukeh N, Ezeife C. A taxonomy of sequential pattern mining algorithms. ACM Computing Surveys (CSUR),2010,43(1):3.
    [99]Zheng Y, Zha Z, Chua T. Mining Travel Patterns from Geotagged Photos. ACM Transactions on Intelligent Systems and Technology (TIST),2012,3(3):56.
    [100]Li Z, Ding B, Han J, et al. Mining periodic behaviors for moving objects. Proceedings of Pro-ceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2010.1099-1108.
    [101]Wang Y, Cong G, Song G, et al. Community-based greedy algorithm for mining top-k influ-ential nodes in mobile social networks. Proceedings of Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2010.1039-1048.
    [102]Srivastava J, Cooley R, Deshpande M, et al. Web usage mining:Discovery and applications of usage patterns from web data. ACM SIGKDD Explorations Newsletter,2000, 1(2):12-23.
    [103]Yuan J, Zheng Y, Xie X. Discovering regions of different functions in a city using human mobility and pois. KDD?2,2012..
    [104]Singh A, Gordon G. A unified view of matrix factorization models. Machine Learning and Knowledge Discovery in Databases,2008.358-373.
    [105]Baltrunas L, Ludwig B, Ricci F. Matrix factorization techniques for context aware recommenda-tion. Proceedings of Proceedings of the fifth ACM conference on Recommender systems. ACM, 2011.301-304.
    [106]Yu K, Zhang B, Zhu H, et al. Towards personalized context-aware recommendation by mining context logs through topic models. Advances in Knowledge Discovery and Data Mining,2012. 431-443.
    [107]Adomavicius G, Tuzhilin A. Context-aware recommender systems. Proceedings of Recommender Systems Handbook. Springer,2011:217-253.
    [108]Liu Q, Ge Y, Li Z, et al. Personalized Travel Package Recommendation. Proceedings of Data Mining (ICDM),2011 IEEE 11th International Conference on,2011.407-416.
    [109]Panniello U, Tuzhilin A, Gorgoglione M, et al. Experimental comparison of pre-vs. post-filtering approaches in context-aware recommender systems. Proceedings of Proceedings of the third ACM conference on Recommender systems. ACM,2009.265-268.
    [110]Ge Y, Liu Q, Xiong H, et al. Cost-aware travel tour recommendation. Proceedings of Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2011.983-991.
    [111]Strobbe M, Van Laere O, Dhoedt B, et al. Hybrid reasoning technique for improving context-aware applications. Knowledge and information systems,2012,31(3):581-616.
    [112]"Riboni D, Pareschi L, Bettini C. Privacy in georeferenced context-aware services:A survey. Privacy in Location-Based Applications,2009.151-172.
    [113]Sarwar B, Karypis G, Konstan J, et al. Item-based collaborative filtering recommendation al-gorithms. Proceedings of Proceedings of the 10th international conference on World Wide Web. ACM,2001.285-295.
    [114]Wijaya D T, Bressan S. A random walk on the red carpet: rating movies with user reviews and pagerank. Proceedings of Proceedings of the 17th ACM conference on Information and knowledge management. ACM,2008.951-960.
    [115]Hofmann T. Probabilistic latent semantic analysis. Proceedings of Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc.,1999. 289-296.
    [116]Deerwester S, Dumais S T, Purnas G W, et al. Indexing by latent semantic analysis. Journal of the American society for information science,1990,41(6):391-407.
    [117]Kurucz M, Benczur A A, Csalogany K. Methods for large scale SVD-with missing values. Pro-ceedings of Proceedings of KDD Cup and Workshop, volume 12. Citeseer,2007.31-38.
    [118]Funk S. Netflix update:Try this at home,2006.
    [119]Liu N N, Zhao M, Yang Q. Probabilistic latent preference analysis for collaborative filtering. Pro-ceedings of Proceedings of the 18th ACM conference on Information and knowledge management. ACM,2009.759-766.
    [120]Hofmann T. Latent semantic models for collaborative filtering. ACM Transactions on Information Systems (TOIS),2004,22(1):89-115.
    [121]Asuncion A, Welling M, Smyth P, et al. On smoothing and inference for topic models. Proceedings of Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. AUAI Press,2009.27-34.
    [122]Canini K R, Shi L, Griffiths T L. Online inference of topics with latent Dirichlet allocation. Proceedings of Proceedings of the International Conference on Artificial Intelligence and Statistics, volume 5,2009.65-72.
    [123]Wallach H M, Murray I, Salakhutdinov R, et al. Evaluation methods for topic models. Proceedings of Proceedings of the 26th Annual International Conference on Machine Learning. ACM,2009. 1105-1112.
    [124]Griffiths T L, Steyvers M. Finding scientific topics. Proceedings of the National academy of Sciences of the United States of America,2004,101(Suppl 1):5228-5235.
    [125]Wei X, Croft W B. LDA-based document models for ad-hoc retrieval. Proceedings of Proceed-ings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM,2006.178-185.
    [126]Goldberg K, Roeder T, Gupta D, et al. Eigentaste:A constant time collaborative filtering algo-rithm. Information Retrieval,2001,4(2):133-151.
    [127]Chen W Y, Chu J C, Luan J, et al. Collaborative filtering for orkut communities:discovery of user latent behavior. Proceedings of Proceedings of the 18th international conference on World wide web. ACM,2009.681-690.
    [128]Schein A I, Popescul A, Ungar L H, et al. Methods and metrics for cold-start recommendations. Proceedings of Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval. ACM,2002.253-260.
    [129]Blei D M, Lafferty J D, A correlated topic model of science. The Annals of Applied Statistics, 2007.17-35.
    [130]Jeh G, Widom J. Scaling personalized web search. Proceedings of Proceedings of the 12th international conference on World Wide Web. ACM,2003.271-279.
    [131]Steyvers M, Griffiths T. Probabilistic topic models. Handbook of latent semantic analysis,2007, 427(7):424-440.
    [132]Minka T. Estimating a Dirichlet distribution,2000.
    [133]Wallach H M. Structured topic models for language. Unpublished doctoral dissertation, Univ. of Cambridge,2008..
    [134]Wu H, Wang Y, Cheng X. Incremental probabilistic latent semantic analysis for automatic question recommendation. Proceedings of Proceedings of the 2008 ACM conference on Recommender systems. ACM,2008.99-106.
    [135]Phan X H, Nguyen L M, Horiguchi S. Learning to classify short and sparse text & web with hidden topics from large-scale data collections. Proceedings of Proceedings of the 17th international conference on World Wide Web. ACM,2008.91-100.
    [136]Mei Q, Shen X, Zhai C. Automatic labeling of multinomial topic models. Proceedings of Pro-ceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2007.490-499.
    [137]Abowd G D, Atkeson C G, Hong J, et al. Cyberguide:A mobile context-aware tour guide. Wireless networks,1997,3(5):421-433.
    [138]Averjanova O, Ricci F, Nguyen Q N. Map-based interaction with a conversational mobile recom-mender system. Proceedings of Mobile Ubiquitous Computing, Systems, Services and Technolo-gies,2008. UBICOMM'08. The Second International Conference on. IEEE,2008.212-218.
    [139]Cena F, Console L, Gena C, et al. Integrating heterogeneous adaptation techniques to build a flexible and usable mobile tourist guide. AI Communications,2006,19(4):369-384.
    [140]Cheverst K, Davies N, Mitchell K, et al. Developing a context-aware electronic tourist guide:some issues and experiences. Proceedings of Proceedings of the SIGCHI conference on Human factors in computing systems. ACM,2000.17-24.
    [141]Yin H, Lu X, Wang C, et al. Photo2trip:an interactive trip planning system based on geo-tagged photos. Proceedings of Proceedings of the international conference on Multimedia. ACM,2010. 1579-1582.
    [142]Wu X, Li J, Zhang Y, et al. Personalized multimedia web summarizer for tourist. Proceedings of Proceedings of the 17th international conference on World Wide Web. ACM,2008.1025-1026.
    [143]Ricci F, Cavada D, Mirzadeh N, et al. Case-based travel recommendations. Destination Recom-mendation Systems:Behavioural Foundations and Applications,2006.67-93.
    [144]Hao Q, Cai R, Wang C, et al. Equip tourists with knowledge mined from travelogues. Proceedings of Proceedings of the 19th international conference on World wide web. ACM,2010.401-410.
    [145]Ricci F, Fesenmaier D R, Mirzadeh N, et al. DieToRecs:a case-based travel advisory system. Destination Recommendation Systems:Behavioural Foundations and Applications,2006.227—239.
    [146]Venturini A, Ricci F. Applying Trip@ dvice Recommendation Technology to www. visiteurope. com. Frontiers in Artificial Intelligence and Applications,2006,141:607.
    [147]Xie M, Lakshmanan L V, Wood P T. Breaking out of the box of recommendations:from items to packages. Proceedings of Proceedings of the fourth ACM conference on Recommender systems. ACM,2010.151-158.
    [148]Ricci F. Mobile recommender systems. Information Technology & Tourism,2010,12(3):205-231.
    [149]De Carolis B, Novielli N, Plantamura V L, et al. Generating comparative descriptions of places of interest in the tourism domain. Proceedings of Proceedings of the third ACM conference on Recommender systems. ACM,2009.277-280.
    [150]Ricci F, Nguyen Q N. Mobyrek:A conversational recommender system for on-the-move travelers. Destination Recommendation Systems:Behavioural Foundations and Applications,2006.281—294.
    [151]Gretzel U. Intelligent systems in tourism:A social science perspective. Annals of Tourism Re-search,2011,38(3):757-779.
    [152]Staab S, Werthner H, Ricci F, et al. Intelligent systems for tourism. IEEE Intelligent Systems, 2002,17:53-66.
    [153]Rosen-Zvi M, Griffiths T, Steyvers M, et al. The author-topic model for authors and documents. Proceedings of Proceedings of the 20th conference on Uncertainty in artificial intelligence. AUAI Press,2004.487-494.
    [154]McCallum A, Wang X, Corrada-Emmanuel A. Topic and role discovery in social networks with experiments on enron and academic email. Journal of Artificial Intelligence Research,2007, 30(l):249-272.
    [155]Wang C, Blei D M. Collaborative topic modeling for recommending scientific articles. Proceedings of Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2011.448-456.
    [156]Cressie N. Statistics for spatial data. Terra Nova,1992,4(5):613-617.
    [157]Fayyad U, Irani K. Multi-interval discretization of continuous-valued attributes for classification learning.1993..
    [158]Lai S, Xiang L, Diao R, et al. Hybrid recommendation models for binary user preference prediction problem. KDD Cup,2011..
    [159]Jarvelin K, Kekalainen J. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS),2002,20(4):422-446.
    [160]Liu N N, Yang Q. Eigenrank:a ranking-oriented approach to collaborative filtering. Proceedings of Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval. ACM,2008.83-90.
    [161]Golbandi N, Koren Y, Lempel R. Adaptive bootstrapping of recommender systems using decision trees. Proceedings of Proceedings of the fourth ACM international conference on Web search and data mining. ACM,2011.595-604.
    [162]Liu N N, Meng X, Liu C, et al. Wisdom of the better few:cold start recommendation via representative based rating elicitation. Proceedings of Proceedings of the fifth ACM conference on Recommender systems. ACM,2011.37-44.
    [163]Nguyen A T, Denos N, Berrut C. Improving new user recommendations with rule-based induction on cold user data. Proceedings of Proceedings of the 2007 ACM conference on Recommender systems. ACM,2007.121-128.
    [164]Xiang B, Liu Q, Chen E, et al. Pagerank with priori:an influence propagation perspective. Proceedings of 23rd. International Joint Conference on Artificial Intelligence,2013.
    [165]Anand S S, Griffiths N. A market-based approach to address the new item problem. Proceedings of Proceedings of the fifth ACM conference on Recommender systems. ACM,2011.205—212.
    [166]Goyal A, Lakshmanan L V. RecMax: exploiting recommender systems for fun and profit. Proceed-ings of Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining.. ACM,2012.1294-1302.
    [167]Goldenberg J, Libai B, Muller E. Talk of the network:A complex systems look at the underlying process of word-of-mouth. Marketing letters,2001,12(3):211-223.
    [168]Granovetter M. Threshold models of collective behavior. American journal of sociology,1978. 1420-1443.
    [169]Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. Proceedings of Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2003.137-146.
    [170]Leskovec J, Krause A, Guestrin C, et al. Cost-effective outbreak detection in networks. Proceedings of Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2007.420-429.
    [171]Aggarwal C C, Khan A, Yan X. On flow authority discovery in social networks. Proceedings of Proceedings of SIAM Conference on Data Mining (SDM),2011.522-533.
    [172]Yang Y, Chen E, Liu Q, et al. On approximation of real-world influence spread. Proceedings of Machine Learning and Knowledge Discovery in Databases. Springer,2012:548-564.
    [173]Anagnostopoulos A, Kumar R, Mahdian M. Influence and correlation in social networks. Proceed-ings of Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM,2008.7-15.
    [174]Xiang B, Chen E, Liu Q, et al. A bounded linear approach for influence computing in large-scale social networks. Proceedings of Submitted to KDD'13,2013.
    [175]Jamali M, Ester M. A matrix factorization technique with trust propagation for recommendation in social networks. Proceedings of Proceedings of the fourth ACM conference on Recommender systems. ACM,2010.135-142.
    [176]Ben Abdesslem F, Phillips A, Henderson T. Less is more:energy-efficient mobile sensing with senseless. Proceedings of Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds. ACM,2009.61-62.