인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 저자정보
초록·키워드
Information overload and complex user interactions make it difficult to retrieve valuable data. Recommendation systems have become crucial in addressing this challenge by providing users with relevant information and items. Collaborative filtering-based recommendation methods, which are commonly used in this context, often suffer from data scarcity, thus limiting their effectiveness for users with insufficient interaction data. To overcome this problem, knowledge graphs have been integrated into recommendation systems to enhance user and item representation through the implementation of additional semantic relatedness. Despite their potential utility, most recommendation models assume binary relations within knowledge graphs, thereby overlooking the high-order relationships that are prevalent in knowledge graphs. Knowledge hypergraphs, which can capture complex and multi-dimensional relationships, offer a solution to this limitation. This paper proposes KHG-Aclair, a novel recommendation system that leverages hypergraphs to uncover hidden features within knowledge graphs, thus enhancing recommendation accuracy and insight. We have transformed the Freebase knowledge graph into a knowledge hypergraph and made this dataset publicly available. KHG-Aclair also incorporates contrastive learning to refine the knowledge hypergraph, thus reducing noise and improving representation for less popular items. Altogether, our model demonstrates strong generalizability, as it achieves high performance across multiple datasets, thus indicating that it can serve as a versatile solution for various recommendation systems. Our implementation codes are available at https://github.com/HBD-NGC1316/KHG-Aclair.
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
UCI(KEPA) : I410-151-25-02-091192272