Evolutionary mining of skyline clusters ...
Document type :
Article dans une revue scientifique: Article original
Title :
Evolutionary mining of skyline clusters of attributed graph data
Author(s) :
Dhifli, Wajdi [Auteur]
Université de Lille
Karabadji, Nour El Islem [Auteur]
Laboratoire de Gestion Electronique de Document [Annaba] [LabGED]
Elati, Mohamed [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Hétérogénéité, Plasticité et Résistance aux Thérapies des Cancers = Cancer Heterogeneity, Plasticity and Resistance to Therapies - UMR 9020 - U 1277 [CANTHER]
Université de Lille
Karabadji, Nour El Islem [Auteur]
Laboratoire de Gestion Electronique de Document [Annaba] [LabGED]
Elati, Mohamed [Auteur correspondant]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Hétérogénéité, Plasticité et Résistance aux Thérapies des Cancers = Cancer Heterogeneity, Plasticity and Resistance to Therapies - UMR 9020 - U 1277 [CANTHER]
Journal title :
Information Sciences
Pages :
501-514
Publisher :
Elsevier
Publication date :
2020-01
ISSN :
0020-0255
HAL domain(s) :
Informatique [cs]
English abstract : [en]
Graph clustering is one of the most important research topics in graph mining and network analysis. Given the abundance of data in many real-world applications, graph nodes and edges could be annotated with multiple sets ...
Show more >Graph clustering is one of the most important research topics in graph mining and network analysis. Given the abundance of data in many real-world applications, graph nodes and edges could be annotated with multiple sets of attributes that could be derived from heterogeneous data sources. The consideration of these attributes during graph clustering would facilitate the generation of graph clusters with balanced and cohesive intra-cluster structures and nodes with homogeneous properties. In this paper, we propose a graph clustering approach for mining skyline clusters over large attributed graphs based on the dominance relationship. Each skyline solution is optimized simultaneously for multiple fitness functions, each function is defined over the graph topology or over a particular set of attributes derived from multiple data sources. We evaluate our approach experimentally with a large protein-protein interaction network of the human interactome enriched with large sets of heterogeneous cancer-associated attributes. The results demonstrate the efficiency of our approach and show how integrating node attributes from multiple data sources can result in a more robust graph clustering than the consideration of the graph topology alone.Show less >
Show more >Graph clustering is one of the most important research topics in graph mining and network analysis. Given the abundance of data in many real-world applications, graph nodes and edges could be annotated with multiple sets of attributes that could be derived from heterogeneous data sources. The consideration of these attributes during graph clustering would facilitate the generation of graph clusters with balanced and cohesive intra-cluster structures and nodes with homogeneous properties. In this paper, we propose a graph clustering approach for mining skyline clusters over large attributed graphs based on the dominance relationship. Each skyline solution is optimized simultaneously for multiple fitness functions, each function is defined over the graph topology or over a particular set of attributes derived from multiple data sources. We evaluate our approach experimentally with a large protein-protein interaction network of the human interactome enriched with large sets of heterogeneous cancer-associated attributes. The results demonstrate the efficiency of our approach and show how integrating node attributes from multiple data sources can result in a more robust graph clustering than the consideration of the graph topology alone.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
ANR Project :
Collections :
Source :