期刊文献+

面向电力边缘数据分析的图分类算法研究进展 被引量:1

Survey of Graph Classification Algorithms for Edge Data Analysis in Smart Grid
下载PDF
导出
摘要 随着智能电网等技术的发展,关于图数据的研究应运而生。图分类的目的是将图数据中表示的目标进行分类。在智能电网领域,从电网边缘终端设备产生的电力数据可以通过构图的形式表示成图数据进行处理。根据基础模型的不同,将现有图分类的方法归纳为四类,分别是嵌入方法、基于图的特征挖掘方法、核函数方法和深度学习方法。介绍图分类中常用的数据集,总结图分类方法的相关开源代码,可有效促进智能电网领域边缘数据分析技术的发展。 With the development of information technology and applications in smart grid,many researches on graph data have emerged,and the pur⁃pose of the graph classification is to classify the targets represented in the graph data.In the field of smart grids,power data generated from grid edge terminals can be processed in the form of a map representation.According to the different basic models,classifies the existing methods of graph classification into four categories,namely embedding method,graph-based feature mining method,kernel function meth⁃od and deep learning method.We introduced the data sets commonly used in graph classification and summarized the relevant open source code for graph classification methods.This paper hopes to introduce the existing classification methods of graphs and promote the develop⁃ment of edge data analysis technology in smart grid.
作者 许爱东 胡志伟 蒋屹新 张宇南 吴涛 XU Ai-dong;HU Zhi-wei;JIANG Yi-xin;ZHANG Yu-nan;WU Tao(SEPRI,China Southern Grid,Co.,Ltd.,Guangzhou 510670;Institution of communication and information engineering,Chongqing University of Posts and Telecommunications,Chongqing,400065;Law School of Cyberspace Security and Information,Chongqing University of Posts and Telecommunications,Chongqing 400065)
出处 《现代计算机》 2020年第21期8-14,共7页 Modern Computer
基金 国家重点研发计划资助(No.2018YFB0904900、2018YFB0904905) 国家自然科学基金(No.61802039、61772098) 重庆市教育委员会科学技术研究项目(No.KJQN201800630)。
关键词 图数据 图分类 智能电网 边缘计算 Graph Data Graph Classification Smart Grids Edge Calculation
  • 相关文献

参考文献2

二级参考文献18

  • 1刘勇,李建中,朱敬华.一种新的基于频繁闭显露模式的图分类方法[J].计算机研究与发展,2007,44(7):1169-1176. 被引量:10
  • 2Jin Ning, Young C, Wang Wei. GAIA: Graph classification using evolutionary computation [C] //Proc of the 2010 Int Conf on Management of Data. New York: ACM, 2010: 879 -890.
  • 3Deshpande M, Kuramochi M, Karypis G. Frequent sub- structure-based approaches for classifying chemical compounds [J]. IEEE Trans on Knowledge and Data Engineering, 2005, 17(8) : 1036-1050.
  • 4Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data [G]// LNCS 1910: Principles of Data Mining and Knowledge Discovery(PKDD2000). Berlin: Springer, 2000:13-23.
  • 5Kuramochi M, Karypis G. Frequent subgraph discovery [C] //Proc of the 2001 IEEE Int Conf on Data Mining (ICDM01). Piscataway, NJ: IEEE, 2001:313-320.
  • 6Yan X, Han J. gSpan: Graph based substructure pattern mining [C] //Proc of the 2002 Int Conf on Data Mining (ICDM02). Piseataway, NJ: IEEE, 2002 : 721-724.
  • 7Huan J, Wang W, Prins J. Efficient mining of frequen subgraph in the presence of isomorphism [C] //Proc of the 3rd IEEE Int Conf on Data Mining (ICDM03). Piscataway, NJ: IEEE, 2003: 549-552.
  • 8Yan Xifeng, Han Jiawei. CloseGraph: Mining closed frequent graph patters[C] //Proc of the 9th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2008:286-295.
  • 9Yan Xifeng, Cheng Hong, Han Jiawei, et al. Mining significant graph patterns by leap search [C] //Proc of the 2008 Int Conf on Management of data(SIGMOD08). New York: ACM, 2008: 433-444.
  • 10Fan Wei, Zhang Kun, Chcng Hong, et al. Direct mining of discriminative and essential frequent patterns via model-based search tree [C] //Proc of the 14th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining (KDD08). New York, ACM, 2008:230-238.

共引文献17

同被引文献15

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部