The Open UniversitySkip to content
 

Granular semantic user similarity in the presence of sparse data

Osborne, Francesco; Likavec, Silvia and Cena, Federica (2013). Granular semantic user similarity in the presence of sparse data. In: AI*IA 2013: Advances in Artificial Intelligence: XIIIth International Conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4-6, 2013. Proceedings, Lecture Notes in Computer Science, Springer International Publishing, pp. 385–396.

Full text available as:
[img]
Preview
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (732kB) | Preview
URL: http://aixia2013.i-learn.unito.it/
DOI (Digital Object Identifier) Link: https://doi.org/10.1007/978-3-319-03524-6_33
Google Scholar: Look up in Google Scholar

Abstract

Finding similar users in social communities is often challenging, especially in the presence of sparse data or when working with heterogeneous or specialized domains. When computing semantic similarity among users it is desirable to have a measure which allows to compare users w.r.t. any concept in the domain. We propose such a technique which reduces the problems caused by data sparsity, especially in the cold start phase, and enables granular and context-based adaptive suggestions. It allows referring to a certain set of most similar users in relation to a particular concept when a user needs suggestions about a certain topic (e.g. cultural events) and to a possibly completely different set when the user is interested in another topic (e.g. sport events). Our approach first uses a variation of the spreading activation technique to propagate the users’ interests on their corresponding ontology-based user models, and then computes the concept-biased cosine similarity (CBC similarity), a variation of the cosine similarity designed for privileging a particular concept in an ontology. CBC similarity can be used in many adaptation techniques to improve suggestions to users. We include an empirical evaluation on a collaborative filtering algorithm, showing that the CBC similarity works better than the cosine similarity when dealing with sparse data.

Item Type: Conference or Workshop Item
Copyright Holders: 2013 Springer International Publishing Switzerland
ISBN: 3-319-03523-1, 978-3-319-03523-9
ISSN: 0302-9743
Extra Information: recommender systems; ontology; propagation of interests; user similarity; data sparsity; cosine similarity
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 41689
Depositing User: Kay Dave
Date Deposited: 19 Jan 2015 12:41
Last Modified: 04 Oct 2016 16:16
URI: http://oro.open.ac.uk/id/eprint/41689
Share this page:

Altmetrics

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk