Abstract
Knots of trust are groups of community members having overall “strong” trust relations between them. In previous work we introduced the knot aware trust based reputation model. According to this model, in order to provide a member with reputation information relative to her viewpoint, the system must identify the knot to which that member belongs and interpret its reputation data correctly. In the current paper we present the problem of identifying knots which is modeled as a graph clustering problem, where vertices correspond to individuals and edges describe trust relationships between them. We propose a new perspective for clustering that reflects the subjective idea of trust and the nature of the community. A class of weight functions is suggested for assigning edge weights and their impact on the stability and strength of knots is demonstrated. Finally we show the efficiency of knots of high quality for providing their members with relevant reputation information.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
eBay, http://www.ebay.com/
Experts-exchange, http://www.experts-exchange.com/
Grouplens, http://www.grouplens.org/
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. Journal of the ACM (JACM) 55(5), 1–27 (2008)
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 238–247. IEEE Computer Society, Washington, DC, USA (2002)
Chakraborty, S., Ray, I.: Trustbac: integrating trust relationships into the rbac model for access control in open systems. In: Proceedings of the 11th ACM Symposium on Access Control Models and Technologies (SACMAT 2006), pp. 49–58. ACM, New York (2006)
Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360–383 (2005)
Cohen, W.W., Richman, J.: Learning to match and cluster large high-dimensional data sets for data integration. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 475–480 (2002)
Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoretical Computer Science 361(2-3), 172–187 (2006), Special issue on approximation and online algorithms
Edachery, J., Sen, A., Brandenburg, F.J.: Graph clustering using distance-k cliques. Graph Drawing, 98–106 (1999)
Elsner, M., Schudy, W.: Bounding and comparing methods for correlation clustering beyond ilp. In: NAACL-HLT Workshop on Integer Linear Programming for Natural Language Processing (ILPNLP 2009), pp. 19–27 (2009)
Gal-Oz, N., Gudes, E., Hendler, D.: A robust and knot-aware trust-based reputation model. In: Proceedings of the 2nd Joint iTrust and PST Conferences on Privacy, Trust Management and Security (IFIPTM 2008), Trondheim, Norway, pp. 167–182 (June 2008)
Gionis, A., Mannila, H., Tsaparas, P.: Clustering aggregation. ACM Transactions on Knowledge Discovery from Data (TKDD) 1(1), 4 (2007)
Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: Proceedings of the 13th International Conference on World Wide Web (WWW 2004), pp. 403–412. ACM, New York (2004)
Jøsang, A., Gray, E., Kinateder, M.: Analysing topologies of transitive trust. In: Proceedings of the 1st International Workshop on Formal Aspects in Security and Trust (FAST 2003), pp. 9–22 (2003)
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th International Conference on World Wide Web (WWW 2003), pp. 640–651. ACM, New York (2003)
Kinateder, M., Baschny, E., Rothermel, K.: Towards a generic trust model – comparison of various trust update algorithms. In: Herrmann, P., Issarny, V., Shiu, S.C.K. (eds.) iTrust 2005. LNCS, vol. 3477, pp. 177–192. Springer, Heidelberg (2005)
Massa, P., Avesani, P.: Avesani. Controversial users demand local trust metrics: An experimental study on epinions. com community. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 2005), vol. 20, p. 121 (2005)
Matthews, B.W.: Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochimica et Biophysica Acta (BBA)-Protein Structure 405(2), 442–451 (1975)
Meilă, M.: Comparing clusterings–an information based distance. Journal of Multivariate Analysis 98(5), 873–895 (2007)
Ng, V., Gardent, C.: Improving machine learning approaches to coreference resolution. In: ACL, pp. 104–111 (2002)
Soon, W.M., Ng, H.T., Lim, D.C.Y.: A machine learning approach to coreference resolution of noun phrases. Computational Linguistics 27(4), 521–544 (2001)
Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 526–527. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Ward, J.H., Hook, M.E.: Application of an Hierarchical Grouping Procedure to a Problem of Grouping Profiles, vol. 23(1), pp. 69–82 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 International Federation for Information Processing
About this paper
Cite this paper
Gal-Oz, N., Yahalom, R., Gudes, E. (2011). Identifying Knots of Trust in Virtual Communities. In: Wakeman, I., Gudes, E., Jensen, C.D., Crampton, J. (eds) Trust Management V. IFIPTM 2011. IFIP Advances in Information and Communication Technology, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22200-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-22200-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22199-6
Online ISBN: 978-3-642-22200-9
eBook Packages: Computer ScienceComputer Science (R0)