IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v64y2013i3p500-515.html
   My bibliography  Save this article

On ranking relevant entities in heterogeneous networks using a language‐based model

Author

Listed:
  • Laure Soulier
  • Lamjed Ben Jabeur
  • Lynda Tamine
  • Wahiba Bahsoun

Abstract

A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi‐type information entity network. Evidence sources, namely content‐based and network‐based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model‐based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.

Suggested Citation

  • Laure Soulier & Lamjed Ben Jabeur & Lynda Tamine & Wahiba Bahsoun, 2013. "On ranking relevant entities in heterogeneous networks using a language‐based model," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 64(3), pages 500-515, March.
  • Handle: RePEc:bla:jamist:v:64:y:2013:i:3:p:500-515
    DOI: 10.1002/asi.22762
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.22762
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.22762?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:bla:jamist:v:64:y:2013:i:3:p:500-515. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    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.