Cluster searching strategies for collaborative recommendation systems

Download

index.pdf

Date

2013-05-01

Author

Altıngövde, İsmail Sengör
Ulusoy, Ozgur

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

134
views

0
downloads

In-memory nearest neighbor computation is a typical collaborative filtering approach for high recommendation accuracy. However, this approach is not scalable given the huge number of customers and items in typical commercial applications. Cluster-based collaborative filtering techniques can be a remedy for the efficiency problem, but they usually provide relatively lower accuracy figures, since they may become over-generalized and produce less-personalized recommendations. Our research explores an individualistic strategy which initially clusters the users and then exploits the members within clusters, but not just the cluster representatives, during the recommendation generation stage. We provide an efficient implementation of this strategy by adapting a specifically tailored cluster-skipping inverted index structure. Experimental results reveal that the individualistic strategy with the cluster-skipping index is a good compromise that yields high accuracy and reasonable scalability figures.

Subject Keywords

Collaborative filtering, Clustering, Inverted index

URI

https://hdl.handle.net/11511/43997

Journal

INFORMATION PROCESSING & MANAGEMENT

DOI

https://doi.org/10.1016/j.ipm.2012.07.008

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Using Social Networks to Solve Data Sparsity Problem in One-Class Collaborative Filtering KAYA, hamza; Alpaslan, Ferda Nur (2010-04-14) One-Class Collaborative Filtering (OCCF) problems are more problematic than traditional collaborative filtering problems, since OCCF datasets lack counter-examples. Social networks can be used to remedy dataset issues faced by OCCF applications. In this work, we compare social networks belong to specific domains and the ones belong to more generic domains in terms of their usability in OCCF problems. Our experiments show that social networks that belong to a specific domain may better be appropriate for use...
Exploiting Index Pruning Methods for Clustering XML Collections Altıngövde, İsmail Sengör; Ulusoy, Ozgur (2010-01-01) In this paper, we first employ the well known Cover-Coefficient Based Clustering Methodology (C3 M) for clustering XML documents. Next, we apply index pruning techniques from the literature to reduce the size of the document vectors. Our experiments show that for certain cases, it is possible to prune up to 70% of the collection (or, more specifically, underlying document vectors) and still generate a clustering structure that yields the same quality with that of the original collection, in terms of a set o...
Image Annotation With Semi-Supervised Clustering Sayar, Ahmet; Yarman Vural, Fatoş Tunay (2009-09-16) Methods developed for image annotation usually make use of region clustering algorithms. Visual codebooks are generated from the region clusters of low level features. These codebooks are then, matched with the words of the text document related to the image, in various ways. In this paper, we supervise the clustering process by using three types of side information. The first one is the topic probability information obtained from the text document associated with the image. The second is the orientation an...
Consensus clustering of time series data Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014) In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Low-frequency multilevel fast multipole algorithm using an approximate diagonalization of the Green's function Ergül, Özgür Salih (2014-08-23) We present an approximate diagonalization of the Green's function to implement a stable multilevel fast multipole algorithm (MLFMA) for low-frequency problems. The diagonalization is based on scaled spherical functions, leading to stable computations of translation operators at all distances and for all frequencies. Similar to the conventional diagonalization, shift operators are expressed in terms of complex exponentials, while radiated and incoming fields are expanded in terms of scaled plane waves. Even ...

Citation Formats

İ. S. Altıngövde and O. Ulusoy, “Cluster searching strategies for collaborative recommendation systems,” INFORMATION PROCESSING & MANAGEMENT, pp. 688–697, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43997.