1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Network polarization, filter bubbles, and echo chambers: an annotated review of measures and reduction methods

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Polarization arises when the underlying network connecting the members of a community or society becomes characterized by highly connected groups with weak intergroup connectivity. The increasing polarization, the strengthening of echo chambers, and the isolation caused by information filters in social networks are increasingly attracting the attention of researchers from different areas of knowledge such as computer science, economics, and social and political sciences. This work presents an annotated review of network polarization measures and models used to handle the polarization. Several approaches for measuring polarization in graphs and networks were identified, including those based on homophily, modularity, random walks, and balance theory. The strategies used for reducing polarization include methods that propose edge or node editions (including insertions or deletions as well as edge weight modifications), changes in social network design, or changes in the recommendation systems embedded in these networks.

          Related collections

          Most cited references117

          • Record: found
          • Abstract: not found
          • Article: not found

          Fuzzy sets

          L.A. Zadeh (1965)
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Modularity and community structure in networks

            M. Newman (2006)
            Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as "modularity" over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              LIII.On lines and planes of closest fit to systems of points in space

                Bookmark

                Author and article information

                Contributors
                (View ORCID Profile)
                Journal
                International Transactions in Operational Research
                Int Trans Operational Res
                Wiley
                0969-6016
                1475-3995
                November 2023
                October 21 2022
                November 2023
                : 30
                : 6
                : 3122-3158
                Affiliations
                [1 ] Institute of Computing Universidade Federal Fluminense Niterói RJ 24210‐346 Brazil
                Article
                10.1111/itor.13224
                54304556-4fea-4448-b964-899647d1d666
                © 2023

                http://onlinelibrary.wiley.com/termsAndConditions#vor

                History

                Comments

                Comment on this article