Sciweavers

98 search results - page 17 / 20
» Optimizing Ada on the fly
Sort
View
DAWAK
2006
Springer
15 years 1 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
70
Voted
AAAI
2006
14 years 11 months ago
Boosting Expert Ensembles for Rapid Concept Recall
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
PR
2006
108views more  PR 2006»
14 years 9 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
JMLR
2010
107views more  JMLR 2010»
14 years 4 months ago
Learning Instance-Specific Predictive Models
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
Shyam Visweswaran, Gregory F. Cooper
99
Voted
ML
2002
ACM
167views Machine Learning» more  ML 2002»
14 years 9 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...