RecTree: An Efficient Collaborative Filtering Method
Lecture notes in computer sciencePublished 1 January 2001
Sonny H. Chee, Jiawei Han, Ke Wang
Citations158
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An efficient collaborative filtering method, called RecTree (which stands for RECommendation Tree), that addresses the scalability problem with a divide-and-conquer approach and outperforms the well-known collaborative filter, CorrCF, in both execution time and accuracy.
Abstract
Many people rely on the recommendations of trusted friends to find restaurants or movies, which match their tastes. But, what if your friends have not sampled the item of interest? Collaborative filtering (CF) seeks to increase the effectiveness of this process by automating the derivation of a recommendation, often from a clique of advisors that we have no prior personal relationship with. CF is a promising tool for dealing with the information overload that we face in the networked world.
Keywords
Computer ScienceSocial Sciences
arXiv (Cornell University)Empirical Analysis of Predictive Algorithms for Collaborative Filtering
4,515 Citations2013John S. Breese, David Heckerman +1 more
BIRCH
3,906 Citations1996Tian Zhang, Raghu Ramakrishnan +1 more
A data clustering method named BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies) is presented, and it is demonstrated that it is especially suitable for very large databases.
Social information filtering
2,800 Citations1995Upendra Shardanand, Pattie Maes
The implementation of a networked system called Ringo, which makes personalized recommendations for music albums and artists, and four different algorithms for making recommendations by using social information filtering were tested and compared.
ACM SIGIR ForumAn Algorithmic Framework for Performing Collaborative Filtering
2,552 Citations2017Jonathan L. Herlocker, Joseph A. Konstan +2 more
Automatic subspace clustering of high dimensional data for data mining applications
2,386 Citations1998Rakesh Agrawal, Johannes Gehrke +2 more
CLIQUE is presented, a clustering algorithm that satisfies each of these requirements of data mining applications including the ability to find clusters embedded in subspaces of high dimensional data, scalability, end-user comprehensibility of the results, non-presumption of any canonical data distribution, and insensitivity to the order of input records.
An algorithmic framework for performing collaborative filtering
1,973 Citations1999Jonathan L. Herlocker, Joseph A. Konstan +2 more
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage.
CURE
1,909 Citations1998Sudipto Guha, Rajeev Rastogi +1 more
This work proposes a new clustering algorithm called CURE that is more robust to outliers, and identifies clusters having non-spherical shapes and wide variances in size, and demonstrates that random sampling and partitioning enable CURE to not only outperform existing algorithms but also to scale well for large databases without sacrificing clustering quality.
Recommender systems in e-commerce
1,693 Citations1999J. Ben Schafer, Joseph A. Konstan +1 more
An explanation of howRecommender systems help E-commerce sites increase sales, and a taxonomy of recommender systems, including the interfaces they present to customers, the technologies used to create the recommendations, and the inputs they need from customers.
Information RetrievalEigentaste: A Constant Time Collaborative Filtering Algorithm
1,434 Citations2001Ken Goldberg, Theresa Roeder +2 more
This work compares Eigentaste to alternative algorithms using data from Jester, an online joke recommending system, and uses the Normalized Mean Absolute Error (NMAE) measure to compare performance of different algorithms.
ACM SIGMOD RecordFast algorithms for projected clustering
903 Citations1999Charų C. Aggarwal, Joel L. Wolf +3 more
Combining collaborative filtering with personal agents for better recommendations
679 Citations1999Nathaniel Good, J. Ben Schafer +5 more
This paper shows that a CF framework can be used to combine personal IF agents and the opinions of a community of users to produce better recommendations than either agents or users can produce alone.
Fast algorithms for projected clustering
482 Citations1999Charų C. Aggarwal, Joel L. Wolf +3 more
An algorithmic framework for solving the projected clustering problem, in which the subsets of dimensions selected are specific to the clusters themselves, is developed and tested.
Using filtering agents to improve prediction quality in the GroupLens research collaborative filtering system
397 Citations1998Badrul Sarwar, Joseph A. Konstan +4 more
The filterbot model allows collaborative filtering systems to address sparsity by tapping the strength of content filtering techniques and is experimentally validated by showing that even simple filterbots such as spell checking can increase the utility for users of sparsely populated collaborative filtering system.
Solid State CommunicationsEvidence for a background neutron enhanced fusion in deuterium absorbed palladium
17 Citations1989G. Shani, C. M. S. Cohen +2 more