Skip to main content

Posts

UNIT-3(Gaussian Mixture Model)-MACHINE LEARNING

  Drawbacks of k-means Clustering you will notice that all the clusters created are circular. This is because the centroids of the clusters are updated iteratively using the mean value. Now, consider the following example where the distribution of points is  not  circular. What do you think will happen if we use k-means clustering on this data? It would still attempt to group the data points circularly. That’s not great! k-means fails to identify the right clusters: Hence, we need a different way to assign clusters to the data points.  So instead of using a distance-based model, we will now use a distribution-based model.  And that is where Gaussian Mixture Models come into this article! Introduction to Gaussian Mixture Models (GMMs) The Gaussian Mixture Model (GMM) is a probabilistic model used for clustering and density estimation. It assumes that the data is generated from a mixture of several Gaussian components, each representing a distinct clus...
Recent posts

QUESTION BANK UNIT 2 - MACHINE LEARNING

  MODULE 2 – DECISION TREE LEARNING     1.      What is decision tree and decision tree learning? 2.      Explain representation of decision tree with example. 3.      What are appropriate problems for Decision tree learning? 4.      Explain the concepts of Entropy and Information gain. 5.      Describe the ID3 algorithm for decision tree learning with example 6.      Give Decision trees to represent the Boolean Functions: a) A && ~ B b)      A V [B && C] c)      A XOR B d)      [A&&B] V [C&&D] 7.      Give Decision trees for the following set of training examples   Day Outlook Temperature Humidity ...