Clustering High-Dimensional Spaces Using a Modified EM Algorithm with Fractional Order Assignment

Clustering high-dimensional data presents significant challenges due to the curse of dimensionality, which complicates the detection of meaningful patterns and clusters. Traditional methods struggle to manage the increasing complexity, often becoming sensitive to noise, inefficient in capturing intricate relationships, and unable to handle uncertainties effectively. To address these issues, this study introduces EM-FASL, a novel clustering algorithm designed to improve accuracy in high-dimensional spaces by accounting for complex relationships and uncertainties. EM-FASL is an adaptation of the Expectation-Maximization (EM) algorithm, enhanced through fractional order assignment and logistic regression (LR). The method begins by initializing the parameters for a Gaussian Mixture Model (GMM) and an LR model. In the Expectation (E) step, it fits the GMM, computes fractional assignments, and evaluates fractional entropy to measure the uncertainty in assignments. In the Maximization (M) step, the GMM parameters are updated using the fractional assignments, while LR coefficients adjust the mean vectors of the GMM. The algorithm iterates between these steps until fractional entropy converges. The algorithm is evaluated on a range of high-dimensional datasets from the UCI repository, demonstrating its robustness across diverse data structures. Experimental results demonstrate that EM-FASL significantly outperforms existing clustering methods, offering superior accuracy in high-dimensional data by effectively capturing intricate data patterns. This innovative approach provides a robust solution to the challenges of high-dimensional clustering and opens up new avenues for future research.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/icicyta64807.2024.10913287
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Clustering High-Dimensional Spaces Using a Modified EM Algorithm with Fractional Order Assignment

Shivani Saxena, Ahsan Z. Rizvi, Nilesh Patel, Shruti Saxena et al.
Metaheuristic Optimization Algorithms Research
article

Clustering High-Dimensional Spaces Using a Modified EM Algorithm with Fractional Order Assignment

Shivani Saxena, Ahsan Z. Rizvi, Nilesh Patel, Shruti Saxena, Prince Rajyaguru
article en

Abstract

Clustering high-dimensional data presents significant challenges due to the curse of dimensionality, which complicates the detection of meaningful patterns and clusters. Traditional methods struggle to manage the increasing complexity, often becoming sensitive to noise, inefficient in capturing intricate relationships, and unable to handle uncertainties effectively. To address these issues, this study introduces EM-FASL, a novel clustering algorithm designed to improve accuracy in high-dimensional spaces by accounting for complex relationships and uncertainties. EM-FASL is an adaptation of the Expectation-Maximization (EM) algorithm, enhanced through fractional order assignment and logistic regression (LR). The method begins by initializing the parameters for a Gaussian Mixture Model (GMM) and an LR model. In the Expectation (E) step, it fits the GMM, computes fractional assignments, and evaluates fractional entropy to measure the uncertainty in assignments. In the Maximization (M) step, the GMM parameters are updated using the fractional assignments, while LR coefficients adjust the mean vectors of the GMM. The algorithm iterates between these steps until fractional entropy converges. The algorithm is evaluated on a range of high-dimensional datasets from the UCI repository, demonstrating its robustness across diverse data structures. Experimental results demonstrate that EM-FASL significantly outperforms existing clustering methods, offering superior accuracy in high-dimensional data by effectively capturing intricate data patterns. This innovative approach provides a robust solution to the challenges of high-dimensional clustering and opens up new avenues for future research.

National Forensic Sciences University (IN), Swedish University of Agricultural Sciences (SE), Indian Institute of Advanced Research (IN)
Openalex Percentile: Top 74%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.