KDD
2008
ACM
15 years 26 days ago
2008
ACM
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Traditionally, research in identifying structured entities in documents has proceeded independently of document categorization research. In this paper, we observe that these two t...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs ...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
KDD
2008
ACM
15 years 26 days ago
2008
ACM
KDD
2008
ACM
15 years 26 days ago
2008
ACM
KDD
2008
ACM
15 years 26 days ago
2008
ACM
Text classification has matured as a research discipline over the last decade. Independently, business intelligence over structured databases has long been a source of insights fo...
KDD
2008
ACM
15 years 26 days ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...