Abstract

Neighbor-based collaborative filtering is one of the most practical recommendation approaches that is renowned because of its simplicity and explanation. However, the big limitation is its high computational complexity. It is demonstrated that clustering-based algorithms, that restrict the neighborhood space, speed up the recommendation process at the price of lower accuracy. We propose a new algorithm, called TasteMiner that efficiently learns partial users taste to restrict the neighborhood space. We frame TasteMiner as a method for neighborhood collaborative filtering, and show its effectiveness compared to previous algorithms

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call