Sciweavers

263 search results - page 26 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
CORR
2012
Springer
250views Education» more  CORR 2012»
13 years 5 months ago
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki
IFIP12
2007
14 years 11 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
15 years 3 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
15 years 3 months ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 3 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders