Analysis of expert finding algorithms in social network in order to rank the top algorithms
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
The ubiquity of Internet and social networks have turned question and answer communities into an environment suitable for users to ask their questions about anything or to share their knowledge by providing answers to other users questions. These communities designed for knowledge-sharing aim to improve user knowledge, making it imperative to have a mechanism that can evaluate users knowledge level or in other words to find experts. There is a need for expert-finding algorithms in social networks or any other knowledge sharing environment like question and answer communities. There are various content analysis and link analysis methods for expert-finding in social networks. This paper aims to challenge four algorithms by applying them to our dataset and analyze the results in order to compare the algorithms. The algorithms suitable for expert finding has been found and ranked. Based on the results and tests it is concluded that the Z-score algorithm has a better performance than others.
Keywords:
Language:
English
Published:
Journal of Information Systems and Telecommunication, Volume:5 Issue: 4, Oct -Dec 2017
Page:
217
magiran.com/p1792537
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!