Mining Dynamic Communities based on a Novel Link-Clustering Algorithm
Author(s):
Abstract:
Discovering communities in time-varying social networks is one of the highly challenging area of research and researchers are welcome to propose new models for this domain. The issue is more problematic when overlapping structure of communities is going to be considered. In this research, we present a new online and incremental community detection algorithm called link-clustering which uses link-based clustering paradigm intertwined with a novel representative-based algorithm to handle these issues. The algorithm works in both weighted and binary networks and intrinsically allows for overlapping communities. Comparison with the state of art evolutionary algorithms and link-based clustering shows the accuracy of this method in detecting communities over times and motivates the extended research in link-based clustering paradigm for dynamic overlapping community detection purpose.
Keywords:
Language:
English
Published:
International Journal Information and Communication Technology Research, Volume:9 Issue: 1, Winter 2017
Pages:
45 to 51
magiran.com/p1710406
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!