scispace - formally typeset
Proceedings ArticleDOI

Interest Diffusion in Heterogeneous Information Network for Personalized Item Ranking

TLDR
An interest diffusion methodology in heterogeneous information network for items to be recommended using the meta-information related to items is proposed and compared with the state-of-the-art techniques using the real-world datasets show the effectiveness of the proposed approach.
Abstract
Personalized item ranking for recommending top-N items of interest to a user is an interesting and challenging problem in e-commerce. Researchers and practitioner are continuously trying to devise new methodologies to improve the accuracy of recommendations. Recommendation problem becomes more challenging for sparse binary implicit feedback, due to the absence of explicit signals of interest and sparseness of data. In this paper, we deal with the problem of the sparseness of data and accuracy of recommendations. To address the issue, we propose an interest diffusion methodology in heterogeneous information network for items to be recommended using the meta-information related to items. In this heterogeneous information network, graph regularized interest diffusion is performed to generate personalized recommendations of top-N items. For interest diffusion, personalized weight learning is performed for different meta-information object types in the network. The experimental evaluation and comparison of the proposed methodology with the state-of-the-art techniques using the real-world datasets show the effectiveness of the proposed approach

read more

Citations
More filters
Journal ArticleDOI

Recommendation generation using personalized weight of meta-paths in heterogeneous information networks

TL;DR: This work proposes a heterogeneous information network-based recommendation model called HeteroPRS for personalized top-N recommendations using binary implicit feedback that utilizes the potential of meta-information related to items to improve the effectiveness of the recommendations.
Journal ArticleDOI

Personalized product search based on user transaction history and hypergraph learning

TL;DR: A new re-ranking method for personalized product search, in which user’s transaction history is utilized to choose products which is closer to the user�'s preference into the higher positions, which is much better than the comparison methods.
Journal ArticleDOI

Joint Reason Generation and Rating Prediction for Explainable Recommendation

TL;DR: Li et al. as discussed by the authors proposed an Encoder-Decoder and Multi-Layer Perception (MLP) based explainable recommendation model named EMER to simultaneously implement reason generation and rating prediction.
Proceedings ArticleDOI

A Comparative Study on Graph-based Ranking Algorithms for Consumer-oriented Demand Side Management

TL;DR: In this article, the authors present an innovative ranking approach as Demand Side Management technique for estimating the amount of energy used by consumers toward identifying potential savings. And they further present comparative analysis of five unsupervised graph-based ranking techniques such as PageRank, TrustRank, Hyperlink-induced search, Markov chain, and Differential ranking algorithms for proffering suitable solution to energy conservation problems.
References
More filters
Proceedings Article

BPR: Bayesian personalized ranking from implicit feedback

TL;DR: In this article, the authors proposed a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem, which is based on stochastic gradient descent with bootstrap sampling.
Proceedings ArticleDOI

Collaborative Filtering for Implicit Feedback Datasets

TL;DR: This work identifies unique properties of implicit feedback datasets and proposes treating the data as indication of positive and negative preference associated with vastly varying confidence levels, which leads to a factor model which is especially tailored for implicit feedback recommenders.
Journal ArticleDOI

PathSim: meta path-based top-K similarity search in heterogeneous information networks

TL;DR: Under the meta path framework, a novel similarity measure called PathSim is defined that is able to find peer objects in the network (e.g., find authors in the similar field and with similar reputation), which turns out to be more meaningful in many scenarios compared with random-walk based similarity measures.
Proceedings ArticleDOI

One-Class Collaborative Filtering

TL;DR: This paper considers the one-class problem under the CF setting, and proposes two frameworks to tackle OCCF, one based on weighted low rank approximation; the other based on negative example sampling.
Proceedings ArticleDOI

Personalized entity recommendation: a heterogeneous information network approach

TL;DR: This paper proposes to combine heterogeneous relationship information for each user differently and aim to provide high-quality personalized recommendation results using user implicit feedback data and personalized recommendation models.
Related Papers (5)