Sciweavers

700 search results - page 115 / 140
» Clustering XML Documents by Structure
Sort
View
77
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 14 days ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 27 days ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
15 years 2 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
96
Voted
FLAIRS
2007
15 years 3 months ago
Contextual Concept Discovery Algorithm
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...
Lobna Karoui, Marie-Aude Aufaure, Nacéra Be...
114
Voted
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 14 days ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola