一种挖掘属性图数据天际线簇的进化模式

Wajdi Dhifli, Noemie Oliveira Da Costa, M. Elati
{"title":"一种挖掘属性图数据天际线簇的进化模式","authors":"Wajdi Dhifli, Noemie Oliveira Da Costa, M. Elati","doi":"10.1109/CEC.2017.7969559","DOIUrl":null,"url":null,"abstract":"Graph clustering is one of the most important research topics in graph mining and network analysis. With the abundance of data in many real-world applications, the graph nodes and edges could be annotated with multiple sets of attributes that could be derived from heterogeneous data sources. Considering these attributes during the graph clustering could help in generating graph clusters with balanced and cohesive intra-cluster structure and nodes having homogeneous properties. In this paper, we propose a genetic algorithm-based graph clustering approach for mining skyline clusters over large attributed graphs based on the dominance relationship. Each skyline solution is optimized with respect to multiple fitness functions simultaneously where each function is defined over the graph topology or over a particular set of attributes that are derived from multiple data sources. We experimentally evaluate our approach on a real-world large protein-protein interaction network of the human interactome enriched with large sets of heterogeneous cancer associated attributes. The obtained results show the efficiency of our approach and how integrating node attributes of multiple data sources allows to obtain a more robust graph clustering than by considering only the graph topology.","PeriodicalId":335123,"journal":{"name":"2017 IEEE Congress on Evolutionary Computation (CEC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An evolutionary schema for mining skyline clusters of attributed graph data\",\"authors\":\"Wajdi Dhifli, Noemie Oliveira Da Costa, M. Elati\",\"doi\":\"10.1109/CEC.2017.7969559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph clustering is one of the most important research topics in graph mining and network analysis. With the abundance of data in many real-world applications, the graph nodes and edges could be annotated with multiple sets of attributes that could be derived from heterogeneous data sources. Considering these attributes during the graph clustering could help in generating graph clusters with balanced and cohesive intra-cluster structure and nodes having homogeneous properties. In this paper, we propose a genetic algorithm-based graph clustering approach for mining skyline clusters over large attributed graphs based on the dominance relationship. Each skyline solution is optimized with respect to multiple fitness functions simultaneously where each function is defined over the graph topology or over a particular set of attributes that are derived from multiple data sources. We experimentally evaluate our approach on a real-world large protein-protein interaction network of the human interactome enriched with large sets of heterogeneous cancer associated attributes. The obtained results show the efficiency of our approach and how integrating node attributes of multiple data sources allows to obtain a more robust graph clustering than by considering only the graph topology.\",\"PeriodicalId\":335123,\"journal\":{\"name\":\"2017 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2017.7969559\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2017.7969559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

图聚类是图挖掘和网络分析领域的重要研究课题之一。由于在许多实际应用程序中有大量的数据,可以用从异构数据源派生的多组属性对图节点和边进行注释。在聚类过程中考虑这些属性有助于生成具有均衡内聚结构和同质属性的图簇。在本文中,我们提出了一种基于遗传算法的基于优势关系的大型属性图上采矿天际线聚类方法。每个天际线解决方案同时针对多个适应度函数进行优化,其中每个函数都是在图拓扑或从多个数据源派生的特定属性集上定义的。我们在一个真实世界的人类相互作用组的大型蛋白质-蛋白质相互作用网络上实验评估了我们的方法,该网络富含大量异质癌症相关属性。得到的结果表明了我们的方法的有效性,以及如何整合多个数据源的节点属性可以获得比仅考虑图拓扑更鲁棒的图聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An evolutionary schema for mining skyline clusters of attributed graph data
Graph clustering is one of the most important research topics in graph mining and network analysis. With the abundance of data in many real-world applications, the graph nodes and edges could be annotated with multiple sets of attributes that could be derived from heterogeneous data sources. Considering these attributes during the graph clustering could help in generating graph clusters with balanced and cohesive intra-cluster structure and nodes having homogeneous properties. In this paper, we propose a genetic algorithm-based graph clustering approach for mining skyline clusters over large attributed graphs based on the dominance relationship. Each skyline solution is optimized with respect to multiple fitness functions simultaneously where each function is defined over the graph topology or over a particular set of attributes that are derived from multiple data sources. We experimentally evaluate our approach on a real-world large protein-protein interaction network of the human interactome enriched with large sets of heterogeneous cancer associated attributes. The obtained results show the efficiency of our approach and how integrating node attributes of multiple data sources allows to obtain a more robust graph clustering than by considering only the graph topology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信