IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v10y2019i2p19-26.html
   My bibliography  Save this article

Finding Topic Experts in the Twitter Dataset Using LDA Algorithm

Author

Listed:
  • Ashwini Anandrao Shirolkar

    (Department of Technology, SU, Kolhapur, India)

  • R. J. Deshmukh

    (Department of Technology, SU, Kolhapur, India)

Abstract

In microblogging services like Twitter, the expert judgment problem has gained increasing attention in social media. Twitter is a new type of social media that provides a publicly available way for users to publish 140-character short messages (tweets). However, previous methods cannot be directly applied to twitter experts finding problems. They generally rely on the assumption that all the documents associated with the candidate experts contain tacit knowledge related to the expertise of individuals. Whereas it might not be directly associated with their expertise, i.e., who is not an expert, but may publish/re-tweet a substantial number of tweets containing the topic words. Recently, several attempts use the relations among users and twitter list for expert finding. Nevertheless, these strategies only partially utilize such relations. To address these issues a probabilistic method is developed to jointly exploit three types of relations (i.e., follower relation, user-list relation and list-list relation) for finding experts. LDA algorithms are used for finding topic experts. LDA is based upon the concept of searching for a linear combination of variables (predictors) that best separates two classes (targets). Semi-supervised graph-based ranking approach (SSGR) to offline calculate the global authority of users. Then, the local relevance between users and the given query is computed. Then, the rank of all the users is found and the top-N users with the highest-ranking scores. Therefore, the proposed approach can jointly exploit the different types of relations among users and lists for improving the accuracy of finding experts on a given topic on Twitter.

Suggested Citation

  • Ashwini Anandrao Shirolkar & R. J. Deshmukh, 2019. "Finding Topic Experts in the Twitter Dataset Using LDA Algorithm," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 10(2), pages 19-26, April.
  • Handle: RePEc:igg:jaec00:v:10:y:2019:i:2:p:19-26
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2019040103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaec00:v:10:y:2019:i:2:p:19-26. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.