Analysis of recommendation algorithms for e-commerce

@inproceedings{Sarwar2000AnalysisOR,
  title={Analysis of recommendation algorithms for e-commerce},
  author={Badrul Munir Sarwar and George Karypis and Joseph A. Konstan and John Riedl},
  booktitle={EC '00},
  year={2000}
}
ABSTRACT Re ommender systems apply statisti al and knowledge disovery te hniques to the problem of making produ t re ommendations during a live ustomer intera tion and they are a hieving widespread su ess in E-Commer e nowadays. In this paper, we investigate several te hniques for analyzing large-s ale pur hase and preferen e data for the purpose of produ ing useful re ommendations to ustomers. In parti ular, we apply a olle tion of algorithms su h as traditional data mining, nearest-neighbor… 
Data Mining for Web Personalization
TLDR
An overview of Web personalization process viewed as an application of data mining requiring support for all the phases of a typical data mining cycle, including data collection and pre-processing, pattern discovery and evaluation, and finally applying the discovered knowledge in real-time to mediate between the user and the Web.
3 Data Mining for Web Personalization
TLDR
An overview of Web personalization process viewed as an application of data mining requiring support for all the phases of a typical data mining cycle, including data collection and preprocessing, pattern discovery and evaluation, and finally applying the discovered knowledge in real-time to mediate between the user and the Web.
A Fuzzy Relational Approach to Event Recommendation
TLDR
This paper develops a novel, hybrid CF-CB approach whose rationale is concisely summed up as "recom- mending future items if they are similar to past ones that similar users have liked", and which surpasses related work in the same spirit.
Collaborative Filtering via Concept Decomposition on the Netflix Dataset
TLDR
Experimental results are presented that show how the concept decomposition method performs on the movie rating prediction task over the Netflix dataset and it is shown that it is able to achieve a well bal anced performance between computational complexity and predict ion accuracy.
Big Data Recommendation Problems in e-Commerce Solutions for Small Business
TLDR
The main point of the article is the proposition of the simple in implementation recommendation algorithm and thereby achievable for small business and the online test was performed and its results presented as a good performance proof.
Towards a Scalable k NN CF Algorithm: Exploring Effective Applications of Clustering
TLDR
This work proposes CLUSTKNN, a simple and intuitive algorithm that is well suited for large data sets, and shows that it provides very good recommendation accuracy as well, by comparing with a number of other popular CF algorithms that, apart from being highly scalable and intuitive, provide very good recommendations accuracy.
Improvising Singular Value Decomposition by KNN for Use in Movie Recommender Systems
TLDR
A comparative study among several pre-processing algorithms on singular value decomposition finds that when the missing values were imputed using the mean of similar users and the distance measure was Euclidean, the KNN-based (K-Nearest Neighbour) approach of pre- processing the SVD was performing the best.
A HYBRID SYSTEM FOR PERSONALIZED CONTENT RECOMMENDATION
  • Bo Ye
  • Computer Science
  • 2019
TLDR
Overall, this study makes contributions to information systems (IS) and electronic commerce literature and practice and suggests that a hybrid solution as presented by the proposed system could better serve readers of academic journal to enhance service quality and user satisfaction.
Graph-based Analysis for E-Commerce Recommendation
TLDR
This research represents the early step towards a meta-level analysis framework for validating the fundamental assumptions made by different recommendation algorithms regarding the consumer-product interaction generation process and thus supporting systematic recommendation model/algorithm selection and evaluation.
Instance Selection Techniques for Memory-based Collaborative Filtering
TLDR
This work focuses on a typical user preference database that contains many missing values, and proposes four novel instance reduction techniques called TURF1-TURF4 as a preprocessing step to improve the efficiency and accuracy of the memory-based CF algorithm.
...
...

References

SHOWING 1-10 OF 40 REFERENCES
An E ective Hash-Based Algorithm for Mining Association RulesJong
TLDR
The issue of mining association rules among items in a large database of sales transactions is examined and an hash based algorithm is proposed for the candidate set generation that is in orders of magnitude smaller than that by previous methods thus resolving the performance bottleneck.
Application of Dimensionality Reduction in Recommender System - A Case Study
TLDR
This paper presents two different experiments where one technology called Singular Value Decomposition (SVD) is explored to reduce the dimensionality of recommender system databases and suggests that SVD has the potential to meet many of the challenges ofRecommender systems, under certain conditions.
GroupLens: applying collaborative filtering to Usenet news
TLDR
The combination of high volume and personal taste made Usenet news a promising candidate for collaborative filtering and the potential predictive utility for Usenets news was very high.
A Tree Projection Algorithm for Generation of Frequent Item Sets
TLDR
This paper provides an implementation of the tree projection method which is up to one order of magnitude faster than other recent techniques in the literature and has a well-structured data access pattern which provides data locality and reuse of data for multiple levels of the cache.
Learning Collaborative Information Filters
TLDR
This work proposes a representation for collaborative filtering tasks that allows the application of virtually any machine learning algorithm, and identifies the shortcomings of current collaborative filtering techniques and proposes the use of learning algorithms paired with feature extraction techniques that specifically address the limitations of previous approaches.
Mining business databases
TLDR
The goal here is to provide a brief overview of the key issues in knowledge discovery in an industrial context and outline representative applications.
An effective hash-based algorithm for mining association rules
TLDR
The number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck, and allows us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
TLDR
Several algorithms designed for collaborative filtering or recommender systems are described, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods, to compare the predictive accuracy of the various methods in a set of representative problem domains.
Recommender systems
TLDR
This special section includes descriptions of five recommender systems, which provide recommendations as inputs, which the system then aggregates and directs to appropriate recipients, and which combine evaluations with content analysis.
A re-examination of text categorization methods
TLDR
The results show that SVM, kNN and LLSF signi cantly outperform NNet and NB when the number of positive training instances per category are small, and that all the methods perform comparably when the categories are over 300 instances.
...
...