ACM Home Page
Please provide us with feedback. Feedback
kNN CF: a temporal social network
Full text PdfPdf (604 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the 2008 ACM conference on Recommender systems table of contents
Lausanne, Switzerland
POSTER SESSION: Posters table of contents
Pages 227-234  
Year of Publication: 2008
ISBN:978-1-60558-093-7
Authors
Neal Lathia  University College London, London, United Kingdom
Stephen Hailes  University College London, London, United Kingdom
Licia Capra  University College London, London, United Kingdom
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 188,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454008.1454044
What is a DOI?

ABSTRACT

Recommender systems, based on collaborative filtering, draw their strength from techniques that manipulate a set of user-rating profiles in order to compute predicted ratings of unrated items. There are a wide range of techniques that can be applied to this problem; however, the k-nearest neighbour (kNN) algorithm has become the dominant method used in this context. Much research to date has focused on improving the performance of this algorithm, without considering the properties that emerge from manipulating the user data in this way. In order to understand the effect of kNN on a user-rating dataset, the algorithm can be viewed as a process that generates a graph, where nodes are users and edges connect similar users: the algorithm generates an implicit social network amongst the system subscribers. Temporal updates of the recommender system will impose changes on the graph. In this work we analyse user-user kNN graphs from a temporal perspective, retrieving characteristics such as dataset growth, the evolution of similarity between pairs of users, the volatility of user neighbourhoods over time, and emergent properties of the entire graph as the algorithm parameters change. These insights explain why certain kNN parameters and similarity measures outperform others, and show that there is a surprising degree of structural similarity between these graphs and explicit user social networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
M. J. Pazzani and D. Billsus. Content-based recommendation systems. The Adaptive Web, pages 325--341, 2007.
3
4
 
5
A. Barabasi and R. Albert. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, 2002.
6
7
 
8
9
10
 
11
A. M. Rashid, G. Karypis, and J. Riedl. Influence in ratings-based recommender systems: An algorithm-independent approach. In Proceedings of SIAM 2005 Data Mining Conference, 2005.
12

Collaborative Colleagues:
Neal Lathia: colleagues
Stephen Hailes: colleagues
Licia Capra: colleagues