Strong Social Component-Aware Trust Sub-network Extraction in Contextual Social Networks

In Online Social Networks (OSNs), the important participants, the trust relations between participants, and the interaction contexts between participants greatly impact a participant's decision-making in many applications, such as service provider selection and crowdsourcing service invocation. However, predicting the trust between two unknown participants based on the whole large-scale social network can lead to very high computation costs. Thus, prior to trust prediction, extracting a small-scale sub-network containing the important participants and the corresponding contextual information with a high density could make the trust prediction more efficient and effective. However, extracting such a sub-network has been proved to be an NP-Complete problem. To address this challenging problem, we propose a strong social component-aware trust sub-network extraction model, So-BiNet, to search for near-optimal solutions effectively and efficiently. Our method can extract a trust sub-network without any decompression, which can in turn greatly save the search time of trust sub-network extraction. The experiments, conducted on four social network datasets, demonstrate that our approach can efficiently extract sub-networks covering important participants and contextual information while keeping a high density. Our approach is superior to the state-of-the-art approaches in terms of the quality of the sub-networks extracted within the same execution time.

[1]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[2]  Mehmet A. Orgun,et al.  Trust Transitivity in Complex Social Networks , 2011, AAAI.

[3]  Mehmet A. Orgun,et al.  BiNet: Trust Sub-network Extraction Using Binary Ant Colony Algorithm in Contextual Social Networks , 2015, 2015 IEEE International Conference on Web Services.

[4]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[5]  Leonie Moench Computer Algorithms Introduction To Design And Analysis , 2016 .

[6]  Xin Wang,et al.  Answering graph pattern queries using views , 2006, 2014 IEEE 30th International Conference on Data Engineering.

[7]  Sai Liu,et al.  A Robust Collaborative Filtering Recommendation Algorithm Based on Multidimensional Trust Model , 2013, J. Softw..

[8]  Xiuzhen Zhang,et al.  Efficient Contextual Transaction Trust Computation in E-commerce Environments , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

[9]  Arthur Jones,et al.  Trust and Crime in Information Societies , 2006 .

[10]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[11]  P. Berger,et al.  The Social Construction of Reality , 1966 .

[12]  Mehmet A. Orgun,et al.  Social Context-Aware Trust Network Discovery in Complex Contextual Social Networks , 2012, AAAI.

[13]  Brian Randell,et al.  Dependable pervasive systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[14]  Lei Li,et al.  Social context-aware trust inference for trust enhancement in social network based recommendations on service providers , 2013, World Wide Web.

[15]  Mehmet A. Orgun,et al.  Optimal Social Trust Path Selection in Complex Social Networks , 2010, AAAI.

[16]  Mehmet A. Orgun,et al.  Discovering Trust Networks for the Selection of Trustworthy Service Providers in Complex Contextual Social Networks , 2012, 2012 IEEE 19th International Conference on Web Services.

[17]  Onur Kara Peter L. Berger and Thomas Luckmann, The Social Construction of Reality: A Treatise in the Sociology of Knowledge , 2010 .

[18]  Hannu Toivonen,et al.  Fast Discovery of Reliable Subnetworks , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[19]  Vijay Varadharajan,et al.  Role-based Recommendation and Trust Evaluation , 2007, The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007).

[20]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[21]  Cécile Paris,et al.  A survey of trust in social networks , 2013, CSUR.

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

[23]  Sharon S. Brehm,et al.  Intimate relationships, 2nd ed. , 1992 .

[24]  Jiawei Han,et al.  Mining advisor-advisee relationships from research publication networks , 2010, KDD.

[25]  Mehmet A. Orgun,et al.  Trust Prediction with Propagation and Similarity Regularization , 2014, AAAI.

[26]  Feiping Nie,et al.  Social Trust Prediction Using Rank-k Matrix Recovery , 2013, IJCAI.

[27]  Jennifer Golbeck,et al.  SUNNY: A New Algorithm for Trust Inference in Social Networks Using Probabilistic Confidence Models , 2007, AAAI.

[28]  Lei Li,et al.  Trust-Oriented Composite Service Selection and Discovery , 2009, ICSOC/ServiceWave.

[29]  Bruce Christianson,et al.  Why Isn't Trust Transitive? , 1996, Security Protocols Workshop.

[30]  Mehmet A. Orgun,et al.  Finding the Optimal Social Trust Path for the Selection of Trustworthy Service Providers in Complex Social Networks , 2013, IEEE Transactions on Services Computing.