276 search results - page 17 / 56 » Frequent Submap Discovery |
FLAIRS
2003
13 years 11 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
DAWAK
2007
Springer
14 years 3 months ago
2007
Springer
Many studies of spatiotemporal pattern discovery partition data space into disjoint cells for effective processing. However, the discovery accuracy of the space-partitioning schem...
KDD
1997
ACM
14 years 1 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
ICDE
2007
IEEE
14 years 4 months ago
2007
IEEE
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
Word meaning disambiguation has always been an important problem in many computer science tasks, such as information retrieval and extraction. One of the problems, faced in automa...