Paper Title:
Improvement of Apriori Algorithm Based on the User Interest and the Importance of Itemsets
  Abstract

Among the many mining algorithms of association rules, Apriori Algorithm is a classical algorithm that has caused the most discussion; it can effectively carry out the mining association rules. However, based on Apriori Algorithm, most of the traditional algorithms existed "item sets generation bottleneck" problem, and are very time-consuming. An enhance algorithm associating which is based on the user interest and the importance of itemsets is put forward by the paper, incorporate item that user is interested in into the itemsets as a seed item, then scan the database, incorporate all other items which are in the same transaction into itemsets, Construct user interest itemsets, reduce unnecessary itemsets; through the design of the support functions algorithm not only considered the frequency of itemsets, but also consider different importance between different itemsets. The new algorithm reduces the storage space, improves the efficiency and accuracy of the algorithm.

  Info
Periodical
Advanced Materials Research (Volumes 121-122)
Edited by
Donald C. Wunsch II, Honghua Tan, Dehuai Zeng, Qi Luo
Pages
540-545
DOI
10.4028/www.scientific.net/AMR.121-122.540
Citation
Y. S. He, X. Li, "Improvement of Apriori Algorithm Based on the User Interest and the Importance of Itemsets", Advanced Materials Research, Vols. 121-122, pp. 540-545, 2010
Online since
June 2010
Export
Price
$35.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765