548 research outputs found
Human-Centric Cyber Social Computing Model for Hot-Event Detection and Propagation
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Microblogging networks have gained popularity in recent years as a platform enabling expressions of human emotions, through which users can conveniently produce contents on public events, breaking news, and/or products. Subsequently, microblogging networks generate massive amounts of data that carry opinions and mass sentiment on various topics. Herein, microblogging is regarded as a useful platform for detecting and propagating new hot events. It is also a useful channel for identifying high-quality posts, popular topics, key interests, and high-influence users. The existence of noisy data in the traditional social media data streams enforces to focus on human-centric computing. This paper proposes a human-centric social computing (HCSC) model for hot-event detection and propagation in microblogging networks. In the proposed HCSC model, all posts and users are preprocessed through hypertext induced topic search (HITS) for determining high-quality subsets of the users, topics, and posts. Then, a latent Dirichlet allocation (LDA)-based multiprototype user topic detection method is used for identifying users with high influence in the network. Furthermore, an influence maximization is used for final determination of influential users based on the user subsets. Finally, the users mined by influence maximization process are generated as the influential user sets for specific topics. Experimental results prove the superiority of our HCSC model against similar models of hot-event detection and information propagation
Finding influential spreaders from human activity beyond network location
Most centralities proposed for identifying influential spreaders on social
networks to either spread a message or to stop an epidemic require the full
topological information of the network on which spreading occurs. In practice,
however, collecting all connections between agents in social networks can be
hardly achieved. As a result, such metrics could be difficult to apply to real
social networks. Consequently, a new approach for identifying influential
people without the explicit network information is demanded in order to provide
an efficient immunization or spreading strategy, in a practical sense. In this
study, we seek a possible way for finding influential spreaders by using the
social mechanisms of how social connections are formed in real networks. We
find that a reliable immunization scheme can be achieved by asking people how
they interact with each other. From these surveys we find that the
probabilistic tendency to connect to a hub has the strongest predictive power
for influential spreaders among tested social mechanisms. Our observation also
suggests that people who connect different communities is more likely to be an
influential spreader when a network has a strong modular structure. Our finding
implies that not only the effect of network location but also the behavior of
individuals is important to design optimal immunization or spreading schemes
Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks
Identifying the most influential spreaders that maximize information flow is
a central question in network theory. Recently, a scalable method called
"Collective Influence (CI)" has been put forward through collective influence
maximization. In contrast to heuristic methods evaluating nodes' significance
separately, CI method inspects the collective influence of multiple spreaders.
Despite that CI applies to the influence maximization problem in percolation
model, it is still important to examine its efficacy in realistic information
spreading. Here, we examine real-world information flow in various social and
scientific platforms including American Physical Society, Facebook, Twitter and
LiveJournal. Since empirical data cannot be directly mapped to ideal
multi-source spreading, we leverage the behavioral patterns of users extracted
from data to construct "virtual" information spreading processes. Our results
demonstrate that the set of spreaders selected by CI can induce larger scale of
information propagation. Moreover, local measures as the number of connections
or citations are not necessarily the deterministic factors of nodes' importance
in realistic information spreading. This result has significance for rankings
scientists in scientific networks like the APS, where the commonly used number
of citations can be a poor indicator of the collective influence of authors in
the community.Comment: 11 pages, 4 figure
Theories for influencer identification in complex networks
In social and biological systems, the structural heterogeneity of interaction
networks gives rise to the emergence of a small set of influential nodes, or
influencers, in a series of dynamical processes. Although much smaller than the
entire network, these influencers were observed to be able to shape the
collective dynamics of large populations in different contexts. As such, the
successful identification of influencers should have profound implications in
various real-world spreading dynamics such as viral marketing, epidemic
outbreaks and cascading failure. In this chapter, we first summarize the
centrality-based approach in finding single influencers in complex networks,
and then discuss the more complicated problem of locating multiple influencers
from a collective point of view. Progress rooted in collective influence
theory, belief-propagation and computer science will be presented. Finally, we
present some applications of influencer identification in diverse real-world
systems, including online social platforms, scientific publication, brain
networks and socioeconomic systems.Comment: 24 pages, 6 figure
Network-based ranking in social systems: three challenges
Ranking algorithms are pervasive in our increasingly digitized societies,
with important real-world applications including recommender systems, search
engines, and influencer marketing practices. From a network science
perspective, network-based ranking algorithms solve fundamental problems
related to the identification of vital nodes for the stability and dynamics of
a complex system. Despite the ubiquitous and successful applications of these
algorithms, we argue that our understanding of their performance and their
applications to real-world problems face three fundamental challenges: (i)
Rankings might be biased by various factors; (2) their effectiveness might be
limited to specific problems; and (3) agents' decisions driven by rankings
might result in potentially vicious feedback mechanisms and unhealthy systemic
consequences. Methods rooted in network science and agent-based modeling can
help us to understand and overcome these challenges.Comment: Perspective article. 9 pages, 3 figure
Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks
Detecting spreading outbreaks in social networks with sensors is of great
significance in applications. Inspired by the formation mechanism of human's
physical sensations to external stimuli, we propose a new method to detect the
influence of spreading by constructing excitable sensor networks. Exploiting
the amplifying effect of excitable sensor networks, our method can better
detect small-scale spreading processes. At the same time, it can also
distinguish large-scale diffusion instances due to the self-inhibition effect
of excitable elements. Through simulations of diverse spreading dynamics on
typical real-world social networks (facebook, coauthor and email social
networks), we find that the excitable senor networks are capable of detecting
and ranking spreading processes in a much wider range of influence than other
commonly used sensor placement methods, such as random, targeted, acquaintance
and distance strategies. In addition, we validate the efficacy of our method
with diffusion data from a real-world online social system, Twitter. We find
that our method can detect more spreading topics in practice. Our approach
provides a new direction in spreading detection and should be useful for
designing effective detection methods
- …