Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Scala for Machine Learning, Second Edition
  • Toc
  • feedback
Scala for Machine Learning, Second Edition

Scala for Machine Learning, Second Edition

By : R. Nicolas
4.5 (2)
close
Scala for Machine Learning, Second Edition

Scala for Machine Learning, Second Edition

4.5 (2)
By: R. Nicolas

Overview of this book

The discovery of information through data clustering and classification is becoming a key differentiator for competitive organizations. Machine learning applications are everywhere, from self-driving cars, engineering design, logistics, manufacturing, and trading strategies, to detection of genetic anomalies. The book is your one stop guide that introduces you to the functional capabilities of the Scala programming language that are critical to the creation of machine learning algorithms such as dependency injection and implicits. You start by learning data preprocessing and filtering techniques. Following this, you'll move on to unsupervised learning techniques such as clustering and dimension reduction, followed by probabilistic graphical models such as Naïve Bayes, hidden Markov models and Monte Carlo inference. Further, it covers the discriminative algorithms such as linear, logistic regression with regularization, kernelization, support vector machines, neural networks, and deep learning. You’ll move on to evolutionary computing, multibandit algorithms, and reinforcement learning. Finally, the book includes a comprehensive overview of parallel computing in Scala and Akka followed by a description of Apache Spark and its ML library. With updated codes based on the latest version of Scala and comprehensive examples, this book will ensure that you have more than just a solid fundamental knowledge in machine learning with Scala.
Table of Contents (21 chapters)
close
20
Index

Performance considerations

As with most discriminative models, the performance of the support vector machine obviously depends on the optimizer selected to maximize the margin during training. Let's look at the time complexity for different configuration and applications of SVM:

  • A linear model (SVM without kernel) has an asymptotic time complexity O(N) for training N labeled observations
  • Nonlinear models with quadratic kernel methods (formulated as a quadratic programming problem) have an asymptotic time complexity of O(N3)
  • An algorithm that uses sequential minimal optimization techniques, such as index caching or elimination of null values (as in LIBSVM), has an asymptotic time complexity of O(N2) with the worst-case scenario (quadratic optimization) of O(N3)
  • Sparse problems for very large training sets (N > 10,000) also have an asymptotic time of O(N2):
    Performance considerations

    Graph asymptotic time complexity for various SVM implementations

The time and space complexity of the kernelized support vector machine...

bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete