arXiv research

Novel algorithm speeds up computation of Sobolev IPM for graph-based probability measures.

New algorithm improves graph-based active learning by identifying unexplored regions.

Generalizes Sobolev IPM for graph-based measures using Orlicz geometric structure.

As relational datasets modeled as graphs keep increasing in size and their data-acquisition is permeated by uncertainty, graph-based analysis techniques can become computationally and conceptually challenging. In particular, node centrality measures rely on the assumption that the graph is perfectly known -- a premise …

Few-shot graph classification on graphs with limited labeled examples.

End-to-end graph-based SSL learns all graph factors dynamically.

Repelling random walks improve graph-based sampling efficiency.

Paper detects changes in graph-based data streams using likelihood-ratios.

Proposes a new method for big portfolio selection using graph-based conditional moments.

We present a graph-based variational algorithm for multiclass classification of high-dimensional data, motivated by total variation techniques. The energy functional is based on a diffuse interface model with a periodic potential. We augment the model by introducing an alternative measure of smoothness that preserves s…

We present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall fl…

A new measure of dependence for various data types.

We consider the problem of recovering a function input of a differential equation formulated on an unknown domain $M$. We assume to have access to a discrete domain $M_n=\{x_1, \dots, x_n\} \subset M$, and to noisy measurements of the output solution at $p\le n$ of those points. We introduce a graph-based Bayesian inve…

Study graph-based algorithms for multi-manifold clustering with sufficient conditions.

Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…

Using data from 92 indices of stock exchanges worldwide, I analize the cluster formation and evolution from 2007 to 2010, which includes the Subprime Mortgage Crisis of 2008, using asset graphs based on distance thresholds. I also study the survivability of connections and of clusters through time and the influence of …

Classification of high dimensional data finds wide-ranging applications. In many of these applications equipping the resulting classification with a measure of uncertainty may be as important as the classification itself. In this paper we introduce, develop algorithms for, and investigate the properties of, a variety o…

A central problem in hyperspectral image classification is obtaining high classification accuracy when using a limited amount of labelled data. In this paper we present a novel graph-based framework, which aims to tackle this problem in the presence of large scale data input. Our approach utilises a novel superpixel me…

We present an approach to deep estimation of discrete conditional probability distributions. Such models have several applications, including generative modeling of audio, image, and video data. Our approach combines two main techniques: dyadic partitioning and graph-based smoothing of the discrete space. By recursivel…

Novel graph-spanning algorithm detects changes in high-dimensional data.

Assessing world-wide financial integration constitutes a recurrent challenge in macroeconometrics, often addressed by visual inspections searching for data patterns. Econophysics literature enables us to build complementary, data-driven measures of financial integration using graphs. The present contribution investigat…

We use self-report and electrodermal activity (EDA) wearable sensor data from 77 nights of sleep on six participants to test the efficacy of EDA data for sleep monitoring. We used factor analysis to find latent factors in the EDA data, and causal model search to find the most probable graphical model accounting for sel…

Graph-based multimodal federated learning for HAR improves accuracy and privacy.

Graph-based LRE estimates likelihood-ratios collaboratively for nodes.

Bayesian analysis shows unlabeled data improve graph-based semi-supervised learning.

By representing words with probability densities rather than point vectors, probabilistic word embeddings can capture rich and interpretable semantic information and uncertainty. The uncertainty information can be particularly meaningful in capturing entailment relationships -- whereby general words such as "entity" co…

Online change-point detection (OCPD) is important for application in various areas such as finance, biology, and the Internet of Things (IoT). However, OCPD faces major challenges due to high-dimensionality, and it is still rarely studied in literature. In this paper, we propose a novel, online, graph-based, change-poi…

New Karger-like algorithms solve graph cuts, useful for image segmentation.

PGRec improves recommendation by modeling user-item preferences as a graph and embedding it for better predictions.

Graph-based methods for anomaly detection and semi-supervised learning.

Improves graph-based active learning for non-Gaussian models.

Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors including like, comment, share etc. However, most of the existing methods still use single click behavior as the unique criterion of judging…

A graph-based method for two-sample testing across connected nodes.

Galerkin method outperforms graph-based methods in spectral decompositions.

Bayesian approach to robust risk measures under model uncertainty.

Survey of methods to incorporate external knowledge into stock price prediction.

This paper introduces a novel graph signal processing framework for building graph-based models from classes of filtered signals. In our framework, graph-based modeling is formulated as a graph system identification problem, where the goal is to learn a weighted graph (a graph Laplacian matrix) and a graph-based filter…

Graph-based weather prediction adapted for local models.

Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the incorporation of nonlinearity. However, most existing kernel-based graph learning mechanism…

Machine learning models for repeated measurements are limited. Using topological data analysis (TDA), we present a classifier for repeated measurements which samples from the data space and builds a network graph based on the data topology. When applying this to two case studies, accuracy exceeds alternative models wit…

Active graph-based semi-supervised learning (AG-SSL) aims to select a small set of labeled examples and utilize their graph-based relation to other unlabeled examples to aid in machine learning tasks. It is also closely related to the sampling theory in graph signal processing. In this paper, we revisit the original fo…

The paper explores geometry of probability measures and barycenter maps.

The paper extends graph-based semi-supervised learning to infinite-dimensional Wasserstein space.

The framework of this paper is that of risk measuring under uncertainty, which is when no reference probability measure is given. To every regular convex risk measure on ${\cal C}_b(Ω)$, we associate a unique equivalence class of probability measures on Borel sets, characterizing the riskless non positive elements of $…

Shapley Flow interprets model predictions using a graph-based approach to feature importance.

This paper detects function-level obfuscation in binary code using graph-based methods.

GATES improves neural architecture search by modeling operations as information transformation.

Improved graph-based semi-supervised learning with model change active learning.