DocumentCode
2869704
Title
Frequent Itemsets Discovery Algorithm and Its Application Based on Frequent Matrix
Author
Fan, Lilin
Author_Institution
Coll. of Comput. & Inf. Technol., Henan Normal Univ., Xinxiang, China
fYear
2009
fDate
11-13 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
There are varieties of linkages among the properties of the data in a large database, These linkages are hidden in the data of the database, the purpose of association mining is to identify these hidden association rules. The discovery of association rules is based on frequent itemsets, so how could we make frequent itemsets fast and accurate is the main research of association data mining. In this paper, a matrix-based frequent discovery algorithm is raised according to the problems in the existing algorithms in finding frequent itemsets, and it has a practical application in the automobile fault parts association analysis system of automotive industry chain business intelligence platform..
Keywords
data mining; matrix algebra; association mining; frequent itemsets discovery algorithm; frequent matrix; hidden association rule identification; matrix-based frequent discovery algorithm; Application software; Association rules; Automobiles; Automotive engineering; Couplings; Data mining; Itemsets; Symmetric matrices; Transaction databases; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4507-3
Electronic_ISBN
978-1-4244-4507-3
Type
conf
DOI
10.1109/CISE.2009.5366560
Filename
5366560
Link To Document