376 search results - page 18 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
PKDD
2010
Springer
13 years 6 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...
SDM
2004
SIAM
13 years 9 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Zonal co-location patterns represent subsets of featuretypes that are frequently located in a subset of space (i.e., zone). Discovering zonal spatial co-location patterns is an im...
DAWAK
2005
Springer
14 years 2 months ago
2005
Springer
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...