Spectral Content Ranking Method Based on Heterogeneous Hypergraph Models
Received: 09 Nov 2026 Revised: 10 Nov 2026 Accepted: 11 Nov 2026
Published: 2026, vol. 30, issue 4, pp. 312–315
Abstract
A content ranking method based on heterogeneous hypergraph models is proposed. A 5-partite hypergraph is constructed on music listening data. Latent behavioral clusters, serving as proxy representations of genre and mood characteristics, are extracted from the interaction matrix using SVD and the \(k\)-means method. Ranking is performed by a generalized spectral operator. In experiments on the Yambda-50M dataset, an NDCG@10 value of 0.469 is achieved, outperforming PureSVD by 7.1 % and ItemKNN by 23.6 %.
Keywords: hypergraph, recommender systems, spectral methods, music recommendation, Yambda.
BibTeX
@article{IS-Reshetarov-Khvorostukhina2026,
author = {Reshetarov, Platon Aleksandrovich and Khvorostukhina, Ekaterina Vladimirovna},
title = {{Spectral Content Ranking Method Based on Heterogeneous Hypergraph Models}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {312--315},
}
AMSBIB
\Bibitem{IS-Reshetarov-Khvorostukhina2026}
\by P.\,A.~Reshetarov, E.\,V.~Khvorostukhina
\paper Spectral Content Ranking Method Based on Heterogeneous Hypergraph Models
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 312--315
RU