12863 search results - page 512 / 2573 » Dynamic Data Mining |
184
click to vote
DIS
2007
Springer
15 years 11 months ago
2007
Springer
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
186
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
170
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
154
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
205
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...