Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for graph visualization

We present GraphTSNE, a novel visualization technique for graph-structured data based on t-SNE. The growing interest in graph-structured data increases the importance of gaining human insight into such datasets by means of visualization. Among the most popular visualization techniques, classical t-SNE is not suitable o…

2019-04-15abs ↗pdf ↗

Croke and Kleiner constructed two homeomorphic locally CAT(0) complexes whose universal covers have visual boundaries that are not homeomorphic. We construct two homeomorphic locally CAT(0) complexes so that the visual boundary of one universal cover contains a nonplanar graph, while the visual boundary of the other do…

2018-07-06abs ↗pdf ↗

This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…

2015-02-02abs ↗pdf ↗

Visual relationship detection can bridge the gap between computer vision and natural language for scene understanding of images. Different from pure object recognition tasks, the relation triplets of subject-predicate-object lie on an extreme diversity space, such as \textit{person-behind-person} and \textit{car-behind…

2018-09-11abs ↗pdf ↗

Different layouts can characterize different aspects of the same graph. Finding a "good" layout of a graph is thus an important task for graph visualization. In practice, users often visualize a graph in multiple layouts by using different methods and varying parameter settings until they find a layout that best suits …

2019-04-27abs ↗pdf ↗

GraphQ system uses GNNs to search for subgraph patterns in graphs.

problem Efficiently identifying and matching subgraph patterns in graph data.
method Graph neural networks (GNNs) for encoding graph data and NeuroAlign for node alignment.
result NeuroAlign improves node-alignment accuracy by 19-29% compared to baseline GNNs.

Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates two graph embedding appro…

2014-01-17abs ↗pdf ↗

MXGNet tackles visual reasoning tasks using graph neural networks.

problem Abstract reasoning, especially in the visual domain, is challenging for AI.
method Combines object-level representations, graph neural networks, and multiplex graphs.
result Achieves state-of-the-art accuracy on Euler Diagram Syllogisms and outperforms state-of-the-art models on RPM datasets.

A novel method for visual question answering using scene graphs and reinforcement learning.

problem Answering free-form questions about images with deep linguistic and visual understanding.
method Context-driven, sequential reasoning based on scene graphs and reinforcement learning.
result Our method almost reaches human performance on the GQA dataset.

GraphShield uses dynamic graph learning to detect and visualize financial risks.

problem Detecting and mitigating risks in financial networks.
method Enhanced Cross-Domain Information Learning, Advanced Risk Recognition, Risk Propagation Visualization.
result GraphShield effectively identifies and visualizes hidden financial risks.

Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates a graph embedding approac…

2013-02-04abs ↗pdf ↗

We present ShapeVis, a scalable visualization technique for point cloud data inspired from topological data analysis. Our method captures the underlying geometric and topological structure of the data in a compressed graphical representation. Much success has been reported by the data visualization technique Mapper, th…

2020-01-15abs ↗pdf ↗

We introduce a nonlinear method for directly embedding large, sparse, stochastic graphs into low-dimensional spaces, without requiring vertex features to reside in, or be transformed into, a metric space. Graph data and models are prevalent in real-world applications. Direct graph embedding is fundamental to many graph…

2019-06-13abs ↗pdf ↗

Diestel-Leader graphs are neither hyperbolic nor CAT(0), so their visual boundaries may be pathological. Indeed, we show that for d>2d>2, DLd(q)\partial\text{DL}_d(q) carries the indiscrete topology. On the other hand, DL2(q)\partial\text{DL}_2(q), while not Hausdorff, is T1T_1, totally disconnected, and compact. Since $\text{D…

2013-07-08abs ↗pdf ↗

Recent advances in graph convolutional networks have significantly improved the performance of chemical predictions, raising a new research question: "how do we explain the predictions of graph convolutional networks?" A possible approach to answer this question is to visualize evidence substructures responsible for th…

2018-07-04abs ↗pdf ↗

In a real-world setting, visual recognition systems can be brought to make predictions for images belonging to previously unknown class labels. In order to make semantically meaningful predictions for such inputs, we propose a two-step approach that utilizes information from knowledge graphs. First, a knowledge-graph r…

2017-08-28abs ↗pdf ↗

This work proves the continuum limit of t-SNE for data visualization.

problem Understanding the theoretical basis of t-SNE from a continuum limit perspective.
method Proving the Kullback-Leibler divergence consistency as non o \infty for t-SNE.
result The continuum variational problem involving non-convex gradient regularization and penalty on probability density function magnitude.

In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial crisis of 2008 whereby investors chose to trade asset-backed secur…

2019-02-06abs ↗pdf ↗

We introduce the isoperimetric loss as a regularization criterion for learning the map from a visual representation to a semantic embedding, to be used to transfer knowledge to unknown classes in a zero-shot learning setting. We use a pre-trained deep neural network model as a visual representation of image data, a Wor…

2019-03-15abs ↗pdf ↗

We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …

2010-07-06abs ↗pdf ↗

We introduce GraSPy, a Python library devoted to statistical inference, machine learning, and visualization of random graphs and graph populations. This package provides flexible and easy-to-use algorithms for analyzing and understanding graphs with a scikit-learn compliant API. GraSPy can be downloaded from Python Pac…

2019-03-29abs ↗pdf ↗

Visualizing high-dimensional data has been a focus in data analysis communities for decades, which has led to the design of many algorithms, some of which are now considered references (such as t-SNE for example). In our era of overwhelming data volumes, the scalability of such methods have become more and more importa…

2017-02-19abs ↗pdf ↗

Causal reasoning has been an indispensable capability for humans and other intelligent animals to interact with the physical world. In this work, we propose to endow an artificial agent with the capability of causal reasoning for completing goal-directed tasks. We develop learning-based approaches to inducing causal kn…

2019-10-03abs ↗pdf ↗

NAS-Navigator automates neural network architecture search with visual steering.

problem Difficulty in configuring large neural networks efficiently.
method Formulates architecture optimization as graph space exploration, trains all candidate architectures in one-shot.
result Allows analysts to effectively select and guide the search for optimal neural network architectures.

Graphs model human mobility patterns, reducing errors in data matching.

problem Lack of high-quality data and computational resources for graph-based mobility analysis.
method Embedding graphs into a continuous space to address matching, modeling, and visualization challenges.
result Approx 40% decrease in error on average in matched graphs vs unmatched ones.

A Thurston map is a branched covering map from §2§^2 to §2§^2 with a finite postcritical set. We associate a natural Gromov hyperbolic graph $\G=\G(f,\mathcal C)$ with an expanding Thurston map ff and a Jordan curve C\mathcal C on §2§^2 containing $\post(f)$. The boundary at infinity of $\G$ with associated visual me…

2011-09-14abs ↗pdf ↗

This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model …

2014-10-16abs ↗pdf ↗

The paper studies the connectedness of a graph's boundary for surfaces.

problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.

Optimizes cover parameter in Mapper algorithm for better visualization.

problem Tuning the cover parameter in Mapper algorithm to generate a ``nice'' graph.
method Optimizes cover by repeatedly splitting using statistical tests and Gaussian mixture model.
result Algorithm generates covers that retain dataset essence while being faster.

Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…

2014-06-13abs ↗pdf ↗

The paper finds and visualizes unique geometric polyhedra and tori with few vertices.

problem Finding and visualizing geometric polyhedra and tori with specific vertex configurations.
method Using Schlegel diagrams and geometric realization in 3D and 4D space.
result Identifies and visualizes 12 triangulations of the 2-torus and 12 triangulations of the 2D projective plane.

Proposes MR-SNE for multimodal data visualization.

problem Visualizing data from multiple domains with relations across them.
method Extends t-SNE to compute augmented relations and jointly embed them in a low-dimensional space.
result Demonstrates promising performance in visualizing Flickr and Animal with Attributes 2 datasets.

Music genre is arguably one of the most important and discriminative information for music and audio content. Visual representation based approaches have been explored on spectrograms for music genre classification. However, lack of quality data and augmentation techniques makes it difficult to employ deep learning tec…

2019-10-23abs ↗pdf ↗

Deep Reinforcement Learning (DRL) is a trending field of research, showing great promise in many challenging problems such as playing Atari, solving Go and controlling robots. While DRL agents perform well in practice we are still missing the tools to analayze their performance and visualize the temporal abstractions t…

2016-06-22abs ↗pdf ↗

Object clustering, aiming at grouping similar objects into one cluster with an unsupervised strategy, has been extensivelystudied among various data-driven applications. However, most existing state-of-the-art object clustering methods (e.g., single-view or multi-view clustering methods) only explore visual information…

2019-11-21abs ↗pdf ↗