Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm

聚类分析 天蓬 计算机科学 功率(物理) 算法 环境科学 物理 人工智能 生物 生态学 量子力学
作者
Ahmed Hadi Ali AL-Jumaili,Ravie Chandren Muniyandi,Mohammad Kamrul Hasan,Mandeep Jit Singh,Johnny Koh Siaw Paw,Abdulmajeed Al-Jumaily
出处
期刊:Intelligent Data Analysis [IOS Press]
卷期号:: 1-26
标识
DOI:10.3233/ida-230573
摘要

Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout’s distributed machine-learning environment. The study taps into Apache Hadoop’s robust tools for data storage and processing, including HDFS and MapReduce, to effectively manage and analyze big data challenges. The preprocessing phase utilizes Canopy clustering to expedite the initial partitioning of data points, which are subsequently refined by K-means to enhance clustering performance. Experimental results confirm that incorporating the Canopy as an initial step markedly reduces the computational effort to process the vast quantity of parallel power load abnormalities. The Canopy clustering approach, enabled by distributed machine learning through Apache Mahout, is utilized as a preprocessing step within the K-means clustering technique. The hybrid algorithm was implemented to minimise the length of time needed to address the massive scale of the detected parallel power load abnormalities. Data vectors are generated based on the time needed, sequential and parallel candidate feature data are obtained, and the data rate is combined. After classifying the time set using the canopy with the K-means algorithm and the vector representation weighted by factors, the clustering impact is assessed using purity, precision, recall, and F value. The results showed that using canopy as a preprocessing step cut the time it proceeds to deal with the significant number of power load abnormalities found in parallel using a fast density peak dataset and the time it proceeds for the k-means algorithm to run. Additionally, tests demonstrate that combining canopy and the K-means algorithm to analyze data performs consistently and dependably on the Hadoop platform and has a clustering result that offers a scalable and effective solution for power system monitoring.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
李爱国应助Ting330采纳,获得10
1秒前
1秒前
2秒前
Kao应助缓慢的吐司采纳,获得10
2秒前
2秒前
jrrr发布了新的文献求助10
3秒前
传奇3应助三三采纳,获得10
3秒前
Garlic发布了新的文献求助10
5秒前
不慌不张完成签到 ,获得积分10
5秒前
YBadada发布了新的文献求助10
6秒前
6秒前
6秒前
anwen发布了新的文献求助10
7秒前
Akim应助科研CY采纳,获得10
8秒前
一样谦虚完成签到,获得积分10
9秒前
9秒前
10秒前
文静的初曼完成签到,获得积分10
10秒前
暮叆发布了新的文献求助10
10秒前
充电宝应助大聪明采纳,获得10
11秒前
12秒前
YANG完成签到,获得积分10
13秒前
辛勤的咩发布了新的文献求助10
14秒前
14秒前
背后的皮带完成签到,获得积分10
15秒前
孔孔孔发布了新的文献求助10
15秒前
15秒前
16秒前
orixero应助张大帅采纳,获得10
16秒前
田様应助风趣健柏采纳,获得10
16秒前
17秒前
18秒前
HugginBearOuO发布了新的文献求助10
20秒前
JJJLX完成签到 ,获得积分10
20秒前
21秒前
辛勤的咩完成签到,获得积分10
21秒前
PGM发布了新的文献求助10
21秒前
wxzk发布了新的文献求助10
21秒前
初景发布了新的文献求助80
22秒前
小逸完成签到,获得积分10
22秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 2030
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Handbuch Trainingswissenschaft – Trainingslehre 500
Additive Manufacturing Design and Applications (ASM Handbook, Volume 24A) 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7576852
求助须知:如何正确求助?哪些是违规求助? 9156487
关于积分的说明 19588700
捐赠科研通 7160673
什么是DOI,文献DOI怎么找? 3265177
关于科研通互助平台的介绍 2430231
邀请新用户注册赠送积分活动 2255758