616 search results - page 105 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
KDID
2003
13 years 8 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
WWW
2009
ACM
14 years 5 days ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
TSP
2008
13 years 7 months ago
2008
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...