Sciweavers

536 search results - page 24 / 108
» The Optimality of Naive Bayes
Sort
View
GECCO
2004
Springer
144views Optimization» more  GECCO 2004»
14 years 1 months ago
Feature Subset Selection, Class Separability, and Genetic Algorithms
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
Erick Cantú-Paz
IPMU
2010
Springer
13 years 5 months ago
Restricting the IDM for Classification
Abstract. The naive credal classifier (NCC) extends naive Bayes classifier (NBC) to imprecise probabilities to robustly deal with the specification of the prior; NCC models a state...
Giorgio Corani, Alessio Benavoli
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
14 years 1 months ago
Improving MACS Thanks to a Comparison with 2TBNs
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
Olivier Sigaud, Thierry Gourdin, Pierre-Henri Wuil...
JMLR
2010
154views more  JMLR 2010»
13 years 2 months ago
MOA: Massive Online Analysis
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA includes a collecti...
Albert Bifet, Geoff Holmes, Richard Kirkby, Bernha...
CORR
2007
Springer
101views Education» more  CORR 2007»
13 years 7 months ago
On The Limitations of The Naive Lattice Decoding
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
Mahmoud Taherzadeh, Amir K. Khandani