Pairwise interaction tensor factorization for personalized tag recommendation

dc.contributor.authorRendle, Steffen
dc.contributor.authorSchmidt-Thieme, Larsdeu
dc.date.accessioned2011-09-08T06:07:58Zdeu
dc.date.available2011-09-08T06:07:58Zdeu
dc.date.issued2010
dc.description.abstractTagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization models based on the Tucker Decomposition (TD) model have been shown to provide high quality tag recommendations outperforming other approaches like PageRank, FolkRank, collaborative filtering, etc. The problem with TD models is the cubic core tensor resulting in a cubic runtime in the factorization dimension for prediction and learning. In this paper, we present the factorization model PITF (Pairwise Interaction Tensor Factorization) which is a special case of the TD model with linear runtime both for learning and prediction. PITF explicitly models the pairwise interactions between users, items and tags. The model is learned with an adaption of the Bayesian personalized ranking (BPR) criterion which originally has been introduced for item recommendation. Empirically, we show on real world datasets that this model outperforms TD largely in runtime and even can achieve better prediction quality. Besides our lab experiments, PITF has also won the ECML/PKDD Discovery Challenge 2009 for graph-based tag recommendation.eng
dc.description.versionpublished
dc.identifier.citationFirst publ. in: WSDM : proceedings of the Third ACM International Conference on Web Search & Data Mining; February 3 - 6, 2010, New York City, NY, USA. New York: ACM, 2010, pp. 81-90deu
dc.identifier.doi10.1145/1718487.1718498
dc.identifier.urihttp://kops.uni-konstanz.de/handle/123456789/12685
dc.language.isoengdeu
dc.legacy.dateIssued2011-09-08deu
dc.rightsterms-of-usedeu
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/deu
dc.subjectAlgorithmsdeu
dc.subjectExperimentationdeu
dc.subjectMeasurementdeu
dc.subjectPerformancedeu
dc.subject.ddc004deu
dc.titlePairwise interaction tensor factorization for personalized tag recommendationeng
dc.typeINPROCEEDINGSdeu
dspace.entity.typePublication
kops.citation.bibtex
@inproceedings{Rendle2010Pairw-12685,
  year={2010},
  doi={10.1145/1718487.1718498},
  title={Pairwise interaction tensor factorization for personalized tag recommendation},
  isbn={978-1-60558-889-6},
  publisher={ACM Press},
  address={New York, New York, USA},
  booktitle={Proceedings of the third ACM international conference on Web search and data mining - WSDM '10},
  pages={81--90},
  author={Rendle, Steffen and Schmidt-Thieme, Lars}
}
kops.citation.iso690RENDLE, Steffen, Lars SCHMIDT-THIEME, 2010. Pairwise interaction tensor factorization for personalized tag recommendation. The third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA, 4. Feb. 2010 - 6. Feb. 2010. In: Proceedings of the third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA: ACM Press, 2010, pp. 81-90. ISBN 978-1-60558-889-6. Available under: doi: 10.1145/1718487.1718498deu
kops.citation.iso690RENDLE, Steffen, Lars SCHMIDT-THIEME, 2010. Pairwise interaction tensor factorization for personalized tag recommendation. The third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA, Feb 4, 2010 - Feb 6, 2010. In: Proceedings of the third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA: ACM Press, 2010, pp. 81-90. ISBN 978-1-60558-889-6. Available under: doi: 10.1145/1718487.1718498eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/12685">
    <dcterms:title>Pairwise interaction tensor factorization for personalized tag recommendation</dcterms:title>
    <dcterms:abstract xml:lang="eng">Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization models based on the Tucker Decomposition (TD) model have been shown to provide high quality tag recommendations outperforming other approaches like PageRank, FolkRank, collaborative filtering, etc. The problem with TD models is the cubic core tensor resulting in a cubic runtime in the factorization dimension for prediction and learning. In this paper, we present the factorization model PITF (Pairwise Interaction Tensor Factorization) which is a special case of the TD model with linear runtime both for learning and prediction. PITF explicitly models the pairwise interactions between users, items and tags. The model is learned with an adaption of the Bayesian personalized ranking (BPR) criterion which originally has been introduced for item recommendation. Empirically, we show on real world datasets that this model outperforms TD largely in runtime and even can achieve better prediction quality. Besides our lab experiments, PITF has also won the ECML/PKDD Discovery Challenge 2009 for graph-based tag recommendation.</dcterms:abstract>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12685"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Rendle, Steffen</dc:contributor>
    <dc:contributor>Schmidt-Thieme, Lars</dc:contributor>
    <dc:creator>Rendle, Steffen</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Schmidt-Thieme, Lars</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-09-08T06:07:58Z</dc:date>
    <dcterms:issued>2010</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: WSDM : proceedings of the Third ACM International Conference on Web Search &amp; Data Mining; February 3 - 6, 2010, New York City, NY, USA. New York: ACM, 2010, pp. 81-90</dcterms:bibliographicCitation>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-09-08T06:07:58Z</dcterms:available>
  </rdf:Description>
</rdf:RDF>
kops.conferencefieldThe third ACM international conference on Web search and data mining - WSDM '10, 4. Feb. 2010 - 6. Feb. 2010, New York, New York, USAdeu
kops.date.conferenceEnd2010-02-06
kops.date.conferenceStart2010-02-04
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-126857deu
kops.location.conferenceNew York, New York, USA
kops.sourcefield<i>Proceedings of the third ACM international conference on Web search and data mining - WSDM '10</i>. New York, New York, USA: ACM Press, 2010, pp. 81-90. ISBN 978-1-60558-889-6. Available under: doi: 10.1145/1718487.1718498deu
kops.sourcefield.plainProceedings of the third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA: ACM Press, 2010, pp. 81-90. ISBN 978-1-60558-889-6. Available under: doi: 10.1145/1718487.1718498deu
kops.sourcefield.plainProceedings of the third ACM international conference on Web search and data mining - WSDM '10. New York, New York, USA: ACM Press, 2010, pp. 81-90. ISBN 978-1-60558-889-6. Available under: doi: 10.1145/1718487.1718498eng
kops.submitter.emailmichael.ketzer@uni-konstanz.dedeu
kops.title.conferenceThe third ACM international conference on Web search and data mining - WSDM '10
relation.isAuthorOfPublication4f5eec3c-8dab-45fd-8283-03c539e97f8d
relation.isAuthorOfPublication.latestForDiscovery4f5eec3c-8dab-45fd-8283-03c539e97f8d
source.bibliographicInfo.fromPage81
source.bibliographicInfo.toPage90
source.identifier.isbn978-1-60558-889-6
source.publisherACM Press
source.publisher.locationNew York, New York, USA
source.titleProceedings of the third ACM international conference on Web search and data mining - WSDM '10

Dateien

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
1.92 KB
Format:
Plain Text
Beschreibung:
license.txt
license.txtGröße: 1.92 KBDownloads: 0