IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3247627.html
   My bibliography  Save this article

A Stable-Matching-Based User Linking Method with User Preference Order

Author

Listed:
  • Xuzhong Wang
  • Yan Liu
  • Yu Nan

Abstract

With the development of social networks, more and more users choose to use multiple accounts from different networks to meet their needs. Linking a particular user’s multiple accounts not only can improve user’s experience of the net-services such as recommender system, but also plays a significant role in network security. However, multiple accounts of the same user are often not directly linked to each other, and further, the privacy policy provided by the service provider makes it harder to find accounts for a particular user. In this paper, we propose a stable-matching-based method with user preference order for the problem of low accuracy of user linking in cross-media sparse data. Different from the traditional way which just calculates the similarity of accounts, we take full account of the mutual influence among multiple accounts by regarding different networks as bilateral (multilateral) market and user linking as a stable matching problem in such a market. Based on the combination of Game-Theoretic Machine Learning and Pairwise, a novel user linking method has been proposed. The experiment shows that our method has a 21.6% improvement in accuracy compared with the traditional linking method and a further increase of about 7.8% after adding the prior knowledge.

Suggested Citation

  • Xuzhong Wang & Yan Liu & Yu Nan, 2017. "A Stable-Matching-Based User Linking Method with User Preference Order," Mathematical Problems in Engineering, Hindawi, vol. 2017, pages 1-8, March.
  • Handle: RePEc:hin:jnlmpe:3247627
    DOI: 10.1155/2017/3247627
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2017/3247627.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2017/3247627.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/3247627?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:hin:jnlmpe:3247627. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.