Improving Tensor Based Recommenders with Clustering

Martin Leginus, Peter Dolog, Valdas Zemaitis

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

14 Citations (Scopus)

Abstract

Social tagging systems (STS) model three types of entities
(i.e. tag-user-item) and relationships between them are encoded into a
3-order tensor. Latent relationships and patterns can be discovered by
applying tensor factorization techniques like Higher Order Singular Value
Decomposition (HOSVD), Canonical Decomposition etc. STS accumulate large amount of sparse data that restricts factorization techniques
to detect latent relations and also significantly slows down the process
of a factorization. We propose to reduce tag space by exploiting clustering techniques so that the quality of the recommendations and execution time are improved and memory requirements are decreased. The
clustering is motivated by the fact that many tags in a tag space are
semantically similar thus the tags can be grouped. Finally, promising
experimental results are presented
Original languageEnglish
Title of host publicationUser Modeling, Adaptation, and Personalization : 20th International Conference, UMAP 2012, Montreal, Canada, July 16-20, 2012. Proceedings
Number of pages10
Volume7379
Place of PublicationBerlin
PublisherSpringer
Publication date2012
Pages151-163
ISBN (Print)978-3-642-31453-7
ISBN (Electronic)978-3-642-31454-4
DOIs
Publication statusPublished - 2012
EventUser Modeling, Adaptation, and Personalization - Montreal, Canada
Duration: 16 Jul 201220 Jul 2012
Conference number: 20

Conference

ConferenceUser Modeling, Adaptation, and Personalization
Number20
Country/TerritoryCanada
CityMontreal
Period16/07/201220/07/2012
SeriesLecture Notes in Computer Science
Volume7379
ISSN0302-9743

Keywords

  • tensor factorization
  • HOSVD
  • clustering.

Fingerprint

Dive into the research topics of 'Improving Tensor Based Recommenders with Clustering'. Together they form a unique fingerprint.

Cite this