Unsupervised Instance and Subnetwork Selection for Network Data

12/24/2022
by   Lin Zhang, et al.
0

Unlike tabular data, features in network data are interconnected within a domain-specific graph. Examples of this setting include gene expression overlaid on a protein interaction network (PPI) and user opinions in a social network. Network data is typically high-dimensional (large number of nodes) and often contains outlier snapshot instances and noise. In addition, it is often non-trivial and time-consuming to annotate instances with global labels (e.g., disease or normal). How can we jointly select discriminative subnetworks and representative instances for network data without supervision? We address these challenges within an unsupervised framework for joint subnetwork and instance selection in network data, called UISS, via a convex self-representation objective. Given an unlabeled network dataset, UISS identifies representative instances while ignoring outliers. It outperforms state-of-the-art baselines on both discriminative subnetwork selection and representative instance selection, achieving up to 10 evaluation. When employed for exploratory analysis in RNA-seq network samples from multiple studies it produces interpretable and informative summaries.

READ FULL TEXT

page 1

page 9

research
03/24/2019

DSL: Discriminative Subgraph Learning via Sparse Self-Representation

The goal in network state prediction (NSP) is to classify the global sta...
research
03/12/2020

A Multi-criteria Approach for Fast and Outlier-aware Representative Selection from Manifolds

The problem of representative selection amounts to sampling few informat...
research
09/12/2011

MIS-Boost: Multiple Instance Selection Boosting

In this paper, we present a new multiple instance learning (MIL) method,...
research
03/12/2023

AutoDenoise: Automatic Data Instance Denoising for Recommendations

Historical user-item interaction datasets are essential in training mode...
research
04/19/2023

Data as voters: instance selection using approval-based multi-winner voting

We present a novel approach to the instance selection problem in machine...
research
07/21/2023

On the Complexity of the Bipartite Polarization Problem: from Neutral to Highly Polarized Discussions

The Bipartite Polarization Problem is an optimization problem where the ...
research
04/17/2019

Posterior-regularized REINFORCE for Instance Selection in Distant Supervision

This paper provides a new way to improve the efficiency of the REINFORCE...

Please sign up or login with your details

Forgot password? Click here to reset