Sciweavers

46 search results - page 1 / 10
» Efficiently Supporting Multiple Similarity Queries for Minin...
Sort
View
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
13 years 10 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 5 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
13 years 10 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
DEXA
2009
Springer
222views Database» more  DEXA 2009»
13 years 11 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos