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

Abstract

AbstractThe 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.KeywordsSocial NetworkFrequent PatternLink PredictionSupport ThresholdInitial NetworkThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.