680 search results - page 51 / 136 » Mining Frequent Itemsets Using Genetic Algorithm |
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
100
click to vote
JCP
2008
14 years 9 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
171
click to vote
ICDE
2006
IEEE
15 years 11 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...
CNSR
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We propose a novel representative based subgraph mining model. A series of standards and methods are proposed to select invariants. Patterns are mapped into invariant vectors in...