Sciweavers

61 search results - page 10 / 13
» Mining Violations to Relax Relational Database Constraints
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 5 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
EDBT
2006
ACM
124views Database» more  EDBT 2006»
15 years 11 months ago
Physical Design Refinement: The "Merge-Reduce" Approach
Abstract. Physical database design tools rely on a DBA-provided workload to pick an "optimal" set of indexes and materialized views. Such an approach fails to capture sce...
Nicolas Bruno, Surajit Chaudhuri
ICASSP
2010
IEEE
14 years 12 months ago
HMM-based pseudo-clean speech synthesis for splice algorithm
In this paper, we present a novel approach to relax the constraint of stereo-data which is needed in a series of algorithms for noise-robust speech recognition. As a demonstration...
Jun Du, Yu Hu, Li-Rong Dai, Ren-Hua Wang
VLDB
2001
ACM
109views Database» more  VLDB 2001»
15 years 4 months ago
Mining Multi-Dimensional Constrained Gradients in Data Cubes
Constrained gradient analysis (similar to the “cubegrade” problem posed by Imielinski, et al. [9]) is to extract pairs of similar cell characteristics associated with big chan...
Guozhu Dong, Jiawei Han, Joyce M. W. Lam, Jian Pei...
SAC
2010
ACM
15 years 6 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil