263 search results - page 22 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
119
click to vote
AICCSA
2008
IEEE
14 years 9 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
DBA
2006
14 years 11 months ago
2006
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...
EDBT
2009
ACM
15 years 4 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...