Skip to main content

2019 | OriginalPaper | Buchkapitel

10. Information Quality and Social Networks

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

search-config
loading …

Abstract

Decision-making requires accurate situation awareness by the decision-maker, be it a human or a computer. The goal of high-level fusion is to help achieve this by building situation representations. These situation representations are often in the form of graphs or networks, e.g. they consist of nodes, edges and attributes attached to the nodes or edges. In addition to these situation representation networks, there can also be computational networks in fusion systems. These networks represent the computations that are being performed by the fusion system. Yet another relation between networks and fusion is that today much information comes from sources that are inherently organised as a network. The first example of this that comes to mind is the use of information from social media in fusion processes. Social media are also networks, where the links are formed by follow/reading/friend relations. There can also be implicit links between information sources that come from other It is vital for the fusion process and the ensuing decision-making to ensure that we have accurate estimates of the quality of various kinds of information. The quality of an information element has several components, for instance, the degree to which we trust the source and the accuracy of the information. Note that the source could be a high-level processing system itself: a fusion node that processed information from, e.g. sensors, and outputs a result. In this case, the quality determination must take account also of the way that the fusion node processed the data. In this chapter, we describe how social network analysis can help with these problems. First, a brief introduction to social network analysis is given. We then discuss the problem of quality assessment and how social network analysis measures could be used to provide quantitative estimates of the reliability of a source, based on its earlier behaviour as well as that of other sources.

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!

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!

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!

Fußnoten
1
The simplest example to think of is \({\mathcal {Z}}^D_l\), where nodes are placed at integer coordinates and edges link nodes whose coordinates differ by ± 1 in exactly one dimension. Choose l = N 1∕D to get N nodes.
 
2
A tree is a connected graph without loops.
 
3
I.e. the probability that a node has a certain number of neighbours
 
