2382 search results - page 203 / 477 » Generating Seeded Trees from Data Sets |
196
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
161
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we propose a new approach to discover informative contents from a set of tabular documents (or Web pages) of a Web site. Our system, InfoDiscoverer, first partition...
172
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we introduce a novel objective function for the hierarchical clustering of data from distance matrices, a very relevant task in Bioinformatics. To test the robustnes...
228
click to vote
PKDD
2004
Springer
15 years 12 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
189
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
We present a technique that improves random test generation by incorporating feedback obtained from executing test inputs as they are created. Our technique builds inputs incremen...