DocumentCode :
3059159
Title :
An Efficient Constraint-Based Closed Set Mining Algorithm
Author :
Bian, Haiyun ; Bhatnagar, Raj ; Young, Barrington
Author_Institution :
Wright State Univ., Dayton
fYear :
2007
fDate :
13-15 Dec. 2007
Firstpage :
67
Lastpage :
72
Abstract :
We present a search algorithm for mining closed sets in high dimensional binary datasets. Our algorithm is designed for dense datasets, where the percentage of 1´s in the dataset is usually higher than 10%, and the total number of closed sets is much larger than the number of objects in the dataset. Our algorithm is memory efficient since, unlike many other closed set mining algorithms, it does not require all patterns mined so far to be kept in the memory. Optimization techniques are introduced in this paper, and we also present a parallel version of our algorithm.
Keywords :
data mining; optimisation; search problems; binary datasets; constraint-based closed set mining algorithm; optimization techniques; search algorithm; Algorithm design and analysis; Association rules; Clustering algorithms; Concurrent computing; Data mining; Frequency; Itemsets; Machine learning; Machine learning algorithms; Subspace constraints;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Applications, 2007. ICMLA 2007. Sixth International Conference on
Conference_Location :
Cincinnati, OH
Print_ISBN :
978-0-7695-3069-7
Type :
conf
DOI :
10.1109/ICMLA.2007.31
Filename :
4457210
Link To Document :
بازگشت