Literatur
1.
Zurück zum Zitat D.L. Hall, J. Llinas (eds.), Handbook of Multisensor Data Fusion (CRC Press, Boca Raton, 2001) D.L. Hall, J. Llinas (eds.), Handbook of Multisensor Data Fusion (CRC Press, Boca Raton, 2001)
2.
Zurück zum Zitat B. Bollobás, Random Graphs (Academic, New York, 1985)MATH B. Bollobás, Random Graphs (Academic, New York, 1985)MATH
3.
Zurück zum Zitat B. Bollobás, Graph Theory: An Introductory Course (Springer, New York, 1979)CrossRef B. Bollobás, Graph Theory: An Introductory Course (Springer, New York, 1979)CrossRef
4.
Zurück zum Zitat S. Milgram, The small world problem. Psychol. Today 2, 60 (1967) S. Milgram, The small world problem. Psychol. Today 2, 60 (1967)
5.
Zurück zum Zitat C. Korte, S. Milgram, Acquaintance linking between white and negro populations: application of the small world problem. J. Pers. Soc. Psychol. 15, 101 (1970)CrossRef C. Korte, S. Milgram, Acquaintance linking between white and negro populations: application of the small world problem. J. Pers. Soc. Psychol. 15, 101 (1970)CrossRef
6.
Zurück zum Zitat P. Hoffman, The Man Who Loved Only Numbers (Hyperion, New York, 1998)MATH P. Hoffman, The Man Who Loved Only Numbers (Hyperion, New York, 1998)MATH
7.
Zurück zum Zitat V. Latora, M. Marchiori, Efficient behaviour of small-world networks. Phys. Rev. Lett. 87, 198701 (2001)CrossRef V. Latora, M. Marchiori, Efficient behaviour of small-world networks. Phys. Rev. Lett. 87, 198701 (2001)CrossRef
8.
Zurück zum Zitat A.-L. Barabási, E. Ravasz, Deterministic scale-free networks. eprint cond-mat/0107419 A.-L. Barabási, E. Ravasz, Deterministic scale-free networks. eprint cond-mat/0107419
10.
Zurück zum Zitat R. Albert, A.-L. Barabási, Statistical mechanics of complex networks. eprint cond-mat/0106096 R. Albert, A.-L. Barabási, Statistical mechanics of complex networks. eprint cond-mat/0106096
11.
Zurück zum Zitat P.L. Krapivsky, S. Redner, F. Leyvraz, Connectivity of growing random networks. Phys. Rev. Lett. 85(21), 4629 (2000) P.L. Krapivsky, S. Redner, F. Leyvraz, Connectivity of growing random networks. Phys. Rev. Lett. 85(21), 4629 (2000)
12.
Zurück zum Zitat M.E.J. Newman, Ego-centered networks and the ripple effect. eprint cond-mat/0111070 M.E.J. Newman, Ego-centered networks and the ripple effect. eprint cond-mat/0111070
13.
Zurück zum Zitat J. Leskovec, J. Kleinberg, C. Faloutsos, Graphs over time: densification laws, shrinking diameters and possible explanations, in Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago (2005), p. 177 J. Leskovec, J. Kleinberg, C. Faloutsos, Graphs over time: densification laws, shrinking diameters and possible explanations, in Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago (2005), p. 177
14.
Zurück zum Zitat J.P. Scott, Social Network Analysis: A Handbook, 2nd edn. (SAGE Publications, London, 2000) J.P. Scott, Social Network Analysis: A Handbook, 2nd edn. (SAGE Publications, London, 2000)
15.
Zurück zum Zitat S. Wasserman, K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, Cambridge, 1994)CrossRef S. Wasserman, K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, Cambridge, 1994)CrossRef
16.
Zurück zum Zitat P. Svenson, Complex networks and social network analysis in information fusion, in 2006 9th International Conference on Information Fusion, Florence (2006), pp. 1–7 P. Svenson, Complex networks and social network analysis in information fusion, in 2006 9th International Conference on Information Fusion, Florence (2006), pp. 1–7
18.
Zurück zum Zitat M.E.J. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)CrossRef M.E.J. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)CrossRef
19.
Zurück zum Zitat M.E.J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)CrossRef M.E.J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)CrossRef
20.
Zurück zum Zitat A. Clauset, Finding local community structure in networks. Phys. Rev. W 72, 026132 (2005) A. Clauset, Finding local community structure in networks. Phys. Rev. W 72, 026132 (2005)
21.
Zurück zum Zitat A. Clauset, M.E.J. Newman, C. Moore, Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)CrossRef A. Clauset, M.E.J. Newman, C. Moore, Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)CrossRef
22.
Zurück zum Zitat J. Dahlin, P. Svenson, Ensemble approaches for improving community detection (2013). Preprint arxiv:1309.0242 J. Dahlin, P. Svenson, Ensemble approaches for improving community detection (2013). Preprint arxiv:1309.0242
23.
Zurück zum Zitat J. Brynielsson, J. Hogberg, L. Kaati, C. Mårtenson, P. Svenson, Detecting social positions using simulation, in Proceedings 2010 International Conference on Advances in Social Networks Analysis and Mining, Odense (2010) J. Brynielsson, J. Hogberg, L. Kaati, C. Mårtenson, P. Svenson, Detecting social positions using simulation, in Proceedings 2010 International Conference on Advances in Social Networks Analysis and Mining, Odense (2010)
24.
Zurück zum Zitat J. Brynielsson, L. Kaati, P. Svenson, Social positions and simulation relations. Soc. Netw. Anal. Min. 2(1), 39–52 (2012)CrossRef J. Brynielsson, L. Kaati, P. Svenson, Social positions and simulation relations. Soc. Netw. Anal. Min. 2(1), 39–52 (2012)CrossRef
25.
Zurück zum Zitat M. Jändel, P. Svenson, R. Johansson, Fusing restricted information, in Proceedings of the 17th International Conference on Information Fusion, Salamanca (2014) M. Jändel, P. Svenson, R. Johansson, Fusing restricted information, in Proceedings of the 17th International Conference on Information Fusion, Salamanca (2014)
Metadaten
Titel
Information Quality and Social Networks
verfasst von
Pontus Svenson
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-03643-0_10