Hypergraph-Based User Preference Drift Recognition in Contextual Recommendation

Article Preview

Abstract:

The knowledge of preference drift is important to maintain the user’s preference accurate. With the swift development of mobile service the recognition of such knowledge has attracted immense attention in recent times. However, existing research based on clustering is inadequate for the description of item objects with weak N-ary associations. This paper, through the analysis of contextual recommendation, proposes a “hypergraph model” for contextual items. Furthermore, similarities between pair of items, item clusters and the degree of user preference drift are defined. Based on above definitions, a method to discover user preference drift is proposed. In addition two experiments are being carried out to validate its significance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

474-478

Citation:

Online since:

January 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A.K. Dey G.D. Abowd, in: Towards a Better Understanding of Context and Context-Awareness volume 17 of Lecture Notes In Computer Science (1999).

DOI: 10.1007/3-540-48157-5_29

Google Scholar

[2] W. Lam,J. Mostafa, in: Modeling User Interest Shift Using a Bayesian Approach, volume 52 of Journal of the American society for information science and technology, Chapter5, (2001).

DOI: 10.1002/1532-2890(2001)9999:9999<::aid-asi1078>3.0.co;2-o

Google Scholar

[3] C. Huanhuan, C. Enhong and Y Jie, in: Enhancing recommender systems under volatile user interest drifts, ACM 18th International Conference on Information and Knowledge Management(2009), in press.

DOI: 10.1145/1645953.1646112

Google Scholar

[4] J.E. Jackson, in: A user's guide to principal components. John Wiley & Sons Inc, New York(1991), in press.

Google Scholar

[5] T. Kohonen, in: Self-Organization and Associated Memory. Springer-Verlag, New York(1988), in press.

Google Scholar

[6] E.H. Han, G. Karypis, V. Kumar, and B. Mobasher. in: Clustering in a high-dimensional space using hypergraph models, Minneapolis : Department of Computer Science, University of Minnesota(1997) , in press.

Google Scholar

[7] G. Adomavicius ,A. Tuzhilin, in: Toward the Next Generation of RecommendatioinSystems: A Survey of the State-of-the-Art and Possible Extensions, volume 17 of IEEE Transactions on Knowledge And Data Engineering, chapter. 6, (2005).

DOI: 10.1109/tkde.2005.99

Google Scholar

[8] U.V. Catalyurek,C. Aykanat, in: PaToH: Partitioning Tool for Hypergraphs, Turkish Science and Research Council(1999), in press.

Google Scholar