Reading Time: 4 minutes In our previous blog, MachineX: Understanding FP-Tree construction, we discussed the FP-Tree and its construction. In this blog, we will be discussing the FP-Growth algorithm, which uses FP-Tree to extract frequent itemsets in the given dataset. FP-growth is an algorithm that generates frequent itemsets from an FP-tree by exploring the tree in a bottom-up fashion. We will be picking up the example we used in Continue Reading
Reading Time: 4 minutes In machine learning, Naive Bayes classifiers are a family of simple “probabilistic classifiers “based on applying Bayes’ theorem with strong (naive) independence assumptions between the features. The Naive Bayes Classifier technique is based on the so-called Bayesian theorem and is particularly suited when the dimensionality of the inputs is high. Despite its simplicity, Naive Bayes can often outperform more sophisticated classification methods. In simple terms, a Naive Bayes classifier assumes that Continue Reading
Reading Time: 4 minutes Hi all, In today’s blog, I will be getting you acquainted with the Blockchain, its definition, inception and everything you need to know as a novice developer or user. A many of us have lately been getting very familiar with the term Bitcoin and have started to visualise it correctly as a digital currency. So getting into a bit more detail, the technology behind it Continue Reading
Reading Time: < 1 minute This Knolx session we went about discussing data structures. I talked about simple data structures like Queue and Binary Search Tree and their possible implementation in Scala. The idea was to know about a bit of Functional data structures and their implementation in Scala. I then discussed Binary Search Trees and their traversals. Here is the presentation.