Sciweavers

222 search results - page 16 / 45
» Learning Optimal Parameters in Decision-Theoretic Rough Sets
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 14 days ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICCS
2007
Springer
14 years 14 days ago
Adaptive Sparse Grid Classification Using Grid Environments
Common techniques tackling the task of classification in data mining employ ansatz functions associated to training data points to fit the data as well as possible. Instead, the fe...
Dirk Pflüger, Ioan Lucian Muntean, Hans-Joach...
SIGECOM
2006
ACM
107views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Empirical mechanism design: methods, with application to a supply-chain scenario
Our proposed methods employ learning and search techniques to estimate outcome features of interest as a function of mechanism parameter settings. We illustrate our approach with ...
Yevgeniy Vorobeychik, Christopher Kiekintveld, Mic...
ICML
2005
IEEE
14 years 9 months ago
Optimizing abstaining classifiers using ROC analysis
Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are ofte...
Tadeusz Pietraszek
EUROGP
1999
Springer
151views Optimization» more  EUROGP 1999»
14 years 26 days ago
Phenotype Plasticity in Genetic Programming: A Comparison of Darwinian and Lamarckian Inheritance Schemes
Abstract We consider a form of phenotype plasticity in Genetic Programming (GP). This takes the form of a set of real-valued numerical parameters associated with each individual, a...
Anna Esparcia-Alcázar, Ken Sharman