A Novel Item Cluster-Based Collaborative Filtering Recommendation System

Yuching Lu (), Koki Tozuka, Goutam Chakraborty and Masafumi Matsuhara
Additional contact information
Yuching Lu: Iwate Prefectural University
Koki Tozuka: Iwate Prefectural University
Goutam Chakraborty: Iwate Prefectural University
Masafumi Matsuhara: Iwate Prefectural University

The Review of Socionetwork Strategies, 2021, vol. 15, issue 2, 327-346

Abstract: Abstract Recent exponential expansion of users adopting to applications on the mobile internet, like e-commerce and social networks, warrants mining of the huge data collected from users’ past actions, for improving businesses and services. The core step for mining is to cluster the data meaningfully, conforming to the application. Social network data are structured, and graphical presentation reveals that structure. Therefore, graph clustering is an effective way to divulge the underlying structure in the data. For clustering, calculating similarity between a pair of vectors is the first step. The large dimension of the data, which is often noisy and sparse, makes distance measurement hard. In high dimension, most of the conventional distance metrics fail to work, as the data points are distributed over the surface of the high-dimensional hyper-space. The traditional concept of similarity, and nearest-neighbor does not hold. The variance of distance between any pair of points shrinks as the dimension increases. In this work, we investigate the efficacy of various similarity measures and clustering algorithms on high dimensional data. We experimented with a real-world high-dimensional matrix data, the ratings of movies by users. Clustering of movie items depends on a number of factors like movie genre, actors, directors, prominent acclaimed movie or an obscure one, etc. Different similarity measurements and clustering algorithms were experimented. Clustering results were evaluated by matching with known annotations of the movies. Finally, we proposed a novel recommendation algorithm based on item clustering. Its performance was evaluated with different distance metrics and clustering algorithms. Methods elaborated are applicable to other structured data generated in social network applications, or in biological investigations.

Keywords: Adjacency matrix; Similarity metrics; Fractional norm; Spectral clustering; Cluster evaluation (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12626-021-00084-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:trosos:v:15:y:2021:i:2:d:10.1007_s12626-021-00084-7

Ordering information: This journal article can be ordered from
https://www.springer ... ystems/journal/12626

DOI: 10.1007/s12626-021-00084-7

Access Statistics for this article

The Review of Socionetwork Strategies is currently edited by Katsutoshi Yada, Yasuharu Ukai and Marshall Van Alstyne

More articles in The Review of Socionetwork Strategies from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().