Sciweavers

680 search results - page 36 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
AUSAI
2001
Springer
15 years 1 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
14 years 10 months ago
Optinformatics for schema analysis of binary genetic algorithms
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
Minh Nghia Le, Yew-Soon Ong, Quang Huy Nguyen 0001
DATAMINE
2008
89views more  DATAMINE 2008»
14 years 9 months ago
Mining conjunctive sequential patterns
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
Chedy Raïssi, Toon Calders, Pascal Poncelet
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 8 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...