NetReAct: Interactive Learning for Network Summarization
- URL: http://arxiv.org/abs/2012.11821v1
- Date: Tue, 22 Dec 2020 03:56:26 GMT
- Title: NetReAct: Interactive Learning for Network Summarization
- Authors: Sorour E. Amiri, Bijaya Adhikari, John Wenskovitch, Alexander
Rodriguez, Michelle Dowling, Chris North, and B. Aditya Prakash
- Abstract summary: We present NetReAct, a novel interactive network summarization algorithm which supports the visualization of networks induced by text corpora to perform sensemaking.
We show how NetReAct is successful in generating high-quality summaries and visualizations that reveal hidden patterns better than other non-trivial baselines.
- Score: 60.18513812680714
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Generating useful network summaries is a challenging and important problem
with several applications like sensemaking, visualization, and compression.
However, most of the current work in this space do not take human feedback into
account while generating summaries. Consider an intelligence analysis scenario,
where the analyst is exploring a similarity network between documents. The
analyst can express her agreement/disagreement with the visualization of the
network summary via iterative feedback, e.g. closing or moving documents
("nodes") together. How can we use this feedback to improve the network summary
quality? In this paper, we present NetReAct, a novel interactive network
summarization algorithm which supports the visualization of networks induced by
text corpora to perform sensemaking. NetReAct incorporates human feedback with
reinforcement learning to summarize and visualize document networks. Using
scenarios from two datasets, we show how NetReAct is successful in generating
high-quality summaries and visualizations that reveal hidden patterns better
than other non-trivial baselines.
Related papers
- Designing Deep Networks for Scene Recognition [3.493180651702109]
We conduct extensive experiments to demonstrate the widely accepted principles in network design may result in dramatic performance differences when the data is altered.
This paper presents a novel network design methodology: data-oriented network design.
We propose a Deep-Narrow Network and Dilated Pooling module, which improved the scene recognition performance using less than half of the computational resources.
arXiv Detail & Related papers (2023-03-13T18:28:06Z) - TeKo: Text-Rich Graph Neural Networks with External Knowledge [75.91477450060808]
We propose a novel text-rich graph neural network with external knowledge (TeKo)
We first present a flexible heterogeneous semantic network that incorporates high-quality entities.
We then introduce two types of external knowledge, that is, structured triplets and unstructured entity description.
arXiv Detail & Related papers (2022-06-15T02:33:10Z) - ADMM-DAD net: a deep unfolding network for analysis compressed sensing [20.88999913266683]
We propose a new deep unfolding neural network based on the ADMM algorithm for analysis Compressed Sensing.
The proposed network jointly learns a redundant analysis operator for sparsification and reconstructs the signal of interest.
arXiv Detail & Related papers (2021-10-13T18:56:59Z) - Network representation learning systematic review: ancestors and current
development state [1.0312968200748116]
We present a systematic survey of network representation learning, known as network embedding, from birth to the current development state.
We provide also formal definitions of basic concepts required to understand network representation learning.
Most commonly used downstream tasks to evaluate embeddings, their evaluation metrics and popular datasets are highlighted.
arXiv Detail & Related papers (2021-09-14T14:44:44Z) - Temporal Graph Network Embedding with Causal Anonymous Walks
Representations [54.05212871508062]
We propose a novel approach for dynamic network representation learning based on Temporal Graph Network.
For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings.
We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
arXiv Detail & Related papers (2021-08-19T15:39:52Z) - Discovering "Semantics" in Super-Resolution Networks [54.45509260681529]
Super-resolution (SR) is a fundamental and representative task of low-level vision area.
It is generally thought that the features extracted from the SR network have no specific semantic information.
Can we find any "semantics" in SR networks?
arXiv Detail & Related papers (2021-08-01T09:12:44Z) - Graph-Based Neural Network Models with Multiple Self-Supervised
Auxiliary Tasks [79.28094304325116]
Graph Convolutional Networks are among the most promising approaches for capturing relationships among structured data points.
We propose three novel self-supervised auxiliary tasks to train graph-based neural network models in a multi-task fashion.
arXiv Detail & Related papers (2020-11-14T11:09:51Z) - Understanding the Role of Individual Units in a Deep Neural Network [85.23117441162772]
We present an analytic framework to systematically identify hidden units within image classification and image generation networks.
First, we analyze a convolutional neural network (CNN) trained on scene classification and discover units that match a diverse set of object concepts.
Second, we use a similar analytic method to analyze a generative adversarial network (GAN) model trained to generate scenes.
arXiv Detail & Related papers (2020-09-10T17:59:10Z) - Big Networks: A Survey [12.9583587501745]
This paper introduces a new network science concept called big network.
Big networks are generally in large-scale with a complicated and higher-order inner structure.
We first introduce the structural characteristics of big networks from three levels, which are micro-level, meso-level, and macro-level.
We then discuss some state-of-the-art advanced topics of big network analysis.
arXiv Detail & Related papers (2020-08-09T03:40:20Z) - Temporal Network Representation Learning via Historical Neighborhoods
Aggregation [28.397309507168128]
We propose the Embedding via Historical Neighborhoods Aggregation (EHNA) algorithm.
We first propose a temporal random walk that can identify relevant nodes in historical neighborhoods.
Then we apply a deep learning model which uses a custom attention mechanism to induce node embeddings.
arXiv Detail & Related papers (2020-03-30T04:18:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.