Sciweavers

1768 search results - page 118 / 354
» Mining Very Large Databases
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 3 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
191
Voted
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
16 years 3 months ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme
112
Voted
ACL
2004
15 years 4 months ago
Error Mining for Wide-Coverage Grammar Engineering
Parsing systems which rely on hand-coded linguistic descriptions can only perform adequately in as far as these descriptions are correct and complete. The paper describes an error...
Gertjan van Noord
VLDB
2002
ACM
264views Database» more  VLDB 2002»
15 years 2 months ago
Viator - A Tool Family for Graphical Networking and Data View Creation
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
Stephan Heymann, Katja Tham, Axel Kilian, Gunnar W...
PKDD
2000
Springer
120views Data Mining» more  PKDD 2000»
15 years 6 months ago
Multi-Relational Data Mining, Using UML for ILP
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
Arno J. Knobbe, Arno Siebes, Hendrik Blockeel, Dan...