File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Modeling Implicit Communities in Recommender Systems

TitleModeling Implicit Communities in Recommender Systems
Authors
KeywordsRecommender systems
Implicit community
Gibbs sampling
Issue Date2017
PublisherSpringer.
Citation
The 18th International Conference on Web Information Systems Engineering, Puschino, Russia, 7-11 October 2017, p. 387-402 How to Cite?
AbstractIn recommender systems, a group of users may have similar preferences on a set of items. As the groups of users and items are not explicitly given, these similar-preferences groups are called implicit communities (where users inside same communities may not necessarily know each other). Implicit communities can be detected with users’ rating behaviors. In this paper, we propose a unified model to discover the implicit communities with rating behaviors from recommender systems. Following the spirit of Latent Factor Model, we design a bayesian probabilistic graphical model which generates the implicit communities, where the latent vectors of users/items inside the same community follow the same distribution. An implicit community model is proposed based on rating behaviors and a Gibbs Sampling based algorithm is proposed for corresponding parameter inferences. To the best of our knowledge, this is the first attempt to integrate the rating information into implicit communities for recommendation. We provide a linear model (matrix factorization based) and a non-linear model (deep neural network based) for community modeling in recsys. Extensive experiments on seven real-world datasets have been conducted in comparison with 14 state-of-art recommendation algorithms. Statistically significant improvements verify the effectiveness of the proposed implicit community based models. They also show superior performances in cold-start scenarios, which contributes to the application of real-life recommender systems.
Persistent Identifierhttp://hdl.handle.net/10722/245457
ISBN
ISSN
2023 SCImago Journal Rankings: 0.606
ISI Accession Number ID
Series/Report no.Lecture Notes in Computer Science book series (LNCS, volume 10570)

 

DC FieldValueLanguage
dc.contributor.authorLin, X-
dc.contributor.authorGu, Z-
dc.date.accessioned2017-09-18T02:11:03Z-
dc.date.available2017-09-18T02:11:03Z-
dc.date.issued2017-
dc.identifier.citationThe 18th International Conference on Web Information Systems Engineering, Puschino, Russia, 7-11 October 2017, p. 387-402-
dc.identifier.isbn978-3-319-68785-8-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/245457-
dc.description.abstractIn recommender systems, a group of users may have similar preferences on a set of items. As the groups of users and items are not explicitly given, these similar-preferences groups are called implicit communities (where users inside same communities may not necessarily know each other). Implicit communities can be detected with users’ rating behaviors. In this paper, we propose a unified model to discover the implicit communities with rating behaviors from recommender systems. Following the spirit of Latent Factor Model, we design a bayesian probabilistic graphical model which generates the implicit communities, where the latent vectors of users/items inside the same community follow the same distribution. An implicit community model is proposed based on rating behaviors and a Gibbs Sampling based algorithm is proposed for corresponding parameter inferences. To the best of our knowledge, this is the first attempt to integrate the rating information into implicit communities for recommendation. We provide a linear model (matrix factorization based) and a non-linear model (deep neural network based) for community modeling in recsys. Extensive experiments on seven real-world datasets have been conducted in comparison with 14 state-of-art recommendation algorithms. Statistically significant improvements verify the effectiveness of the proposed implicit community based models. They also show superior performances in cold-start scenarios, which contributes to the application of real-life recommender systems.-
dc.languageeng-
dc.publisherSpringer.-
dc.relation.ispartofWeb Information Systems Engineering – WISE 2017-
dc.relation.ispartofseriesLecture Notes in Computer Science book series (LNCS, volume 10570)-
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-68786-5_31-
dc.subjectRecommender systems-
dc.subjectImplicit community-
dc.subjectGibbs sampling-
dc.titleModeling Implicit Communities in Recommender Systems-
dc.typeConference_Paper-
dc.identifier.emailGu, Z: zqgu@hku.hk-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-319-68786-5_31-
dc.identifier.scopuseid_2-s2.0-85031413820-
dc.identifier.hkuros278401-
dc.identifier.spage387-
dc.identifier.epage402-
dc.identifier.eissn1611-3349-
dc.identifier.isiWOS:000739732200031-
dc.publisher.placeCham-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats