Optimal associative neighbor mining using attributes for ubiquitous recommendation systems

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ubiquitous recommendation systems predict new items of interest for a user, based on predictive relationship discovered, between the user and other participants in Ubiquitous Commerce. In this paper, optimal associative neighbor mining, using attributes, for the purpose of improving accuracy and performance in ubiquitous recommendation systems, is proposed, This optimal associative neighbor mining selects the associative users that have similar preferences by extracting the attributes that most affect preferences. The associative user pattern comprising 3-AUs (groups of associative users composed of 3-users), is grouped through the ARHP algorithm. The approach is empirically evaluated, for comparison with the nearest-neighbor model and k-means clustering, using the MovieLens datasets. This method can solve the large-scale dataset problem without deteriorating accuracy quality. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Jung, K. Y., Hwang, H. J., & Kang, U. G. (2006). Optimal associative neighbor mining using attributes for ubiquitous recommendation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4027 LNAI, pp. 458–469). Springer Verlag. https://doi.org/10.1007/11766254_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free