62 search results - page 4 / 13 » Querying multiple sets of discovered rules |
KDD
1995
ACM
13 years 9 months ago
1995
ACM
We introduce an active data mining paradigm that combines the recent work in data mining with the rich literature on active database systems. In this paradigm, data is continuousl...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
LRE
2006
13 years 5 months ago
2006
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
SIGMOD
2004
ACM
14 years 5 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...