کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
462063 | 696663 | 2011 | 9 صفحه PDF | دانلود رایگان |
In recent years, there has been considerable interest in the analysis of social network data. In this paper, we propose a novel automatic generation algorithm of social network data – the Biclustering Algorithm for Social Network Data algorithm. The algorithm introduces biclustering to social network analysis for automatic identification of associations among a group of actors and entities. The algorithm is different from existing ones in that it employs a combination of min–max and pattern searching procedures to construct hierarchical biclusters and discover the relationships among these actors, in order to easily interpret social network data. The algorithm is not subject to convexity limitations, and does not need to use derivatives information.
► We propose a novel automatic generation algorithm of social network data.
► The algorithm introduces biclustering to social network analysis.
► The algorithm employs a combination of min–max and pattern search.
► The algorithm can easily interpret social network data.
► The algorithm can achieve high flexibility in handling data sets.
Journal: Journal of Systems and Software - Volume 84, Issue 8, August 2011, Pages 1261–1269