97 search results - page 7 / 20 » Frequent free tree discovery in graph data |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
JIIS
2010
13 years 2 months ago
2010
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
KDD
2006
ACM
14 years 7 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...
ACMSE
2009
ACM
14 years 2 months ago
2009
ACM
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...