220,337 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
RED: Deep Recurrent Neural Networks for Sleep EEG Event Detection
The brain electrical activity presents several short events during sleep that
can be observed as distinctive micro-structures in the electroencephalogram
(EEG), such as sleep spindles and K-complexes. These events have been
associated with biological processes and neurological disorders, making them a
research topic in sleep medicine. However, manual detection limits their study
because it is time-consuming and affected by significant inter-expert
variability, motivating automatic approaches. We propose a deep learning
approach based on convolutional and recurrent neural networks for sleep EEG
event detection called Recurrent Event Detector (RED). RED uses one of two
input representations: a) the time-domain EEG signal, or b) a complex
spectrogram of the signal obtained with the Continuous Wavelet Transform (CWT).
Unlike previous approaches, a fixed time window is avoided and temporal context
is integrated to better emulate the visual criteria of experts. When evaluated
on the MASS dataset, our detectors outperform the state of the art in both
sleep spindle and K-complex detection with a mean F1-score of at least 80.9%
and 82.6%, respectively. Although the CWT-domain model obtained a similar
performance than its time-domain counterpart, the former allows in principle a
more interpretable input representation due to the use of a spectrogram. The
proposed approach is event-agnostic and can be used directly to detect other
types of sleep events.Comment: 8 pages, 5 figures. In proceedings of the 2020 International Joint
Conference on Neural Networks (IJCNN 2020
TOSNet : a topic-based optimal subnetwork identification in academic networks
Subnetwork identification plays a significant role in analyzing, managing, and comprehending the structure and functions in big networks. Numerous approaches have been proposed to solve the problem of subnetwork identification as well as community detection. Most of the methods focus on detecting communities by considering node attributes, edge information, or both. This study focuses on discovering subnetworks containing researchers with similar or related areas of interest or research topics. A topic- aware subnetwork identification is essential to discover potential researchers on particular research topics and provide qualitywork. Thus, we propose a topic-based optimal subnetwork identification approach (TOSNet). Based on some fundamental characteristics, this paper addresses the following problems: 1)How to discover topic-based subnetworks with a vigorous collaboration intensity? 2) How to rank the discovered subnetworks and single out one optimal subnetwork? We evaluate the performance of the proposed method against baseline methods by adopting the modularity measure, assess the accuracy based on the size of the identified subnetworks, and check the scalability for different sizes of benchmark networks. The experimental findings indicate that our approach shows excellent performance in identifying contextual subnetworks that maintain intensive collaboration amongst researchers for a particular research topic. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved
Topology Analysis of International Networks Based on Debates in the United Nations
In complex, high dimensional and unstructured data it is often difficult to
extract meaningful patterns. This is especially the case when dealing with
textual data. Recent studies in machine learning, information theory and
network science have developed several novel instruments to extract the
semantics of unstructured data, and harness it to build a network of relations.
Such approaches serve as an efficient tool for dimensionality reduction and
pattern detection. This paper applies semantic network science to extract
ideological proximity in the international arena, by focusing on the data from
General Debates in the UN General Assembly on the topics of high salience to
international community. UN General Debate corpus (UNGDC) covers all high-level
debates in the UN General Assembly from 1970 to 2014, covering all UN member
states. The research proceeds in three main steps. First, Latent Dirichlet
Allocation (LDA) is used to extract the topics of the UN speeches, and
therefore semantic information. Each country is then assigned a vector
specifying the exposure to each of the topics identified. This intermediate
output is then used in to construct a network of countries based on information
theoretical metrics where the links capture similar vectorial patterns in the
topic distributions. Topology of the networks is then analyzed through network
properties like density, path length and clustering. Finally, we identify
specific topological features of our networks using the map equation framework
to detect communities in our networks of countries
Making communities show respect for order
In this work we give a community detection algorithm in which the communities both respects the intrinsic order of a directed acyclic graph and also finds similar nodes. We take inspiration from classic similarity measures of bibliometrics, used to assess how similar two publications are, based on their relative citation patterns. We study the algorithm’s performance and antichain properties in artificial models and in real networks, such as citation graphs and food webs. We show how well this partitioning algorithm distinguishes and groups together nodes of the same origin (in a citation network, the origin is a topic or a research field). We make the comparison between our partitioning algorithm and standard hierarchical layering tools as well as community detection methods. We show that our algorithm produces different communities from standard layering algorithms
Followers Are Not Enough: A Question-Oriented Approach to Community Detection in Online Social Networks
Community detection in online social networks is typically based on the
analysis of the explicit connections between users, such as "friends" on
Facebook and "followers" on Twitter. But online users often have hundreds or
even thousands of such connections, and many of these connections do not
correspond to real friendships or more generally to accounts that users
interact with. We claim that community detection in online social networks
should be question-oriented and rely on additional information beyond the
simple structure of the network. The concept of 'community' is very general,
and different questions such as "whom do we interact with?" and "with whom do
we share similar interests?" can lead to the discovery of different social
groups. In this paper we focus on three types of communities beyond structural
communities: activity-based, topic-based, and interaction-based. We analyze a
Twitter dataset using three different weightings of the structural network
meant to highlight these three community types, and then infer the communities
associated with these weightings. We show that the communities obtained in the
three weighted cases are highly different from each other, and from the
communities obtained by considering only the unweighted structural network. Our
results confirm that asking a precise question is an unavoidable first step in
community detection in online social networks, and that different questions can
lead to different insights about the network under study.Comment: 22 pages, 4 figures, 1 table
POISED: Spotting Twitter Spam Off the Beaten Paths
Cybercriminals have found in online social networks a propitious medium to
spread spam and malicious content. Existing techniques for detecting spam
include predicting the trustworthiness of accounts and analyzing the content of
these messages. However, advanced attackers can still successfully evade these
defenses.
Online social networks bring people who have personal connections or share
common interests to form communities. In this paper, we first show that users
within a networked community share some topics of interest. Moreover, content
shared on these social network tend to propagate according to the interests of
people. Dissemination paths may emerge where some communities post similar
messages, based on the interests of those communities. Spam and other malicious
content, on the other hand, follow different spreading patterns.
In this paper, we follow this insight and present POISED, a system that
leverages the differences in propagation between benign and malicious messages
on social networks to identify spam and other unwanted content. We test our
system on a dataset of 1.3M tweets collected from 64K users, and we show that
our approach is effective in detecting malicious messages, reaching 91%
precision and 93% recall. We also show that POISED's detection is more
comprehensive than previous systems, by comparing it to three state-of-the-art
spam detection systems that have been proposed by the research community in the
past. POISED significantly outperforms each of these systems. Moreover, through
simulations, we show how POISED is effective in the early detection of spam
messages and how it is resilient against two well-known adversarial machine
learning attacks
- …