Hashing-based semantic relevance attributed knowledge graph embedding enhancement for deep probabilistic recommendation
TL;DR: In this article , the authors proposed a novel KGEE (Knowledge Graph Embedding Enhancement) approach of Hashing-based Semantic-relevance Attributed Graph-embedding Enhancement (H-SAGE) to model semantically-relevant higher-order entities and relations into the unique Meta-paths.
read more
Abstract: Knowledge graph embedding (KGE) is effectively exploited in providing precise and accurate recommendations from many perspectives in different application scenarios. However, such methods that utilize entire embedded Knowledge Graph (KG) without applying information-relevance regulatory constraints fail to stop the noise penetration into the underlying information. Moreover, higher computational time complexity is a CPU overhead in KG-enhanced systems and applications. The occurrence of these limitations significantly degrade the recommendation performance. Therefore, to cope with these challenges we proposed novel KGEE (Knowledge Graph Embedding Enhancement) approach of Hashing-based Semantic-relevance Attributed Graph-embedding Enhancement (H-SAGE) to model semantically-relevant higher-order entities and relations into the unique Meta-paths. For this purpose, we introduced Node Relevance-based Guided-walk (NRG) modeling technique. Further, to deal with the computational time-complexity, we converted the relevant information to the Hash-codes and proposed Deep-Probabilistic (dProb) technique to place hash-codes in the relevant hash-buckets. Again, we used dProb to generate guided function-calls to maximize the possibility of Hash-Hits in the hash-buckets. In case of Hash-Miss, we applied Locality Sensitive (LS) hashing to retrieve the required information. We performed experiments on three benchmark datasets and compared the empirical as well as the computational performance of H-SAGE with the baseline approaches. The achieved results and comparisons demonstrate that the proposed approach has outperformed the-state-of-the-art methods in the mentioned facets of evaluation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Similarity attributed knowledge graph embedding enhancement for item recommendation
TL;DR: SAGE as discussed by the authors constructs entity-relevance-based Similarity-attributed Subgraph (ESS) to remove noise from the underlying data, and simultaneously utilizes feedbacks to enhance the interactions and regularize the model to highlight influential targets (nodes).
21
Categorization of knowledge graph based recommendation methods and benchmark datasets from the perspectives of application scenarios: A comprehensive survey
TL;DR: In this article , the authors explore well-known recommendation systems, popular knowledge repositories, benchmark datasets, recommendation methods, and future research dimensions about the current research, and investigate recommendation methods and associated datasets with respect to the corresponding application scenarios in a categorical way.
19
Deep Learning-Based Recommendation System: Systematic Review and Classification
Caiwen Li,Iskandar Ishak,Hamidah Ibrahim,Maslina Zolkepli,Fatimah Sidi,Caili Li +5 more
TL;DR: This study highlights the emerging area of research in domain classification, which has shown promising results in applying deep learning techniques to domains such as social networks, e-commerce, and e-learning.
13
Continual Knowledge Graph Embedding enhancement for Joint Interaction-based Next Click Recommendation
Nasrullah Khan,Zongmin Ma,Ruizhe Ma,Kemal Polat +3 more
1
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Proceedings Article
Translating Embeddings for Modeling Multi-relational Data
Antoine Bordes,Nicolas Usunier,Alberto Garcia-Duran,Jason Weston,Oksana Yakhnenko +4 more
- 05 Dec 2013
TL;DR: TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
•Posted Content
BPR: Bayesian Personalized Ranking from Implicit Feedback
TL;DR: This paper presents a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem and provides a generic learning algorithm for optimizing models with respect to B PR-Opt.
3.7K
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar,Nicole Immorlica,Piotr Indyk,Vahab Mirrokni +3 more
- 08 Jun 2004
TL;DR: A novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under lp norm, based on p-stable distributions that improves the running time of the earlier algorithm and yields the first known provably efficient approximate NN algorithm for the case p<1.
Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering
Ruining He,Julian McAuley +1 more
- 11 Apr 2016
TL;DR: This paper builds novel models for the One-Class Collaborative Filtering setting, where the goal is to estimate users' fashion-aware personalized ranking functions based on their past feedback and combines high-level visual features extracted from a deep convolutional neural network, users' past feedback, as well as evolving trends within the community.
2.1K