Search icon CANCEL
Subscription
0
Cart icon
Cart
Close icon
You have no products in your basket yet
Save more on your purchases!
Savings automatically calculated. No voucher code required
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Scala for Machine Learning, Second Edition - Second Edition

You're reading from  Scala for Machine Learning, Second Edition - Second Edition

Product type Book
Published in Sep 2017
Publisher Packt
ISBN-13 9781787122383
Pages 740 pages
Edition 2nd Edition
Languages
Toc

Table of Contents (27) Chapters close

Scala for Machine Learning Second Edition
Credits
About the Author
About the Reviewers
www.PacktPub.com
Customer Feedback
Preface
1. Getting Started 2. Data Pipelines 3. Data Preprocessing 4. Unsupervised Learning 5. Dimension Reduction 6. Naïve Bayes Classifiers 7. Sequential Data Models 8. Monte Carlo Inference 9. Regression and Regularization 10. Multilayer Perceptron 11. Deep Learning 12. Kernel Models and SVM 13. Evolutionary Computing 14. Multiarmed Bandits 15. Reinforcement Learning 16. Parallelism in Scala and Akka 17. Apache Spark MLlib Basic Concepts References Index

Multivariate Bernoulli classification


So far, our investigation of the Naïve Bayes has focused on features that are essentially binary {UP=1, DOWN=0}. The mean value is computed as the ratio of the number of observations for which xi = UP over the total number of observations.

As stated in the first section, the Gaussian distribution is more appropriate for either continuous features or binary features in the case of very large labeled datasets. The example is the perfect candidate for the Bernoulli model.

Model

The Bernoulli model differs from the Naïve Bayes classifier in that it penalizes the features x, which does not have any observation; the Naïve Bayes classifier ignores them [5:10].

Note

The Bernoulli mixture model

M8: For a feature function fk with fk = 1 if the feature is observed, 0 otherwise, and the probability p of the observed feature xk belongs to the class Cj, the posterior probability is computed as follows:

Implementation

The implementation of the Bernoulli model consists of...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €14.99/month. Cancel anytime