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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
天天快乐应助nana采纳,获得10
刚刚
1秒前
小肉包脸完成签到 ,获得积分20
1秒前
fuyishuai发布了新的文献求助10
1秒前
酷波er应助11111111采纳,获得10
1秒前
糖糖科研顺利呀完成签到 ,获得积分10
3秒前
八段锦完成签到 ,获得积分10
3秒前
李健应助清新的青曼采纳,获得10
4秒前
小蘑菇应助罗小妹采纳,获得10
4秒前
4秒前
英姑应助王辣条采纳,获得10
5秒前
枯藤老柳树完成签到,获得积分10
5秒前
tianyi关注了科研通微信公众号
6秒前
乐乐应助水果咔咔咔采纳,获得10
7秒前
7秒前
大知闲闲应助落寞的惜萱采纳,获得10
7秒前
彭于晏应助落寞的惜萱采纳,获得10
7秒前
Lsx发布了新的文献求助10
7秒前
8秒前
8秒前
Jasper应助茉莉花采纳,获得10
9秒前
10秒前
10秒前
11秒前
12秒前
12秒前
13秒前
13秒前
11111111发布了新的文献求助10
13秒前
幸世完成签到,获得积分10
13秒前
希望天下0贩的0应助123采纳,获得10
14秒前
14秒前
16秒前
123完成签到,获得积分10
16秒前
16秒前
赘婿应助YUMI采纳,获得10
16秒前
温暖半雪发布了新的文献求助10
16秒前
16秒前
科研通AI6.2应助宁祚采纳,获得10
17秒前
17秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 2000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Curating Socialism: A Handbook of International Art Exhibitions 1947-1989 750
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7526809
求助须知:如何正确求助?哪些是违规求助? 9113278
关于积分的说明 19463639
捐赠科研通 7128854
什么是DOI,文献DOI怎么找? 3255753
关于科研通互助平台的介绍 2423573
邀请新用户注册赠送积分活动 2243155