این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
International Journal of Information and Communication Technology Research (IJICT، جلد ۱۱، شماره ۴، صفحات ۴۸-۵۶
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Creating a Maximal Clique Graph to Improve Community Detection in SCoDA and OSLOM Algorithms
چکیده انگلیسی مقاله Community detection is one of the important topics regarding complex network study. There are many community detection algorithms such as Streaming Community Detection Algorithm (SCoDA) and Order Statistics Local Optimization Method (OSLOM). However, the performance of these algorithms, in overlap communities and communities with ambiguous structure, is problematic. In community detection algorithms achieving accurate results is a challenge. In this paper, we've proposed a method based on finding maximal cliques and generating the corresponding graph in order to use as an input to SCoDA and OSLOM algorithms. Synthetic non-overlap and overlap graphs and real graphs data are used in our experiments. F1score and NM1 score functions are utilized as our evaluation criteria. We have shown that the improved version of SCoDA demonstrated better results in comparison to the original SCoDA algorithm, and the improved version of OSLOM was also superior in performance when compared with the original OSLOM algorithm.
کلیدواژه‌های انگلیسی مقاله Maximal clique, Maximal clique graph, OSLOM, SCoDA, Community Detection, Non-overlap community, Overlap community
نویسندگان مقاله | Sasan Sabour
School of Engineering Science College of Engineering University of Tehran


| Ali Moeini
School of Engineering Science College of Engineering University of Tehran
نشانی اینترنتی http://ijict.itrc.ac.ir/browse.php?a_code=A-10-474-2&slc_lang=other&sid=1
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده other
موضوعات مقاله منتشر شده فناوری اطلاعات
نوع مقاله منتشر شده پژوهشی
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات