Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Foundations of Trust and Distrust in Networks: Extended Structural Balance Theory

Published: 08 July 2014 Publication History

Abstract

Modeling trust in very large social networks is a hard problem due to the highly noisy nature of these networks that span trust relationships from many different contexts, based on judgments of reliability, dependability, and competence. Furthermore, relationships in these networks vary in their level of strength. In this article, we introduce a novel extension of structural balance theory as a foundational theory of trust and distrust in networks. Our theory preserves the distinctions between trust and distrust as suggested in the literature, but also incorporates the notion of relationship strength that can be expressed as either discrete categorical values, as pairwise comparisons, or as metric distances. Our model is novel, has sound social and psychological basis, and captures the classical balance theory as a special case. We then propose a convergence model, describing how an imbalanced network evolves towards new balance, and formulate the convergence problem of a social network as a Metric Multidimensional Scaling (MDS) optimization problem. Finally, we show how the convergence model can be used to predict edge signs in social networks and justify our theory through extensive experiments on real datasets.

References

[1]
S. Adalı. 2013. Modeling Trust Context in Networks. Springer.
[2]
D. Ames, S. Fiske, and A. Todorov. 2011. Impression formation: A focus on others' intents. In The Oxford Handbook of Social Neuroscience, J. Decety and J. Cacioppo, Eds., Oxford University Press, 419--433.
[3]
S. Aral, L. Muchnik, and A. Sundararajan. 2009. Distinguishing influence based contagion from homophily driven diffusion in dynamic networks. Proc. Nat. Acad. Sci. 106, 51, 21544--21549.
[4]
P. Avesani, P. Massa, and R. Tiella. 2005. A trust-enhanced recommender system application: Moleskiing. In Proceedings of the ACM Symposium on Applied Computing (SAC'05). ACM Press, New York, 1589--1593.
[5]
R. Balakrishnan and S. Kambhampati. 2011. Sourcerank: Relevance and trust assessment for deep web sources based on inter-source agreement. In Proceedings of the 20th International Conference on World Wide Web (WWW'11). 227--236.
[6]
D. Cartwright and F. Harary. 1956. Structural balance: A generalization of heider's theory. Psychol. Rev. 63, 5, 277--293.
[7]
J. Davis. 1967. Clustering and structural balance in graphs. Hum. Relat. 20, 2, 181--187.
[8]
D. Do B. Defigueiredo and E. T. Barr. 2005. Trustdavis: A non-exploitable online reputation system. In Proceedings of the 7th IEEE International Conference on E-Commerce Technology (CEC'05). IEEE Computer Society, 274--283.
[9]
P. Doreian. 2002. Event sequences as generators of social network evolution. Social Netw. 24, 93--119.
[10]
T. Dubois, J. Golbeck, and A. Srinavasan. 2011. Predicting trust and distrust in social networks. In Proceedings of the IEEE International Conference on Social Computing (SocialCom'11).
[11]
T. Dubois, J. Golbeck, and A. Srinivasan. 2009. Rigorous probabilistic trust-inference with applications to clustering. In Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT'09). IEEE Computer Society, 655--658.
[12]
D. Easley and J. Kleinberg. 2010. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, New York.
[13]
S. T. Fiske, A. J. Cuddy, and P. Glick. 2007. Universal dimensions of social cognition: Warmth and competence. Trends Cogn. Sci. 11, 2, 77--83.
[14]
E. R. Gansner, Y. Koren, and S. North. 2005. Graph drawing by stress majorization. In Proceedings of the 12th International Conference on Graph Drawing (GD'05), J. Pach, Ed., Lecture Notes in Computer Science, vol. 3383, Springer, 239--250.
[15]
M. Granovetter. 1973. The strength of weak ties. Amer. J. Sociol. 78, 1--22.
[16]
R. Guha, R. Kumar, P. Raghavan, and A. Tomkins. 2004. Propagation of trust and distrust. In Proceedings of the 13th International Conference on World Wide Web (WWW'04). ACM Press, New York, 403--412.
[17]
M. Gupta, Y. Sun, and J. Han. 2011. Trust analysis with clustering. In Proceedings of the 20th International Conference on World Wide Web (WWW'11). 53--54.
[18]
C. Hang, Y. Wang, and M. Singh. 2008. An adaptive probabilistic trust model and its evaluation. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'08). Vol. 3. 1485--1488.
[19]
B. Huang, A. Kimmig, L. Getoor, and J. Golbeck. 2013. A flexible framework for probabilistic models of social trust. In Proceedings of the International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction (SBP'13). 265--273.
[20]
A. Josang, S. Marsh, and S. Pope. 2006. Exploring different types of trust propagation. In Proceedings of the 4th International Conference on Trust Management (iTrust'06). Vol. 3986, Springer, 179--192.
[21]
U. Kuter and J. Golbeck. 2010. Using probabilistic confidence models for trust inference in web-based social networks. ACM Trans. Internet Technol. 10, 2, 1--23.
[22]
H. Le, J. Pasternack, H. Ahmadi, M. Gupta, Y. Sun, T. Abdelzaher, J. Han, D. Roth, B. Szymanski, and S. Adalı. 2011. Apollo: Towards factfinding in participatory sensing. In Proceedings of the 10th International Conference on Information Processing in Sensor Networks (IPSN'11). 129--130.
[23]
J. D. Leeuw. 1977. Applications of convex analysis to multidimensional scaling. In Recent Developments in Statistics, J. Barra, F. Brodeau, F. Romier, and B. V. Cutsem, Eds., North-Holland Publishing, 133--145.
[24]
J. Leskovec, D. Huttenlocher, and J. Kleinberg. 2010. Predicting positive and negative links in online social networks. In Proceedings of the 19th International Conference on World Wide Web (WWW'10). ACM Press, New York, 641--650.
[25]
R. Levien and A. Aiken. 1998. Attack-resistant trust metrics for public key certification. In Proceedings of the 7th USENIX Security Symposium (SSYM'98). Vol. 7, USENIX Association, 18.
[26]
D. Liben-Nowell and J. Kleinberg. 2003. The link prediction problem for social networks. In Proceedings of the 12th International Conference on Information and Knowledge Management (CIKM'03). ACM Press, New York, 556--559.
[27]
J. Patel, W. Teacy, N. Jennings, and M. Luck. 2005. A probabilistic trust model for handling inaccurate reputation sources. In Proceedings of the 3rd International Conference on Trust Management (ITrust'05). 193--209.
[28]
Y. Qian and S. Adalı. 2013. Extended structural balance theory for modeling trust in social networks. In Proceedings of the 11th Annual International Conference on Privacy, Security and Trust (PST'13). 283--290.
[29]
J. Tang, H. Gao, X. Hu, and H. Liu. 2013. Exploiting homophily effect for trust prediction. In Proceedings of the Conference on Web Search and Data Mining (WSDM'13). ACM Press, New York, 53--62.
[30]
M. Tomasello, M. Carpenter, J. Call, T. Behne, and H. Moll. 2005. Understanding and sharing intentions: The origins of cultural cognition. Behav. Brain Sci. 28, 5, 675--91.
[31]
B. Uzzi. 1996. The sources and consequences of embeddedness for the economic performance of organizations: The network effect. Amer. Sociol. Rev. 61, 674--698.
[32]
P. Victor, C. Cornelis, M. D. Cock, and E. Herrera-Viedma. 2011. Practical aggregation operators for gradual trust and distrust. Fuzzy Sets Syst. 184, 1, 126--147.
[33]
Y. Yao, H. Tong, X. Yan, F. Xu, and J. Lu. 2013. Matri: A multi-aspect and transitive trust inference model. In Proceedings of the 22nd International Conference on World Wide Web (WWW'13). 1467--1476.
[34]
X. Yin, J. Han, and P. Yu. 2008. Truth discovery with multiple conficting information providers on the web. IEEE Trans. Knowl. Data Engin. 20, 6, 796--808.
[35]
C.-N. Ziegler and G. Lausen. 2004. Spreading activation models for trust propagation. In Proceedings of the IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04). IEEE Computer Society, 83--97.

Cited By

View all
  • (2023)Signed laplacian graph neural networksProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i4.25565(4444-4452)Online publication date: 7-Feb-2023
  • (2023)RSGNN: A Model-agnostic Approach for Enhancing the Robustness of Signed Graph Neural NetworksProceedings of the ACM Web Conference 202310.1145/3543507.3583221(60-70)Online publication date: 30-Apr-2023
  • (2023)Self-Supervised Signed Graph Attention Network for Social Recommendation2023 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN54540.2023.10191310(1-9)Online publication date: 18-Jun-2023
  • Show More Cited By

Index Terms

  1. Foundations of Trust and Distrust in Networks: Extended Structural Balance Theory

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on the Web
      ACM Transactions on the Web  Volume 8, Issue 3
      June 2014
      256 pages
      ISSN:1559-1131
      EISSN:1559-114X
      DOI:10.1145/2639948
      Issue’s Table of Contents
      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 the author(s) 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].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 08 July 2014
      Accepted: 01 March 2014
      Revised: 01 December 2013
      Received: 01 June 2013
      Published in TWEB Volume 8, Issue 3

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Trust
      2. distrust
      3. social networks
      4. structural balance

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)15
      • Downloads (Last 6 weeks)2
      Reflects downloads up to 04 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)Signed laplacian graph neural networksProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i4.25565(4444-4452)Online publication date: 7-Feb-2023
      • (2023)RSGNN: A Model-agnostic Approach for Enhancing the Robustness of Signed Graph Neural NetworksProceedings of the ACM Web Conference 202310.1145/3543507.3583221(60-70)Online publication date: 30-Apr-2023
      • (2023)Self-Supervised Signed Graph Attention Network for Social Recommendation2023 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN54540.2023.10191310(1-9)Online publication date: 18-Jun-2023
      • (2023)CESDAM: Centered subgraph data matrix for large graph representationPrinciples of Big Graph: In-depth Insight10.1016/bs.adcom.2021.09.005(1-38)Online publication date: 2023
      • (2022)Structural Balance Considerations for Networks with Preference Orders as Node Attributes2022 56th Asilomar Conference on Signals, Systems, and Computers10.1109/IEEECONF56349.2022.10051969(1255-1261)Online publication date: 31-Oct-2022
      • (2020)COLLABORATIVE METACOGNITIVE ACTIVITIES, STUDENTS’ SOCIALLY MOTIVATED METACOGNITIVE EXPERIENCES, AND STOICHIOMETRIC PROBLEM-SOLVINGHumanities & Social Sciences Reviews10.18510/hssr.2020.84288:4(267-276)Online publication date: 17-Jul-2020
      • (2020)Decoupled Variational Embedding for Signed Directed NetworksACM Transactions on the Web10.1145/340829815:1(1-31)Online publication date: 28-Oct-2020
      • (2018)Analyzing preferential attachment in peer-to-peer bitcoin networksProceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining10.5555/3382225.3382476(1242-1249)Online publication date: 28-Aug-2018
      • (2018)A Framework for Predicting Links Between Indirectly Interacting Nodes2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)10.1109/ASONAM.2018.8508767(544-551)Online publication date: Aug-2018
      • (2018)Analyzing Preferential Attachment in Peer-to-Peer BITCOIN Networks2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)10.1109/ASONAM.2018.8508273(1242-1249)Online publication date: Aug-2018
      • Show More Cited By

      View Options

      Get Access

      Login options

      Full Access

      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