基于网络科学的电力系统网络等价k-means++聚类方法

Q1 Mathematics
Dhruv Sharma, Krishnaiya Thulasiraman, Di Wu, John N. Jiang
{"title":"基于网络科学的电力系统网络等价k-means++聚类方法","authors":"Dhruv Sharma, Krishnaiya Thulasiraman, Di Wu, John N. Jiang","doi":"10.1186/s40649-019-0064-3","DOIUrl":null,"url":null,"abstract":"Network equivalence is a technique useful for many areas including power systems. In many power system analyses, generation shift factor (GSF)-based bus clustering methods have been widely used to reduce the complexity of the equivalencing problem. GSF captures power flow on a line when power is injected at a node using bus to bus electrical distance. A more appropriate measure is the one which captures what may be called the electrical line distance with respect to a bus termed as relative bus to line distance. With increase in power transactions across different regions, the use of relative bus to line distance becomes appropriate for many analyses. Inspired by the recent trends in network science on the study of network dynamics based on the topological characteristics of a network, in this paper, we present a bus clustering method based on average electrical distance (AED). AED is independent of changes in location of slack bus and is based on the concept of electrical distance introduced in the context of molecular chemistry and pursued later for applications in social and complex networks. AED represents the AED from a bus to buses of the transmission line of interest. We first propose an AED-based method to group the buses into clusters for power systems network equivalence using k-means clustering algorithm integrated with silhouette analysis. One limitation of this method is that despite its speed, sometimes it may yield clusters of inferior quality compared to the optimal solution. To overcome this limitation, we next present our improved clustering method which incorporates a seeding technique that initializes centroids probabilistically. We also incorporate a technique in our method to find the number of clusters, k, to be given as input to our clustering algorithm. The resulting algorithm called AED-based k-means++ clustering method yields a clustering that is O(logk) competitive. Our network equivalence technique is next described. Finally, the efficacy of our new equivalencing technique is demonstrated by evaluating its performance on the IEEE 300-bus system and comparing that to the performance of our AED-based method (Sharma et al. in Power network equivalents: a network science-based k-means clustering method integrated with silhouette analysis. In: Complex networks and their application VI, Lyon, France. p. 78–89, 2017) and the existing GSF-based method.","PeriodicalId":52145,"journal":{"name":"Computational Social Networks","volume":"45 5","pages":"1-25"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A network science-based k-means++ clustering method for power systems network equivalence\",\"authors\":\"Dhruv Sharma, Krishnaiya Thulasiraman, Di Wu, John N. Jiang\",\"doi\":\"10.1186/s40649-019-0064-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network equivalence is a technique useful for many areas including power systems. In many power system analyses, generation shift factor (GSF)-based bus clustering methods have been widely used to reduce the complexity of the equivalencing problem. GSF captures power flow on a line when power is injected at a node using bus to bus electrical distance. A more appropriate measure is the one which captures what may be called the electrical line distance with respect to a bus termed as relative bus to line distance. With increase in power transactions across different regions, the use of relative bus to line distance becomes appropriate for many analyses. Inspired by the recent trends in network science on the study of network dynamics based on the topological characteristics of a network, in this paper, we present a bus clustering method based on average electrical distance (AED). AED is independent of changes in location of slack bus and is based on the concept of electrical distance introduced in the context of molecular chemistry and pursued later for applications in social and complex networks. AED represents the AED from a bus to buses of the transmission line of interest. We first propose an AED-based method to group the buses into clusters for power systems network equivalence using k-means clustering algorithm integrated with silhouette analysis. One limitation of this method is that despite its speed, sometimes it may yield clusters of inferior quality compared to the optimal solution. To overcome this limitation, we next present our improved clustering method which incorporates a seeding technique that initializes centroids probabilistically. We also incorporate a technique in our method to find the number of clusters, k, to be given as input to our clustering algorithm. The resulting algorithm called AED-based k-means++ clustering method yields a clustering that is O(logk) competitive. Our network equivalence technique is next described. Finally, the efficacy of our new equivalencing technique is demonstrated by evaluating its performance on the IEEE 300-bus system and comparing that to the performance of our AED-based method (Sharma et al. in Power network equivalents: a network science-based k-means clustering method integrated with silhouette analysis. In: Complex networks and their application VI, Lyon, France. p. 78–89, 2017) and the existing GSF-based method.\",\"PeriodicalId\":52145,\"journal\":{\"name\":\"Computational Social Networks\",\"volume\":\"45 5\",\"pages\":\"1-25\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s40649-019-0064-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s40649-019-0064-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 8

摘要

网络等效是一种适用于包括电力系统在内的许多领域的技术。在许多电力系统分析中,基于移位因子的母线聚类方法被广泛用于降低等效问题的复杂性。GSF捕获线路上的功率流,当电力通过总线到总线的电距离注入节点时。一种更合适的测量方法是捕获所谓的相对于母线的电线距离,称为相对母线距离。随着不同地区电力交易的增加,使用相对母线距离对许多分析变得合适。基于网络拓扑特征研究网络动力学的最新网络科学趋势,本文提出了一种基于平均电距离(AED)的总线聚类方法。AED与闲置总线位置的变化无关,它基于在分子化学背景下引入的电距离概念,后来在社会和复杂网络中应用。AED表示AED从总线到总线感兴趣的传输线。本文首先提出了一种基于aed的方法,将k-means聚类算法与轮廓分析相结合,将母线聚类成簇,实现电力系统网络等价。这种方法的一个限制是,尽管速度很快,但有时它可能产生质量不如最优解的聚类。为了克服这一限制,我们接下来提出了改进的聚类方法,该方法采用了一种播种技术,以概率方式初始化质心。我们还在我们的方法中加入了一种技术来查找集群的数量,k,作为我们的聚类算法的输入。由此产生的算法称为基于aed的k-means++聚类方法,产生了O(logk)竞争的聚类。接下来介绍我们的网络等效技术。最后,通过评估我们的新等效技术在IEEE 300总线系统上的性能,并将其与基于aed的方法的性能进行比较,证明了我们的新等效技术的有效性(Sharma等人在Power network equivalents:基于网络科学的k-means聚类方法与轮廓分析相结合)。见:复杂网络及其应用VI,里昂,法国。p. 78-89, 2017)和现有的基于gsf的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A network science-based k-means++ clustering method for power systems network equivalence
Network equivalence is a technique useful for many areas including power systems. In many power system analyses, generation shift factor (GSF)-based bus clustering methods have been widely used to reduce the complexity of the equivalencing problem. GSF captures power flow on a line when power is injected at a node using bus to bus electrical distance. A more appropriate measure is the one which captures what may be called the electrical line distance with respect to a bus termed as relative bus to line distance. With increase in power transactions across different regions, the use of relative bus to line distance becomes appropriate for many analyses. Inspired by the recent trends in network science on the study of network dynamics based on the topological characteristics of a network, in this paper, we present a bus clustering method based on average electrical distance (AED). AED is independent of changes in location of slack bus and is based on the concept of electrical distance introduced in the context of molecular chemistry and pursued later for applications in social and complex networks. AED represents the AED from a bus to buses of the transmission line of interest. We first propose an AED-based method to group the buses into clusters for power systems network equivalence using k-means clustering algorithm integrated with silhouette analysis. One limitation of this method is that despite its speed, sometimes it may yield clusters of inferior quality compared to the optimal solution. To overcome this limitation, we next present our improved clustering method which incorporates a seeding technique that initializes centroids probabilistically. We also incorporate a technique in our method to find the number of clusters, k, to be given as input to our clustering algorithm. The resulting algorithm called AED-based k-means++ clustering method yields a clustering that is O(logk) competitive. Our network equivalence technique is next described. Finally, the efficacy of our new equivalencing technique is demonstrated by evaluating its performance on the IEEE 300-bus system and comparing that to the performance of our AED-based method (Sharma et al. in Power network equivalents: a network science-based k-means clustering method integrated with silhouette analysis. In: Complex networks and their application VI, Lyon, France. p. 78–89, 2017) and the existing GSF-based method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computational Social Networks
Computational Social Networks Mathematics-Modeling and Simulation
自引率
0.00%
发文量
0
审稿时长
13 weeks
期刊介绍: Computational Social Networks showcases refereed papers dealing with all mathematical, computational and applied aspects of social computing. The objective of this journal is to advance and promote the theoretical foundation, mathematical aspects, and applications of social computing. Submissions are welcome which focus on common principles, algorithms and tools that govern network structures/topologies, network functionalities, security and privacy, network behaviors, information diffusions and influence, social recommendation systems which are applicable to all types of social networks and social media. Topics include (but are not limited to) the following: -Social network design and architecture -Mathematical modeling and analysis -Real-world complex networks -Information retrieval in social contexts, political analysts -Network structure analysis -Network dynamics optimization -Complex network robustness and vulnerability -Information diffusion models and analysis -Security and privacy -Searching in complex networks -Efficient algorithms -Network behaviors -Trust and reputation -Social Influence -Social Recommendation -Social media analysis -Big data analysis on online social networks This journal publishes rigorously refereed papers dealing with all mathematical, computational and applied aspects of social computing. The journal also includes reviews of appropriate books as special issues on hot topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信