46 search results - page 6 / 10 » Efficiently Supporting Multiple Similarity Queries for Minin... |
KDD
2005
ACM
14 years 7 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...
ADBIS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attribut...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
BMCBI
2006
13 years 6 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
SIGMOD
2002
ACM
14 years 6 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...