Skip to main content

Information Quality and Social Networks

  • Chapter
  • First Online:
Information Quality in Information Fusion and Decision Making

Part of the book series: Information Fusion and Data Science ((IFDS))

  • 1242 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 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. 2.

    A tree is a connected graph without loops.

  3. 3.

    I.e. the probability that a node has a certain number of neighbours

References

  1. D.L. Hall, J. Llinas (eds.), Handbook of Multisensor Data Fusion (CRC Press, Boca Raton, 2001)

    Google Scholar 

  2. B. Bollobás, Random Graphs (Academic, New York, 1985)

    MATH  Google Scholar 

  3. B. Bollobás, Graph Theory: An Introductory Course (Springer, New York, 1979)

    Book  Google Scholar 

  4. S. Milgram, The small world problem. Psychol. Today 2, 60 (1967)

    Google Scholar 

  5. C. Korte, S. Milgram, Acquaintance linking between white and negro populations: application of the small world problem. J. Pers. Soc. Psychol. 15, 101 (1970)

    Article  Google Scholar 

  6. P. Hoffman, The Man Who Loved Only Numbers (Hyperion, New York, 1998)

    MATH  Google Scholar 

  7. V. Latora, M. Marchiori, Efficient behaviour of small-world networks. Phys. Rev. Lett. 87, 198701 (2001)

    Article  Google Scholar 

  8. A.-L. Barabási, E. Ravasz, Deterministic scale-free networks. eprint cond-mat/0107419

    Google Scholar 

  9. A. L. Barabási, R. Albert, Emergence of scaling in random networks. Science 286, 509 (1999)

    Article  MathSciNet  Google Scholar 

  10. R. Albert, A.-L. Barabási, Statistical mechanics of complex networks. eprint cond-mat/0106096

    Google Scholar 

  11. P.L. Krapivsky, S. Redner, F. Leyvraz, Connectivity of growing random networks. Phys. Rev. Lett. 85(21), 4629 (2000)

    Google Scholar 

  12. M.E.J. Newman, Ego-centered networks and the ripple effect. eprint cond-mat/0111070

    Google Scholar 

  13. 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

    Google Scholar 

  14. J.P. Scott, Social Network Analysis: A Handbook, 2nd edn. (SAGE Publications, London, 2000)

    Google Scholar 

  15. S. Wasserman, K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, Cambridge, 1994)

    Book  Google Scholar 

  16. P. Svenson, Complex networks and social network analysis in information fusion, in 2006 9th International Conference on Information Fusion, Florence (2006), pp. 1–7

    Google Scholar 

  17. L. da F. Costa, F.A. Rodrigues, G. Travieso, P.R. Villas Boas, Characterization of complex networks: a survey of measurements (2005). eprint cond-mat/0505185. http://www.arxiv.org/abs/cond-mat/0505185

  18. M.E.J. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)

    Article  Google Scholar 

  19. M.E.J. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)

    Article  Google Scholar 

  20. A. Clauset, Finding local community structure in networks. Phys. Rev. W 72, 026132 (2005)

    Google Scholar 

  21. A. Clauset, M.E.J. Newman, C. Moore, Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)

    Article  Google Scholar 

  22. J. Dahlin, P. Svenson, Ensemble approaches for improving community detection (2013). Preprint arxiv:1309.0242

    Google Scholar 

  23. 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)

    Google Scholar 

  24. J. Brynielsson, L. Kaati, P. Svenson, Social positions and simulation relations. Soc. Netw. Anal. Min. 2(1), 39–52 (2012)

    Article  Google Scholar 

  25. M. Jändel, P. Svenson, R. Johansson, Fusing restricted information, in Proceedings of the 17th International Conference on Information Fusion, Salamanca (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pontus Svenson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Svenson, P. (2019). Information Quality and Social Networks. In: Bossé, É., Rogova, G. (eds) Information Quality in Information Fusion and Decision Making. Information Fusion and Data Science. Springer, Cham. https://doi.org/10.1007/978-3-030-03643-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03643-0_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03642-3

  • Online ISBN: 978-3-030-03643-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics