Sciweavers

3241 search results - page 324 / 649
» Searching for Hidden-Web Databases
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 6 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
GIS
2005
ACM
16 years 6 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 5 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
SIGMOD
2008
ACM
109views Database» more  SIGMOD 2008»
16 years 5 months ago
Extreme visualization: squeezing a billion records into a million pixels
Database searches are usually performed with query languages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic qu...
Ben Shneiderman
SIGMOD
2005
ACM
212views Database» more  SIGMOD 2005»
16 years 5 months ago
A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...