74 search results - page 11 / 15 » The complexity of mining maximal frequent itemsets and maxim... |
ROCAI
2004
Springer
14 years 1 months ago
2004
Springer
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
It has been well recognized that data mining is an interactive and iterative process. In order to support this process, one of the long-term goals of data mining research has been...
SPAA
1997
ACM
14 years 1 days ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...