ScholarGate
सहायक

विधियों की तुलना करें

चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।

गाऊसी मिश्रण मॉडल×DBSCAN×पदानुक्रमिक समूहन×
क्षेत्रमशीन अधिगममशीन अधिगममशीन अधिगम
परिवारMachine learningMachine learningMachine learning
उद्भव वर्ष197719961963
प्रवर्तकDempster, Laird & Rubin (EM algorithm)Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Ward, J. H.
प्रकारProbabilistic (soft) clustering — mixture modelDensity-based clustering algorithmUnsupervised clustering (agglomerative)
मौलिक स्रोतDempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22. DOI ↗Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗
उपनामGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of GaussiansDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
संबंधित434
सारांशA Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.
ScholarGateडेटासेट
  1. v1
  2. 1 स्रोत
  3. PUBLISHED
  1. v1
  2. 1 स्रोत
  3. PUBLISHED
  1. v1
  2. 1 स्रोत
  3. PUBLISHED

खोज पर जाएँ स्लाइड डाउनलोड करें

ScholarGateविधियों की तुलना करें: Gaussian Mixture Model · DBSCAN · Hierarchical Clustering. 2026-06-19 को यहाँ से प्राप्त https://scholargate.app/hi/compare