Sciweavers

30 search results - page 3 / 6
» Finding Maximal Fully-Correlated Itemsets in Large Databases
Sort
View
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 8 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
DAWAK
2006
Springer
13 years 10 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 6 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
APIN
2006
168views more  APIN 2006»
13 years 6 months ago
Utilizing Genetic Algorithms to Optimize Membership Functions for Fuzzy Weighted Association Rules Mining
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
Mehmet Kaya, Reda Alhajj
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
13 years 10 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li