Sage Journals: Discover world-class research

Abstract

Web Service diffusion is becoming an important way of Web information share. Because of the existence of large malicious nodes and Web services in online social network, the service diffusion in social network has got great trust crisis. It hinders the sharing and reusing of services in online social network. In order to improve the credibility and the speed of service diffusion in social network, we divide the nodes into common nodes and optimizational nodes by utilizing the trustworthy relationship among social network nodes. The algorithm is designed to find optimizational trustworthy nodes which have better trust values and better diffusion characteristics. Based on the optimizational trustworthy nodes, in the case of the trust, the diffusion speed and other factors, the trusted service diffusion is achieved by the algorithm. Therefore, the trustworthy services will be quickly diffused. The results of the experiments demonstrate that the diffusion model and our algorithm are correct and effective.

Keywords

Web service service diffusion online social network trustworthy nodes

Get full access to this article

View all access options for this article.

References

Wen

, Haghighi

S.M.

and Chen

, A sword with two edges: Propagation studies on both positive and negative information in online social networks, IEEE Transactions on Computers3 (2015), 640–653.

Pan

, Jin

, Wang

C.J.

and Xie

J.Y.

, Detecting link communities based on local information in social networks, ACTA Electronica Sinica11 (2012), 2255–2263.

, Xu

Z.M.

, Li

, Liu

and Wang

X.W.

, A survey on information diffusion in online social network, Chinese Journal of Computers1 (2014), 189–206.

Jiang

Y.C.

and Jiang

J.C.

, Diffusion in Social Networks: A Multiagent Perspective, IEEE Transactions on System Man Cybernetics Systems2 (2015), 198–213.

Narayanam

and Narahari

, A shapley value based approach to discover influential nodes in social network, IEEE Transactions on Automation Science and Engineering8(1) (2011), 130–147.

Nguyen

and Zheng

, On budgeted Influence maximization in social network, IEEE Journal on Selected Areas in Communications6 (2013), 1084–1094.

Fan

, Chen

and Du

, Geocommunity based broadcasting for data dissemination in mobile social network, IEEE Transactions on Parallel and Distributed Systems4 (2013), 734–743.

Guille

, Hacid

and Favre

, Information diffusion in online social networks: A survey, SIGMOD Record42(2) (2013), 17–28.

Manuel

G.R.

, Jureand

and Andreas

, Inferring networks of diffusion and influence, ACM Transactions on Knowledge Discovery from Data4 (2012), 1–37.

10.

Kimura

, Saito

, Akano

and Motoda

, Extracting influential nodes on a social network for information diffusion, Data Mining and Knowledge Discovery1 (2010), 70–97.

11.

Chen

, Wang

and Yang

, Efficient influence maximization in social network, Proc of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, 2009, pp. 199–208.

12.

, Sourav

S.B.

and Aixin

, Conformity-aware influence maximization in online social networks, VLDB Journal1 (2015), 117–141.

13.

Chou

Y.F.

, Huang

H.H.

and Cheng

R.G.

, Modeling information dissemination in generalized social network, IEEE Communications Letters7 (2013), 1356–1359.

14.

, Wang

and Yang

, LASS: Local activity and social-similarity based data forwarding in mobile social networks, IEEE Transactions on Parallel and Distributed Systems1 (2015), 174–184.

15.

Lou

and Tang

, Mining structural hole spanners through information diffusion in social networks, Proc of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil, 2013, pp. 825–836.

16.

Chen

, Shen

H.Y.

and Zhang

H.B.

, Leveraging social networks for P2P content-based file sharing in disconnected MANETs, IEEE Transactions on Mobile Computing2 (2014), 235–249.

17.

Zheng

P.Y.

, Chen

E.H.

and Huang

, Personalized requirements oriented trustworthy services recommendation based on social network, Journal on Communications2 (2013), 49–59.

18.

Gaeta

and Sereno

, Generalized, probabilistic flooding in unstructured peer-to-peer networks, IEEE Transactions on Parallel and Distributed Systems2 (2011), 2055–2062.

19.

Backstrom

and Leskovec

, Supervised random walks: Predicting and recommending links in social networks, Proc of the 4th ACM International Conference on Web Search and Data Mining, Hong Kong, China, 2011, pp. 635–644.

20.

Boutros

E.K.

, Bistra

and Le

, Scalable diffusion-aware optimization of network topology, Proc of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD), New York, USA, 2014, pp. 1226–1235.

21.

Swapnil

, Prabuchandran

K.J.

and Narahari

, A Multi-phase Approach for Improving Information Diffusion in Social Networks, Proc of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), İstanbul, Turkey, 2015, pp. 1787–1788.

22.

Embar

V.R.

, Pasumarthi

R.K.

and Bhattacharya

, A Bayesian Framework for Estimating Properties of Network Diffusions, Proc of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, USA, 2014, pp. 1216–1225.