IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v413y2014icp125-133.html
   My bibliography  Save this article

Modeling social tagging using latent interaction potential

Author

Listed:
  • Wu, Zhenyu
  • Zou, Ming

Abstract

Modeling social tagging plays a critical role in identifying statistical regularities and structural principles common to social tagging systems. Existing modeling approaches only consider imitations or background knowledge of users. However, common interests among users are ignored. In this paper, latent interactions are applied to present the common interests, and dynamic patterns in empirical data are investigated. Furthermore, the latent interaction driven model (LIDM) is proposed to model social tagging. Experimental results show that the tag frequency distribution generated by LIDM is consistent with that in real-world data. Moreover, the latent interaction graph generated by LIDM has a higher average clustering coefficient and lower average shortest path compared with that generated by preferential attachment methods. This demonstrates that LIDM outperforms traditional methods.

Suggested Citation

  • Wu, Zhenyu & Zou, Ming, 2014. "Modeling social tagging using latent interaction potential," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 125-133.
    • Handle: RePEc:eee:phsmap:v:413:y:2014:i:c:p:125-133
    DOI: 10.1016/j.physa.2014.06.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437114005238
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2014.06.048?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fragkiskos Papadopoulos & Maksim Kitsak & M. Ángeles Serrano & Marián Boguñá & Dmitri Krioukov, 2012. "Popularity versus similarity in growing networks," Nature, Nature, vol. 489(7417), pages 537-540, September.
    2. Monteiro, R.L.S. & Fontoura, J.R.A. & Carneiro, T.K.G. & Moret, M.A. & Pereira, H.B.B., 2014. "Evolution based on chromosome affinity from a network perspective," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 276-283.
    3. Saramäki, Jari & Kaski, Kimmo, 2004. "Scale-free networks generated by random walkers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 341(C), pages 80-86.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jascha-Alexander Koch & Michael Siering, 2019. "The recipe of successful crowdfunding campaigns," Electronic Markets, Springer;IIM University of St. Gallen, vol. 29(4), pages 661-679, December.
    2. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    3. Yan Chen & Youran Qi & Qing Liu & Peter Chien, 2018. "Sequential sampling enhanced composite likelihood approach to estimation of social intercorrelations in large-scale networks," Quantitative Marketing and Economics (QME), Springer, vol. 16(4), pages 409-440, December.
    4. Xizhe Zhang & Tianyang Lv & XueYing Yang & Bin Zhang, 2014. "Structural Controllability of Complex Networks Based on Preferential Matching," PLOS ONE, Public Library of Science, vol. 9(11), pages 1-8, November.
    5. Moore, Jack Murdoch & Small, Michael & Yan, Gang, 2021. "Inclusivity enhances robustness and efficiency of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    6. Sinan Aral & Paramveer S. Dhillon, 2023. "What (Exactly) Is Novelty in Networks? Unpacking the Vision Advantages of Brokers, Bridges, and Weak Ties," Management Science, INFORMS, vol. 69(2), pages 1092-1115, February.
    7. Haochuan Cui & Tiewei Li & Cheng-Jun Wang, 2023. "Climbing up the ladder of abstraction: how to span the boundaries of knowledge space in the online knowledge market?," Palgrave Communications, Palgrave Macmillan, vol. 10(1), pages 1-12, December.
    8. Martin Keller-Ressel & Stephanie Nargang, 2020. "The hyperbolic geometry of financial networks," Papers 2005.00399, arXiv.org, revised May 2020.
    9. Weihua Yang & David Rideout, 2020. "High Dimensional Hyperbolic Geometry of Complex Networks," Mathematics, MDPI, vol. 8(11), pages 1-39, October.
    10. Wang, Zuxi & Li, Qingguang & Jin, Fengdong & Xiong, Wei & Wu, Yao, 2016. "Hyperbolic mapping of complex networks based on community information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 455(C), pages 104-119.
    11. Shriram Ashok Kumar & Maliha Tasnim & Zohvin Singh Basnyat & Faezeh Karimi & Kaveh Khalilpour, 2022. "Resilience Analysis of Australian Electricity and Gas Transmission Networks," Sustainability, MDPI, vol. 14(6), pages 1-20, March.
    12. S. R. Goldberg & H. Anthony & T. S. Evans, 2015. "Modelling citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 105(3), pages 1577-1604, December.
    13. Shang, Ke-ke & Small, Michael & Yan, Wei-sheng, 2017. "Fitness networks for real world systems via modified preferential attachment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 474(C), pages 49-60.
    14. Maksim Kitsak & Alexander Ganin & Ahmed Elmokashfi & Hongzhu Cui & Daniel A. Eisenberg & David L. Alderson & Dmitry Korkin & Igor Linkov, 2023. "Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    15. Telcs, András & Csernai, Márton & Gulyás, András, 2013. "Load balanced diffusive capture process on homophilic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(3), pages 510-519.
    16. Zhenpeng Li & Luo Li, 2023. "The Generation Mechanism of Degree Distribution with Power Exponent >2 and the Growth of Edges in Temporal Social Networks," Mathematics, MDPI, vol. 11(13), pages 1-11, June.
    17. Ghiglino, Christian, 2012. "Random walk to innovation: Why productivity follows a power law," Journal of Economic Theory, Elsevier, vol. 147(2), pages 713-737.
    18. Jhun, Bukyoung & Jo, Minjae & Kahng, B., 2022. "Quantum contact process on scale-free networks," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    19. Hou, Lei & Liu, Kecheng & Liu, Jianguo & Zhang, Runtong, 2017. "Solving the stability–accuracy–diversity dilemma of recommender systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 415-424.
    20. Shang, Yilun, 2016. "On the likelihood of forests," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 456(C), pages 157-166.

    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:eee:phsmap:v:413:y:2014:i:c:p:125-133. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.