136 search results - page 5 / 28 » CloseGraph: mining closed frequent graph patterns |
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
IEAAIE
2009
Springer
14 years 2 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
ICDM
2009
IEEE
14 years 2 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...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...