Abstract

Web 2.0 or social web applications such as online discussion forums, blogs and Wikipedia have improved knowledge sharing by providing an environment in which users can generate and find their favorite content in, a flexible way. With the passage of time, online discussion forums accumulate a huge amount of content and this can introduce issues of content quality and user credibility. A poor-quality answer in a discussion forum indicates the presence of unprofessional or unqualified users; therefore, a priority is to find experts or reputable users. Most of the existing expert-ranking approaches consider basic features, such as the total number of answers provided by a user, but ignore the quality and consistency of the user's answer. In this paper, expert-ranking techniques using g-index are proposed, and are applied to a StackOverflow forum dataset. Three techniques are proposed including Exp-PC, Rep-FS and Weighted Exp-PC. Exp-PC is an adaptation of g-index for ranking experts in StackOverflow forum. In Rep-FS, several features like voters reputation, vote ratio are proposed to measure users' expertise while Weighted Exp-PC computes user expertise by combining their Exp-PC and Rep-FS scores. We measure users' reputation and expertise according to both the quality of their answer and their consistency in providing quality answers. The experimental results of the proposed expert-ranking techniques, Exp-PC and Weighted Exp-PC in particular, validate that these methods identify genuine experts in a more effective way.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.