376 search results - page 3 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
AICCSA
2008
IEEE
13 years 5 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...
ADMA
2008
Springer
13 years 12 months ago
2008
Springer
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
RCIS
2010
13 years 4 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...