Evidence map›Paper›PMID 37372290›Full record

ArticleEntropy (Basel, Switzerland)2023

Combined Gaussian Mixture Model and Pathfinder Algorithm for Data Clustering.

Huajuan Huang, Zepeng Liao, Xiuxi Wei, Yongquan Zhou

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Huajuan HuangCollege of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.
Zepeng LiaoCollege of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.
Xiuxi WeiCollege of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.
Yongquan ZhouCollege of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.ORCID 0000-0003-4404-952X

Funding

Guangxi Natural Science Foundation 2018GXNSFAA294068Guangxi Natural Science Foundation 2021GXNSFAA220068National Natural Science Foundation of China 61662005National Natural Science Foundation of China 62266007
6 · The paper itself

Abstract

Data clustering is one of the most influential branches of machine learning and data analysis, and Gaussian Mixture Models (GMMs) are frequently adopted in data clustering due to their ease of implementation. However, there are certain limitations to this approach that need to be acknowledged. GMMs need to determine the cluster numbers manually, and they may fail to extract the information within the dataset during initialization. To address these issues, a new clustering algorithm called PFA-GMM has been proposed. PFA-GMM is based on GMMs and the Pathfinder algorithm (PFA), and it aims to overcome the shortcomings of GMMs. The algorithm automatically determines the optimal number of clusters based on the dataset. Subsequently, PFA-GMM considers the clustering problem as a global optimization problem for getting trapped in local convergence during initialization. Finally, we conducted a comparative study of our proposed clustering algorithm against other well-known clustering algorithms using both synthetic and real-world datasets. The results of our experiments indicate that PFA-GMM outperformed the competing approaches.

Indexed as

clusteringGaussian Mixture Modelsmetaheuristic algorithmpathfinder algorithm

Identifiers

PMID37372290
PMCPMC10296861

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.