426 research outputs found
Adversarial Attack and Defense on Graph Data: A Survey
Deep neural networks (DNNs) have been widely applied to various applications
including image classification, text generation, audio recognition, and graph
data analysis. However, recent studies have shown that DNNs are vulnerable to
adversarial attacks. Though there are several works studying adversarial attack
and defense strategies on domains such as images and natural language
processing, it is still difficult to directly transfer the learned knowledge to
graph structure data due to its representation challenges. Given the importance
of graph analysis, an increasing number of works start to analyze the
robustness of machine learning models on graph data. Nevertheless, current
studies considering adversarial behaviors on graph data usually focus on
specific types of attacks with certain assumptions. In addition, each work
proposes its own mathematical formulation which makes the comparison among
different methods difficult. Therefore, in this paper, we aim to survey
existing adversarial learning strategies on graph data and first provide a
unified formulation for adversarial learning on graph data which covers most
adversarial learning studies on graph. Moreover, we also compare different
attacks and defenses on graph data and discuss their corresponding
contributions and limitations. In this work, we systemically organize the
considered works based on the features of each topic. This survey not only
serves as a reference for the research community, but also brings a clear image
researchers outside this research domain. Besides, we also create an online
resource and keep updating the relevant papers during the last two years. More
details of the comparisons of various studies based on this survey are
open-sourced at
https://github.com/YingtongDou/graph-adversarial-learning-literature.Comment: In submission to Journal. For more open-source and up-to-date
information, please check our Github repository:
https://github.com/YingtongDou/graph-adversarial-learning-literatur
Semi-supervised Embedding in Attributed Networks with Outliers
In this paper, we propose a novel framework, called Semi-supervised Embedding
in Attributed Networks with Outliers (SEANO), to learn a low-dimensional vector
representation that systematically captures the topological proximity,
attribute affinity and label similarity of vertices in a partially labeled
attributed network (PLAN). Our method is designed to work in both transductive
and inductive settings while explicitly alleviating noise effects from
outliers. Experimental results on various datasets drawn from the web, text and
image domains demonstrate the advantages of SEANO over state-of-the-art methods
in semi-supervised classification under transductive as well as inductive
settings. We also show that a subset of parameters in SEANO is interpretable as
outlier score and can significantly outperform baseline methods when applied
for detecting network outliers. Finally, we present the use of SEANO in a
challenging real-world setting -- flood mapping of satellite images and show
that it is able to outperform modern remote sensing algorithms for this task.Comment: in Proceedings of SIAM International Conference on Data Mining
(SDM'18
Multiple-view flexible semi-supervised classification through consistent graph construction and label propagation
Graph construction plays an essential role in graph-based label propagation since graphs give some information on the structure of the data manifold. While most graph construction methods rely on predefined distance calculation, recent algorithms merge the task of label propagation and graph construction in a single process. Moreover, the use of several descriptors is proved to outperform a single descriptor in representing the relation between the nodes. In this article, we propose a Multiple-View Consistent Graph construction and Label propagation algorithm (MVCGL) that simultaneously constructs a consistent graph based on several descriptors and performs label propagation over unlabeled samples. Furthermore, it provides a mapping function from the feature space to the label space with which we estimate the label of unseen samples via a linear projection. The constructed graph does not rely on a predefined similarity function and exploits data and label smoothness. Experiments conducted on three face and one handwritten digit databases show that the proposed method can gain better performance compared to other graph construction and label propagation methods.This work was partially funded by the Spanish Ministerio de
Ciencia, Innovación y Universidades, Spain, Programa Estatal de
I+D+i Orientada a los Retos de la Sociedad, RTI2018-101045-B-
C21, and the University of the Basque Country, GIU19/02
Deep Co-Space: Sample Mining Across Feature Transformation for Semi-Supervised Learning
Aiming at improving performance of visual classification in a cost-effective
manner, this paper proposes an incremental semi-supervised learning paradigm
called Deep Co-Space (DCS). Unlike many conventional semi-supervised learning
methods usually performing within a fixed feature space, our DCS gradually
propagates information from labeled samples to unlabeled ones along with deep
feature learning. We regard deep feature learning as a series of steps pursuing
feature transformation, i.e., projecting the samples from a previous space into
a new one, which tends to select the reliable unlabeled samples with respect to
this setting. Specifically, for each unlabeled image instance, we measure its
reliability by calculating the category variations of feature transformation
from two different neighborhood variation perspectives, and merged them into an
unified sample mining criterion deriving from Hellinger distance. Then, those
samples keeping stable correlation to their neighboring samples (i.e., having
small category variation in distribution) across the successive feature space
transformation, are automatically received labels and incorporated into the
model for incrementally training in terms of classification. Our extensive
experiments on standard image classification benchmarks (e.g., Caltech-256 and
SUN-397) demonstrate that the proposed framework is capable of effectively
mining from large-scale unlabeled images, which boosts image classification
performance and achieves promising results compared to other semi-supervised
learning methods.Comment: To appear in IEEE Transactions on Circuits and Systems for Video
Technology (T-CSVT), 201
- …