147 search results - page 1 / 30 » Constraint-Based Rule Mining in Large, Dense Databases |
ICDE
1999
IEEE
14 years 6 months ago
1999
IEEE
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...