Fast Recommendations With the M-Distance
Memory-based recommender systems with m users and n items typically require O(mn) space to store the rating information. In item-based collaborative filtering (CF) algorithms, the feature vector of each item has length m,and it takes O(m) time to compute the similarity between two items using the Pe...
Main Authors: | Mei Zheng, Fan Min, Heng-Ru Zhang, Wen-Bin Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2016-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7452337/ |
Similar Items
-
Utilizing an Autoencoder-Generated Item Representation in Hybrid Recommendation System
by: Tan Nghia Duong, et al.
Published: (2020-01-01) -
Hybrid Recommendation Model of Knowledge Graph and Graph Convolutional Network
by: GUO Xiaowang, XIA Hongbin, LIU Yuan
Published: (2022-06-01) -
A Social Recommender Based on Factorization and Distance Metric Learning
by: Junliang Yu, et al.
Published: (2017-01-01) -
Distance-Locally Disconnected Graphs
by: Miller Mirka, et al.
Published: (2013-03-01) -
Evolutionary Approach for Building, Exploring and Recommending Complex Items With Application in Nutritional Interventions
by: Bartolome Ortiz-Viso, et al.
Published: (2023-01-01)