Sciweavers

1497 search results - page 148 / 300
» Online Negative Databases
Sort
View
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 5 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
16 years 5 months ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson
VLDB
2007
ACM
159views Database» more  VLDB 2007»
16 years 4 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
227
Voted
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 4 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan