nach oben

Cluster Computing

Erschienen in:

25.04.2017

Predicting edge sign and finding prestige of nodes in networks

verfasst von: Xiaoping Jiang, Chenghua Li, Hao Ding, Jing Sun

Erschienen in: Cluster Computing | Ausgabe 2/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Recently, as a result of the popularity of online social networks, the analysis and comparison of their contents are in an incremental need. The study of social network and social interaction including both positive and negative connections, which is obviously significant. Our finding denotes that the contacts in the basic social networks, including their accuracy, are predictable. The trust of numerous users’ imparting on a node accounts for the form of networks. In this paper, We propose a model in this article to figure out the prestige on nodes in a network based on trust. This network also lays more emphasis to on trustworthy nodes. In the beginning, to achieve this goal, we try to indicate signed advantages in networks to predict an user’s opinion to another. After that, we present an algorithm, which can compute the prestige and trustworthiness. In their edge weight, we can find out the trust score. According to our experiments on the public dataset, we demonstrate the validity and efficiency of our algorithm.

Vorheriger Artikel A fine-grained and lightweight data access control scheme for WSN-integrated cloud computing

Nächster Artikel Design of a recursive single-bin DFT algorithm for sparse spectrum analysis

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Ceren, B., Divyakant, A., Amr E.A.: Limiting the spread of misinformation in social networks. In: Proceeding of the WWW2011, pp. 665–674 (2011)

Liran, K., Edo, L., Oren, S.: Estimating sizes of social networks via biased sampling. In: Proceeding of the WWW2011, pp. 597–604 (2011)

Lin, W.Q,. Kong, X.N., Philip, S.Y.: Community detection in incomplete information networks. In: Proceeding of the WWW2012, pp. 341–350 (2012)

Pang, B., Lee, L.: Opinion mining and sentinment analysis. Found. Trends Inf. Retr. 2(1), 144–155 (2008)

Hughes, B.D.: Random Walks and Random Environments. Oxford University Press, Oxford (1996)MATH

Scott, J.: Social Nework Analysis. Sage, London (2000)

Hogg, T., Wilkinson, D., Szabo, G., Brzozowski, M.: Multiple relationship types in online communities and social networks. In: Proceeding of AAAI, pp. 556–565 (2008)

Yang, B., Cheung, W., Liu, J.: Community mining form signed social networks. Knowl. Data Eng. 19(10), 1333–1348 (2007)CrossRef

Kechove, C., Dooren, P.V.: The pagetrust algorithm: how to rank web pages when negative links are allowed? In: Proceeding of he SIAM, pp. 346–352 (2008)

10.

Koren, Y.: Factor in the neighbors: scalable and accurate collaborative filtering. ACM Trans. Knowl. Discov. Data 4(1), 1–24 (2009)MathSciNetCrossRef

11.

Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small -world’ networks. Nature 393(6684), 440–442 (1998)CrossRefMATH

12.

Kalna, G., Higham, D.J.: A clustering coefficient for weighted networks, with application to gene expression data. AI Commun. 20(4), 263–271 (2007)MathSciNetMATH

13.

Liben, N.D., Kleinberg, J.: The link prediction problem for social networks. In: Proceedings of International conference on Information and Knowledge Management, pp. 556–559 (2003)

14.

White, S., Smyth, P.: Algorithms for estimating relative importance in networks. In: Proceedings of International conference on Knowledge Discovery and Data Mining, pp. 266–275 (2003)

15.

Golub, G., Loan, C.F.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)MATH

16.

Kamvar, S.D., Schlosser, M.T., Molina, H.G.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of WWW2003, pp. 640–651 (2003)

17.

Kerchove, C., Dooren, P.V.: The pagetrust algorithm: how to rank web pages when negative links are allowed? In: Proceeding of SDM, pp. 346–352 (2008)

18.

Guha R.V., Kumar R., Raghavan P., Tomkins A.: Propagatin of trust and distrust. In: Proceeding of WWW2004, pp. 403–412 (2004)

19.

Kynch, R.M., Ledger, P.D.: Resolving the sign conflict problem for hp—hexahedral Nédélec elements with application to eddy current problems. Comput. Struct. 181, 41–54 (2016)CrossRef

20.

Khodadadi, A., Jalili, M.: Sign prediction in social networks based on tendency rate of equivalent micro-structures. Neurocomputing (2017)

21.

Zhang, L., Yang, L., Hu, G., et al.: Link prediction via sparse gaussian graphical model. Math. Probl. Eng. 2016(2), 1–11 (2016)MathSciNet

22.

Alshareef, A., Bakar, A.A., Hamdan, A.R, et al.: Pattern discovery algorithm for weather prediction problem. In: Science and Information Conference, pp. 572–577 (2015)

23.

Lee, K., Park, J., Baik, J.: Location-based web service QoS prediction via preference propagation for improving cold start problem. In: IEEE International Conference on Web Services. IEEE, pp. 177–184 (2015)

24.

Crowley, J.M., Tahirkheli, J., Iii, W.A.G.: Resolution of the band gap prediction problem for materials design. J. Phys. Chem. Lett. 7(7), 1198 (2016)CrossRef

Titel: Predicting edge sign and finding prestige of nodes in networks
verfasst von: Xiaoping Jiang
Chenghua Li
Hao Ding
Jing Sun
Publikationsdatum: 25.04.2017
Verlag: Springer US
Erschienen in: Cluster Computing / Ausgabe 2/2017
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI: https://doi.org/10.1007/s10586-017-0865-9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2017

The invariant measure and stationary probability density computing model based analysis of the governor system

SmallClient for big data: an indexing framework towards fast data retrieval

A collaborative resource management for big IoT data processing in Cloud

Adaptive filtering for intelligent sensing speech based on multi-rate LMS algorithm

A novel cloud scheduling algorithm optimization for energy consumption of data centres based on user QoS priori knowledge under the background of WSN and mobile communication

The energy emission computing of land consolidation from the dual perspectives clustering method