An trust network model of E-business based on small-world

Trust network is a social network in E-businesses society. You can use the basic theory and methods of analyzing social network to study trust relational ship of E-business. A method of small-world network model is introduces to construct the trust network and analysis its performance for E-business. This kind of trust network model takes the local trust and global trust as the metrics of a trust relationship. In which the local trust degree can be obtained through the analysis of direct interaction history between nodes and the global trust degree can be calculated according to the solvability of fixed point theorem on the space. It gave a completed proof to the solvability of the theorem. On the basis of the thought, the path length associated with trust degree. And using the clustering coefficient and path length to build the small world trust network. The EM algorithm is used to optimize the operation of the small-world trust network model. The experiments show that it can construct the trust network for E-business and the small-world network model in E-business can be a good description of the main indirect relationship of trust. The construction algorithm has obvious advantages in time cost and accuracy.

[1]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Joseph A. Cazier,et al.  Sharing information and building trust through value congruence , 2007, Inf. Syst. Frontiers.

[3]  James A. Hendler,et al.  Inferring binary trust relationships in Web-based social networks , 2006, TOIT.

[4]  Hong Cheng,et al.  Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.

[5]  Paolo Avesani,et al.  Trust-aware recommender systems , 2007, RecSys '07.

[6]  Jennifer Golbeck,et al.  Inferring Trust Relationships in Web-Based Social Networks , 2006 .

[7]  Liang Huo.  A Novel Structured Overlay Network with Constant Degree and Small-World Features , 2010 .

[8]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Mehmet A. Orgun,et al.  Quality of trust for social trust path selection in complex social networks , 2010, AAMAS.

[10]  Hong-An Wang,et al.  A Novel Structured Overlay Network with Constant Degree and Small-World Features: A Novel Structured Overlay Network with Constant Degree and Small-World Features , 2010 .

[11]  Louiqa Raschid,et al.  ApproxRank: Estimating Rank for a Subgraph , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[12]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .