Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Application of an improved k‐means clustering algorithm in power user grouping

View through CrossRef
AbstractThe illegal act of stealing electricity has brought serious security risks to the operation of power transmission system. The electricity consumption law of power users has obvious characteristics, which can be classified by clustering method. However, the traditional k‐means clustering method has the characteristics of randomly selecting the initial cluster center, which leads to the instability of clustering results. Aiming at the shortcomings of traditional k‐means clustering algorithm, this paper proposes a density based k‐means clustering algorithm (Dk‐means clustering) to optimize the initial center selection. According to the characteristics of users' power load, the method of determining the number of clusters and the evaluation method of clustering effect are selected. Then, the traditional k‐means clustering algorithm and the improved Dk‐means clustering algorithm are used to analyze the power load data of a residential area, and six groups of characteristic curves are obtained. Based on the analysis of these curves, the power consumption characteristics of each group of users were evaluated. Finally, through the comparative analysis of Euclidean distance, Manhattan distance and correlation coefficient r, it is proved that Dk‐means algorithm has better clustering effect and is more accurate for the selection of suspicious power stealing users.
Title: Application of an improved k‐means clustering algorithm in power user grouping
Description:
AbstractThe illegal act of stealing electricity has brought serious security risks to the operation of power transmission system.
The electricity consumption law of power users has obvious characteristics, which can be classified by clustering method.
However, the traditional k‐means clustering method has the characteristics of randomly selecting the initial cluster center, which leads to the instability of clustering results.
Aiming at the shortcomings of traditional k‐means clustering algorithm, this paper proposes a density based k‐means clustering algorithm (Dk‐means clustering) to optimize the initial center selection.
According to the characteristics of users' power load, the method of determining the number of clusters and the evaluation method of clustering effect are selected.
Then, the traditional k‐means clustering algorithm and the improved Dk‐means clustering algorithm are used to analyze the power load data of a residential area, and six groups of characteristic curves are obtained.
Based on the analysis of these curves, the power consumption characteristics of each group of users were evaluated.
Finally, through the comparative analysis of Euclidean distance, Manhattan distance and correlation coefficient r, it is proved that Dk‐means algorithm has better clustering effect and is more accurate for the selection of suspicious power stealing users.

Related Results

The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Neural decoding dissociates perceptual grouping between proximity and similarity in visual perception
Neural decoding dissociates perceptual grouping between proximity and similarity in visual perception
Abstract Previous research on perceptual grouping primarily focused on the dynamics of single grouping principle in light of the Gestalt psycholo...
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
A Hybrid K-means Method based on Modified Rat Swarm Optimization Algorithm for Data Clustering
Abstract The original K-means clustering algorithm is prone to local optima and sensitive to the initial clustering center, which have a great impact on accuracy and stabil...
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
There are problems in big data clustering processing, such as poor clustering effect of different types of data and long clustering time. Therefore, a big data clustering processin...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Data clustering is frequently utilized in the early stages of analyzing big data. It enables the examination of massive datasets encompassing diverse types of data, with the aim of...

Back to Top