Efficient Fuzzy Trajectory Clustering Algorithm (EFTCA) for Electing Optimum Clusters

Efficient Fuzzy Trajectory Clustering Algorithm tackles challenges in spatial trajectory data clustering by addressing varying sampling rates, serialization, uncertainty, redundancy, and spatial autocorrelation. Initially, it normalizes trajectories of varying lengths into equal lengths using the Douglas-Peucker algorithm. EFTCA then determines the optimal number of clusters using fuzzy partition coefficients. This fuzzy-based approach effectively handles uncertainty and redundancy in trajectory clustering. The algorithm’s performance is evaluated using standard cluster validity metrics, including the Adjusted Rand Index (ARI) and Fowlkes-Mallow Score (FMS), to compare EFTCA with conventional clustering techniques. The results reveal that EFTCA significantly outperforms standard methods, with ARI and FMS values approximately 1.31 times higher, demonstrating its superiority in handling complex trajectory data and providing more reliable and accurate clustering results. Proposed EFTCA is validated for accuracy against the researcher generated data as proof-of-concept validation.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.03.245
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Fuzzy Trajectory Clustering Algorithm (EFTCA) for Electing Optimum Clusters

Arunkumar Chinnaswamy, S. Lavanya, B. A. Sabarish, P Abineha et al.
Procedia Computer Science
Advanced Clustering Algorithms Research
article

Efficient Fuzzy Trajectory Clustering Algorithm (EFTCA) for Electing Optimum Clusters

Arunkumar Chinnaswamy, S. Lavanya, B. A. Sabarish, P Abineha, Deepak Menan
article en

Abstract

Efficient Fuzzy Trajectory Clustering Algorithm tackles challenges in spatial trajectory data clustering by addressing varying sampling rates, serialization, uncertainty, redundancy, and spatial autocorrelation. Initially, it normalizes trajectories of varying lengths into equal lengths using the Douglas-Peucker algorithm. EFTCA then determines the optimal number of clusters using fuzzy partition coefficients. This fuzzy-based approach effectively handles uncertainty and redundancy in trajectory clustering. The algorithm’s performance is evaluated using standard cluster validity metrics, including the Adjusted Rand Index (ARI) and Fowlkes-Mallow Score (FMS), to compare EFTCA with conventional clustering techniques. The results reveal that EFTCA significantly outperforms standard methods, with ARI and FMS values approximately 1.31 times higher, demonstrating its superiority in handling complex trajectory data and providing more reliable and accurate clustering results. Proposed EFTCA is validated for accuracy against the researcher generated data as proof-of-concept validation.

Procedia Computer ScienceVol. 260
Amrita Vishwa Vidyapeetham (IN)
Openalex Percentile: Top 95%
Advanced Clustering 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.

Efficient Fuzzy Trajectory Clustering Algorithm (EFTCA) for Electing Optimum Clusters — Arunkumar Chinnaswamy, S. Lavanya, et al. · Procedia Computer Science (2025) | TGRS Research Map | TGRS