Connectedness of users-items networks and recommender systems
From MaRDI portal
Publication:279972
DOI10.1016/j.amc.2014.06.024zbMath1335.94114OpenAlexW2052591921WikidataQ107438126 ScholiaQ107438126MaRDI QIDQ279972
Mahdi Jalili, Joobin Gharibshah
Publication date: 29 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Embedded in the Shadow of the Separator
- Efficient rewirings for enhancing synchronizability of dynamical networks
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
This page was built for publication: Connectedness of users-items networks and recommender systems