Sciweavers

352 search results - page 35 / 71
» Non-derivable itemset mining
Sort
View
DAWAK
2006
Springer
13 years 11 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...
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
14 years 2 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
14 years 4 months ago
Grammar Mining.
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
Luc De Raedt, Siegfried Nijssen
PKDD
2005
Springer
105views Data Mining» more  PKDD 2005»
14 years 1 months ago
Protein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
Pedro Gabriel Ferreira, Paulo J. Azevedo
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 9 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester