Journal
2012 11TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS TO BUSINESS, ENGINEERING & SCIENCE (DCABES)
Volume -, Issue -, Pages 227-231Publisher
IEEE COMPUTER SOC
DOI: 10.1109/DCABES.2012.51
Keywords
electronic commerce; association rule; apriori algorithm; frequent itemset
Ask authors/readers for more resources
In order to analyze the shopping habits of consumers and more accurately mine the characteristics of consumption, we hereby have proposed and proved Theorem 1-3 to improve the classical Apriori algorithm, resulting in the reduction of database access. We improved the efficiency in the frequent-itemsets-based establishment of strong association rule. With this new design we fulfilled the timely recommendation of related products to customers, reflecting the principle of personalized service in e-shopping.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available