Papers
610.7K views | +42 today
Follow
Papers
Recent publications related to complex systems
Your new post is loading...
Your new post is loading...
Suggested by Fil Menczer
Scoop.it!

Political audience diversity and news reliability in algorithmic ranking

Political audience diversity and news reliability in algorithmic ranking | Papers | Scoop.it

Saumya Bhadani, Shun Yamaya, Alessandro Flammini, Filippo Menczer, Giovanni Luca Ciampaglia & Brendan Nyhan
Nature Human Behaviour (2022)

Newsfeed algorithms frequently amplify misinformation and other low-quality content. How can social media platforms more effectively promote reliable information? Existing approaches are difficult to scale and vulnerable to manipulation. In this paper, we propose using the political diversity of a website’s audience as a quality signal. Using news source reliability ratings from domain experts and web browsing data from a diverse sample of 6,890 US residents, we first show that websites with more extreme and less politically diverse audiences have lower journalistic standards. We then incorporate audience diversity into a standard collaborative filtering framework and show that our improved algorithm increases the trustworthiness of websites suggested to users—especially those who most frequently consume misinformation—while keeping recommendations relevant. These findings suggest that partisan audience diversity is a valuable signal of higher journalistic standards that should be incorporated into algorithmic ranking decisions. 

Read the full article at: www.nature.com

No comment yet.
Scooped by Complexity Digest
Scoop.it!

Introduction to the Special Issue on Information: Selected Papers from “FIS 2010 Beijing”

During the last two decades, a systematic re-examination of the whole information science field has taken place around the FIS—Foundations of Information Science—initiative. With the occasion of its Fourth Conference in Beijing 2010, a group of selected contributors and leading practitioners of those fields have been invited to contribute to this Special Issue. What is the status of information science today? What is the relationship between information and the laws of nature? Is information merely “physical”? What is the difference between information and computation? Has the genomic revolution changed the contemporary views on information and life? And what about the nature of social information? Cogent answers to these questions and to quite many others are attempted in the contributions that follow.

No comment yet.
Scooped by Complexity Digest
Scoop.it!

Experimental verification of Landauer/'s principle linking information and thermodynamics

Experimental verification of Landauer/'s principle linking information and thermodynamics | Papers | Scoop.it

In 1961, Rolf Landauer argued that the erasure of information is a dissipative process. A minimal quantity of heat, proportional to the thermal energy and called the Landauer bound, is necessarily produced when a classical bit of information is deleted. A direct consequence of this logically irreversible transformation is that the entropy of the environment increases by a finite amount. Despite its fundamental importance for information theory and computer science, the erasure principle has not been verified experimentally so far (…) This result demonstrates the intimate link between information theory and thermodynamics. It further highlights the ultimate physical limit of irreversible computation.

No comment yet.
Suggested by Joseph Lizier
Scoop.it!

Emergent Criticality through Adaptive Information Processing in Boolean Networks

Emergent Criticality through Adaptive Information Processing in Boolean Networks | Papers | Scoop.it

We study information processing in populations of Boolean networks with evolving connectivity and systematically explore the interplay between the learning capability, robustness, the network topology, and the task complexity. We solve a long-standing open question and find computationally that, for large system sizes N, adaptive information processing drives the networks to a critical connectivity Kc=2. For finite size networks, the connectivity approaches the critical value with a power law of the system size N. We show that network learning and generalization are optimized near criticality, given that the task complexity and the amount of information provided surpass threshold values. Both random and evolved networks exhibit maximal topological diversity near Kc. We hypothesize that this diversity supports efficient exploration and robustness of solutions. Also reflected in our observation is that the variance of the fitness values is maximal in critical network populations. Finally, we discuss implications of our results for determining the optimal topology of adaptive dynamical networks that solve computational tasks.

No comment yet.
Scooped by Complexity Digest
Scoop.it!

What Is Information?: Why Is It Relativistic and What Is Its Relationship to Materiality, Meaning and Organization

We review the historic development of concept of information including the relationship of Shannon information and entropy and the criticism of Shannon information because of its lack of a connection to meaning. We review the work of Kauffman, Logan et al. that shows that Shannon information fails to describe biotic information. We introduce the notion of the relativity of information and show that the concept of information depends on the context of where and how it is being used. We examine the relationship of information to meaning and materiality within information theory, cybernetics and systems biology. We show there exists a link between information and organization in biotic systems and in the various aspects of human culture including language, technology, science, economics and governance.

No comment yet.