IDEAS home Printed from https://ideas.repec.org/a/igg/jdwm00/v6y2010i1p1-19.html
   My bibliography  Save this article

Investigating the Properties of a Social Bookmarking and Tagging Network

Author

Listed:
  • Ralitsa Angelova

    (Max Planck Institut für Informatik, Germany)

  • Marek Lipczak

    (Dalhousie University, Canada)

  • Evangelos Milios

    (Dalhousie University, Canada)

  • Pawel Pralat

    (Dalhousie University, Canada)

Abstract

Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect strangers as long as they have common interests. del.icio.us3 is a social network where people store and share their personal bookmarks. Most importantly, users tag their bookmarks for ease of information dissemination and later look up. However, it is the friendship links that make del.icio.us a social network. They exist independently of the set of bookmarks that belong to the users and have no relation to the tags typically assigned to the bookmarks. To study the interaction among users, the strength of the existing links and their hidden meaning, we introduce implicit links in the network. These links connect only highly “similar” users. Here, similarity can reflect different aspects of the user’s profile that makes her similar to any other user, such as number of shared bookmarks, or similarity of their tags clouds. The authors investigate the question whether friends have common interests, they gain additional insights on the strategies that users use to assign tags to their bookmarks, and they demonstrate that the graphs formed by implicit links have unique properties differing from binomial random graphs or random graphs with an expected power-law degree distribution.

Suggested Citation

  • Ralitsa Angelova & Marek Lipczak & Evangelos Milios & Pawel Pralat, 2010. "Investigating the Properties of a Social Bookmarking and Tagging Network," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 6(1), pages 1-19, January.
  • Handle: RePEc:igg:jdwm00:v:6:y:2010:i:1:p:1-19
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ibrahim Sorkhoh & Khaled A. Mahdi & Maytham Safar, 2013. "Estimation algorithm for counting periodic orbits in complex social networks," Information Systems Frontiers, Springer, vol. 15(2), pages 193-202, April.

    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:jdwm00:v:6:y:2010:i:1:p:1-19. 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.