Recommendation on Item Graphs
- 1 December 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE International Conference on Data Mining (ICDM)
- No. 15504786,p. 1119-1123
- https://doi.org/10.1109/icdm.2006.133
Abstract
A novel scheme for item-based recommendation is proposed in this paper. In our framework, the items are described by an undirected weighted graph Q = (V,epsiv). V is the node set which is identical to the item set, and epsiv is the edge set. Associate with each edge eij isin epsiv is a weight omegaij ges 0, which represents similarity between items i and j. Without the loss of generality, we assume that any user's ratings to the items should be sufficiently smooth with respect to the intrinsic structure of the items, i.e., a user should give similar ratings to similar items. A simple algorithm is presented to achieve such a smooth solution. Encouraging experimental results are provided to show the effectiveness of our method.Keywords
This publication has 6 references indexed in Scilit:
- OntoDM: An Ontology of Data MiningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Pattern vectors from algebraic graph theoryIeee Transactions On Pattern Analysis and Machine Intelligence, 2005
- Amazon.com recommendations: item-to-item collaborative filteringIEEE Internet Computing, 2003
- Eigentaste: A Constant Time Collaborative Filtering AlgorithmInformation Retrieval Journal, 2001
- Recommender systems in e-commercePublished by Association for Computing Machinery (ACM) ,1999
- An algorithmic framework for performing collaborative filteringPublished by Association for Computing Machinery (ACM) ,1999