Sciweavers

12863 search results - page 948 / 2573
» Dynamic Data Mining
Sort
View
198
Voted
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
16 years 1 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li
ICDM
2005
IEEE
128views Data Mining» more  ICDM 2005»
16 years 1 months ago
An Expected Utility Approach to Active Feature-Value Acquisition
In many classification tasks training data have missing feature values that can be acquired at a cost. For building accurate predictive models, acquiring all missing values is of...
Prem Melville, Foster J. Provost, Raymond J. Moone...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
16 years 1 months ago
A Bernoulli Relational Model for Nonlinear Embedding
The notion of relations is extremely important in mathematics. In this paper, we use relations to describe the embedding problem and propose a novel stochastic relational model fo...
Gang Wang, Hui Zhang, Zhihua Zhang, Frederick H. L...
187
Voted
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
16 years 1 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
PAKDD
2005
ACM
120views Data Mining» more  PAKDD 2005»
16 years 1 months ago
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
Mirco Nanni