A platform for research: civil engineering, architecture and urbanism
A fast collaborative filtering algorithm for implicit binary data
Item-based and user-based collaborative filtering are two well-known algorithms for recommender system in E-commerce. Both the algorithms make use of similarity matrix whose elements represent the similarity of each item pairs or user pairs. A fast algorithm for item-based similarity matrix computation using cosine similarity metric was reviewed and applied for user-based one with some modification. The results show that the fast algorithm can blend well with other similarity metrics, and it can greatly improve the computational performance.
A fast collaborative filtering algorithm for implicit binary data
Item-based and user-based collaborative filtering are two well-known algorithms for recommender system in E-commerce. Both the algorithms make use of similarity matrix whose elements represent the similarity of each item pairs or user pairs. A fast algorithm for item-based similarity matrix computation using cosine similarity metric was reviewed and applied for user-based one with some modification. The results show that the fast algorithm can blend well with other similarity metrics, and it can greatly improve the computational performance.
A fast collaborative filtering algorithm for implicit binary data
Manzhao Bu, (author) / Shijian Luo, (author) / Ji He, (author)
2009-11-01
109080 byte
Conference paper
Electronic Resource
English
Improved Attack-Resistant Collaborative Filtering Algorithm
British Library Online Contents | 2011
|Solution of a Groundwater Control Problem with Implicit Filtering
Online Contents | 2002
|Collaborative filtering‐based collapse fragility assessment
Wiley | 2023
|Solution of a Groundwater Control Problem with Implicit Filtering
British Library Conference Proceedings | 2002
|