A Novel K-Means Clustering Method for Locating Urban Hotspots Based on Hybrid Heuristic Initialization

نویسندگان

چکیده

With rapid economic and demographic growth, traffic conditions in medium large cities are becoming extremely congested. Numerous metropolitan management organizations hope to promote the coordination of urban development by formulating improving strategies. The effectiveness these solutions depends largely on an accurate assessment distribution hotspots (centers activity). In recent years, many scholars have employed K-Means clustering technique identify hotspots, believing it be efficient. K-means is a sort iterative analysis. When data dimensionality sample size enormous, algorithm sensitive initial centers. To mitigate problem, hybrid heuristic “fuzzy system-particle swarm-genetic” algorithm, named FPSO-GAK, obtain better centers for algorithm. results evaluated analyzed using three-cluster evaluation indexes (SC, SP SSE) two-cluster similarity (CI CSI). A taxi GPS dataset multi-source were test validate proposed comparison Random Swap (RS), Genetic (GAK), Particle Swarm Optimization (PSO) based K-Means, PSO constraint Weighted PSO-GA K-Means++ algorithms. findings demonstrate that can achieve results, as well successfully acquire hotspots.

منابع مشابه

Farthest-Point Heuristic based Initialization Methods for K-Modes Clustering

The k-modes algorithm has become a popular technique in solving categorical data clustering problems in different application domains. However, the algorithm requires random selection of initial points for the clusters. Different initial points often lead to considerable distinct clustering results. In this paper we present an experimental study on applying a farthest-point heuristic based init...

متن کامل

A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach

In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...

متن کامل

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

Histogram-Based Method for Effective Initialization of the K-Means Clustering Algorithm

K-means is undoubtedly the most widely used partitional clustering algorithm. Unfortunately, this algorithm is highly sensitive to the initial selection of the cluster centers. Numerous initialization methods have been proposed to address this drawback. Many of these methods, however, have superlinear complexity in the number of data points, which makes them impractical for large data sets. On ...

متن کامل

A Novel Hybrid Algorithm Based on K-Means and Evolutionary Computations for Real Time Clustering

Australian Business Deans Council (ABDC); Bacon’s Media Directory; Burrelle’s Media Directory; Cabell’s Directories; Compendex (Elsevier Engineering Index); CSA Illumina; Current

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12168047