Sciweavers

101 search results - page 5 / 21
» Set-Oriented Indexes for Data Mining Queries
Sort
View
SISAP
2008
IEEE
130views Data Mining» more  SISAP 2008»
15 years 8 months ago
The Many Facets of Approximate Similarity Search
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Marco Patella, Paolo Ciaccia
138
Voted
TODS
2002
92views more  TODS 2002»
15 years 1 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 3 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
143
Voted
ICDIM
2010
IEEE
14 years 12 months ago
Data mining and automatic OLAP schema generation
Data mining aims at extraction of previously unidentified information from large databases. It can be viewed as an automated application of algorithms to discover hidden patterns a...
Muhammad Usman, Sohail Asghar, Simon Fong
175
Voted
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 5 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann