91 search results - page 1 / 19 » A quickstart in frequent structure mining can make a differe... |
KDD
2004
ACM
14 years 5 months ago
2004
ACM
PKDD
2010
Springer
13 years 2 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...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
SIGMOD
2004
ACM
14 years 4 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...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper, we propose a novel data mining scheme to explore the frequent hierarchical structure patterns, named tree-like patterns, with the relationship of each item on a sequ...