[go: up one dir, main page]

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

Session analysis of people search within a professional social network

Author

Listed:
  • Ru He
  • Jiong Wang
  • Jin Tian
  • Cheng‐Tao Chu
  • Bradley Mauney
  • Igor Perisic
Abstract
We perform session analysis for our domain of people search within a professional social network. We find that the content‐based method is appropriate to serve as a basis for the session identification in our domain. However, there remain some problems reported in previous research which degrade the identification performance (such as accuracy) of the content‐based method. Therefore, in this article, we propose two important refinements to address these problems. We describe the underlying rationale of our refinements and then empirically show that the content‐based method equipped with our refinements is able to achieve an excellent identification performance in our domain (such as 99.820% accuracy and 99.707% F‐measure in our experiments). Next, because the time‐based method has extremely low computation costs, which makes it suitable for many real‐world applications, we investigate the feasibility of the time‐based method in our domain by evaluating its identification performance based on our refined content‐based method. Our experiments demonstrate that the performance of the time‐based method is potentially acceptable to many real applications in our domain. Finally, we analyze several features of the identified sessions in our domain and compare them with the corresponding ones in general web search. The results illustrate the profession‐oriented characteristics of our domain.

Suggested Citation

  • Ru He & Jiong Wang & Jin Tian & Cheng‐Tao Chu & Bradley Mauney & Igor Perisic, 2013. "Session analysis of people search within a professional social network," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 64(5), pages 929-950, May.
  • Handle: RePEc:bla:jamist:v:64:y:2013:i:5:p:929-950
    DOI: 10.1002/asi.22814
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/asi.22814?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:5:p:929-950. 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.