MAX-FLMin: An Approach for Mining Maximal Frequent Links and Generating Semantical Structures from Social Networks

Erick Stattner 1 Martine Collard 1
1 LAMIA - Laboratoire de Mathématiques Informatique et Applications
Abstract : The paper proposes a new knowledge discovery method called MAX-FLMin for extracting frequent patterns in social networks. Unlike traditional approaches that mainly focus on the network topological structure, the originality of our solution is its ability to exploit information both on the network structure and the attributes of nodes in order to elicit specific regularities that we call "Frequent Links". This kind of patterns provides relevant knowledge about the groups of nodes most connected within the network. First, we detail the method proposed to extract maximal frequent links from social networks. Second, we show how the extracted patterns are used to generate aggregated networks that represent the initial social network with more semantics. Qualitative and quantitative studies are conducted to evaluate the performances of our algorithm in various configurations.
Type de document :
Communication dans un congrès
Database and Expert Systems Applications (DEXA), 2012, Vienna, Austria. 7446, pp.468-483, 2012, 〈10.1007/978-3-642-32600-4_35〉
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00767052
Contributeur : Erick Stattner <>
Soumis le : mercredi 19 décembre 2012 - 14:01:52
Dernière modification le : mercredi 18 juillet 2018 - 20:11:27

Identifiants

Collections

UNIV-AG | BNRMI | TDS-MACS

Citation

Erick Stattner, Martine Collard. MAX-FLMin: An Approach for Mining Maximal Frequent Links and Generating Semantical Structures from Social Networks. Database and Expert Systems Applications (DEXA), 2012, Vienna, Austria. 7446, pp.468-483, 2012, 〈10.1007/978-3-642-32600-4_35〉. 〈hal-00767052〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

74

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD