On the Optimality of the Simple Bayesian Classifier under Zero-One Loss

ISSN： 0885-6125

Source： Machine Learning, Vol.29, Iss.2-3, 1997-11, pp. : 103-130

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An improved zero-one law for algorithmically random sequences

By Kautz S.M.

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 185-192

Elsevier

Access to resources Recommend Favorite

A stronger Kolmogorov zero-one law for resource-bounded measure

By Dai J.J.

Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. : 723-732

Elsevier

Access to resources Recommend Favorite

Program schemes, arrays, Lindstrom quantifiers and zero-one laws

By Stewart

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 283-310

Elsevier

Access to resources Recommend Favorite

Bidimensional allocation of seats via zero-one matrices with given line sums

By Lari Isabella Ricca Federica Scozzari Andrea

Annals of Operations Research, Vol. 215, Iss. 1, 2014-04 ,pp. : 165-181

Springer Publishing Company

Access to resources Recommend Favorite

COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS

By Nishizaki Ichiro Sakawa Masatoshi

Cybernetics and Systems, Vol. 31, Iss. 2, 2000-03 ,pp. : 203-221

Taylor & Francis Ltd

Access to resources Recommend Favorite