Sciweavers

1390 search results - page 157 / 278
» Self-Sizing of Clustered Databases
Sort
View
VLDB
1998
ACM
105views Database» more  VLDB 1998»
14 years 1 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
ISMIS
1997
Springer
14 years 1 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
14 years 1 months ago
Needs-based analysis of online customer reviews
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
Thomas Y. Lee
AUSDM
2007
Springer
102views Data Mining» more  AUSDM 2007»
14 years 1 months ago
A Two-Step Classification Approach to Unsupervised Record Linkage
Linking or matching databases is becoming increasingly important in many data mining projects, as linked data can contain information that is not available otherwise, or that woul...
Peter Christen
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...