Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2808797.2809402acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
short-paper

Leveraging Rating Behavior to Predict Negative Social Ties

Published: 25 August 2015 Publication History

Abstract

User social networks are a useful information for many information access related tasks, such as recommendation or information retrieval. In such tasks, recent papers have exploited the polarity of these links (friend/enemy) by capturing more precisely social patterns. This negative information being relatively scarce, a recent work proposed to infer it in social networks that contain none. However, this work relies on the direct interaction between users. In this paper, we pursue this approach under the assumption that we do not have access to this kind of data neither, thus allowing to cope with most social networks, where users can rate items and have friendship relationships. We exploit the user ratings polarity, i.e the fact that a rating can be positive (like) or negative (dislike), to infer negative ties. Experiments on the Epinions dataset show the potential of our approach.

References

[1]
J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Signed networks in social media," in Proceedings of CHI'10. ACM, 2010.
[2]
R. Guha, R. Kumar, P. Raghavan, and A. Tomkins, "Propagation of trust and distrust," in Proceedings of the 13th WWW conference. New York, New York, USA: ACM, 2004.
[3]
J. Tang, S. Chang, C. Aggarwal, and H. Liu, "Negative link prediction in social media," in Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, ser. WSDM '15. New York, NY, USA: ACM, 2015, pp. 87--96.
[4]
J. Leskovec, D. Huttenlocher, and J. Kleinberg, "Predicting positive and negative links in online social networks," in Proceedings of the 19th international conference on World wide web, ser. WWW '10. New York, NY, USA: ACM, 2010, pp. 641--650.
[5]
J. Kunegis, A. Lommatzsch, and C. Bauckhage, "The Slashdot Zoo: Mining a Social Network with Negative Edges," in Proceedings of the 18th international conference on World wide web, 2009.
[6]
S. H. Yang, B. Long, A. Smola, N. Sadagopan, Z. Zheng, and H. Zha, "Like like alike joint friendship and interest propagation in social networks," 2011.
[7]
S.-H. Yang, A. J. Smola, B. Long, H. Zha, and Y. Chang, "Friend or frenemy?: Predicting signed ties in social networks," in SIGIR. New York, NY, USA: ACM, 2012.
[8]
L.-A. Gauthier, B. Piwowarski, and P. Gallinari, "Filtrage collaboratif et intgration de la polaritdes jugements." in CORIA, 2014.
[9]
L.-A. Gauthier, B. Piwowarski, and P. Gallinari, "Polarité des jugements et des interactions pour le filtrage collaboratif et la prédiction de liens sociaux," in CORIA, 2015.
[10]
F. Harary, "On the notion of balance of a signed graph," Michigan Math J, vol. 2, pp. 143--146, 1953.
[11]
J. Kunegis, J. Preusse, and F. Schwagereit, "What is the added value of negative links in online social networks?" in Proceedings of the 22nd WWW conference, 2013.
[12]
P. Massa and P. Avesani, "Trust-aware bootstrapping of recommender systems," in ECAI 2006 Workshop on Recommender Systems, 2006, pp. 29--33+.
[13]
G. Dror, N. Koenigstein, Y. Koren, and M. Weimer, "The Yahoo! Music Dataset and KDD-Cup'11," JMLR Workshop and Conference Proceedings, vol. 18, pp. 3--18, 2012.
[14]
B. Pradel, N. Usunier, and P. Gallinari, "Ranking With Non-Random Missing Ratings: Influence Of Popularity And Positivity on Evaluation Metrics," in Proceedings of RecSys12, 2012.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015
August 2015
835 pages
ISBN:9781450338547
DOI:10.1145/2808797
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2015

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Short-paper
  • Research
  • Refereed limited

Funding Sources

  • AMMICO
  • MASTODONS

Conference

ASONAM '15
Sponsor:

Acceptance Rates

Overall Acceptance Rate 116 of 549 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 92
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Aug 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media