2016 8th International Conference on Information Technology in Medicine and Education (ITME) 2016
DOI: 10.1109/itme.2016.0139
|View full text |Cite
|
Sign up to set email alerts
|

Maximum Gaussian Mixture Model for Classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…In fact, there are more than 100 clustering algorithms known. But few of the algorithms are used popularly, such as Agglomerative Clustering, DBSCAN, K-Means, OPTICS, Spectral Clustering, and Mixture of Gaussians [53]. The psuedo-code for the community detection included in Algorithm 1 illustrates the clustering process with K-means.…”
Section: Graph Neural Network For Community Detectionmentioning
confidence: 99%
“…In fact, there are more than 100 clustering algorithms known. But few of the algorithms are used popularly, such as Agglomerative Clustering, DBSCAN, K-Means, OPTICS, Spectral Clustering, and Mixture of Gaussians [53]. The psuedo-code for the community detection included in Algorithm 1 illustrates the clustering process with K-means.…”
Section: Graph Neural Network For Community Detectionmentioning
confidence: 99%
“…There are several possible machine learning approaches for clustering. The most known ones are Affinity Propagation, Agglomerative Clustering, DBSCAN, K-Means, OPTICS, Spectral Clustering, and Mixture of Gaussians [56]. As shown in Fig.…”
Section: Phase Iii: Clusteringmentioning
confidence: 99%
“…It is known as soft clustering technique which is used to compute the probability of different types of clustered data. The implementation of this algorithm is based on expectation maximization [51].…”
Section: K Gaussian Mixture Algorithmmentioning
confidence: 99%