2004
DOI: 10.1016/j.eswa.2003.10.008
|View full text |Cite
|
Sign up to set email alerts
|

Feature-based recommendations for one-to-one marketing

Abstract: Most recommendation systems face challenges from products that change with time, such as popular or seasonal products, since traditional market basket analysis or collaborative filtering analysis are unable to recommend new products to customers due to the fact that the products are not yet purchased by customers. Although the recommendation systems can find customer groups that have similar interests as target customers, brand new products often lack ratings and comments. Similarly, products that are less oft… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
34
0
2

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 93 publications
(37 citation statements)
references
References 12 publications
1
34
0
2
Order By: Relevance
“…Many statistical and data-mining methods for dimension reduction have been assessed for transaction data analysis: traditional latent class analysis [13], correspondence analysis [14], self-organization maps [38] and joint segmentation [29]. The benefits of such methods are that they can treat a large set of customer and product data to seek hidden patterns in reduced-dimensional space.…”
Section: Dimension Reduction Methodsmentioning
confidence: 99%
“…Many statistical and data-mining methods for dimension reduction have been assessed for transaction data analysis: traditional latent class analysis [13], correspondence analysis [14], self-organization maps [38] and joint segmentation [29]. The benefits of such methods are that they can treat a large set of customer and product data to seek hidden patterns in reduced-dimensional space.…”
Section: Dimension Reduction Methodsmentioning
confidence: 99%
“…The K-Apriori algorithm extracts a set of frequent item sets from the data, and then pulls out the rules with the highest information content for different groups of customers by dividing the customers in different cluster. K-Apriori [7] is based on the Apriori property and the Association rule generation procedure of the Apriori algorithm. Initially, the binary data is transformed into real domain using linear Wiener transformation.…”
Section: ©Ijraset (Ugc Approved Journal): All Rights Are Reservedmentioning
confidence: 99%
“…Association rules derived depends on confidence. Frequent item set generation is done using data mining algorithms like Apriori [4], FP-Growth Algorithm [5], Eclat [6] and K-Apriori [7]. Apriori algorithm for frequent item set mining is given below.…”
Section: Market Basket Analysis Using Fast Algorithmsmentioning
confidence: 99%
“…Recommender systems have recently become popular among many well-known e-businesses such as Amazon.com, CDNow.com, Barnes&Noble.com, and MovieFinder.com. There are different versions of recommender systems based on how it is generated such as content-based filtering (CBF) (Cheung et al, 2003;Weng & Liu, 2004;Cho & Kim, 2004;Hung, 2005;Adomavi-cius & Tuzhilin, 2005;Leung et al, 2006;Shih & Liu, 2008), collaborative filtering (CF) (Karypis, 2001;Sarwar et al, 2001;Cheung et al, 2003;Weng & Liu, 2004;Cho & Kim, 2004;Liua et al, 2005;Adomavicius & Tuzhilin, 2005;Boucher-Ryan & Bridge, 2006;Leung et al, 2006;Shih & Liu, 2008) and hybrid approaches (Burke, 2002;Cho & Kim, 2004;Semeraro et al, 2005;Adomavicius & Tuzhilin, 2005;Choi et al, 2006;Kim et al, 2006;Shih & Liu, 2008;Albadvi and Shahbazi, 2009). The rest of this study is organized as follows.…”
Section: Introductionmentioning
confidence: 99%