Searcharxiv⌕ Search

arXiv subjects

Takanori Fujiwara

Publications and source records attributed to Takanori Fujiwara.

At least 37 records · Page 2Linked to original sources

Network Comparison with Interpretable Contrastive Network Representation Learning

Identifying unique characteristics in a network through comparison with another network is an essential network analysis task. For example, with networks of protein interactions obtained from normal and cancer tissues, we can discover unique types of interactions in cancer tissues. This analysis task could be greatly assisted by contrastive learning, which is an emerging analysis approach to discover salient patterns in one dataset relative to another. However, existing contrastive learning methods cannot be directly applied to networks as they are designed only for high-dimensional data analysis. To address this problem, we introduce a new analysis approach called contrastive network representation learning (cNRL). By integrating two machine learning schemes, network representation learning and contrastive learning, cNRL enables embedding of network nodes into a low-dimensional representation that reveals the uniqueness of one network compared to another. Within this approach, we also design a method, named i-cNRL, which offers interpretability in the learned results, allowing for understanding which specific patterns are only found in one network. We demonstrate the effectiveness of i-cNRL for network comparison with multiple network models and real-world datasets. Furthermore, we compare i-cNRL and other potential cNRL algorithm designs through quantitative and qualitative evaluations.

cs.LG↗

A Machine-Learning-Aided Visual Analysis Workflow for Investigating Air Pollution Data

Analyzing air pollution data is challenging as there are various analysis focuses from different aspects: feature (what), space (where), and time (when). As in most geospatial analysis problems, besides high-dimensional features, the temporal and spatial dependencies of air pollution induce the complexity of performing analysis. Machine learning methods, such as dimensionality reduction, can extract and summarize important information of the data to lift the burden of understanding such a complicated environment. In this paper, we present a methodology that utilizes multiple machine learning methods to uniformly explore these aspects. With this methodology, we develop a visual analytic system that supports a flexible analysis workflow, allowing domain experts to freely explore different aspects based on their analysis needs. We demonstrate the capability of our system and analysis workflow supporting a variety of analysis tasks with multiple use cases.

cs.LG↗

A Predictive Visual Analytics System for Studying Neurodegenerative Disease based on DTI Fiber Tracts

Diffusion tensor imaging (DTI) has been used to study the effects of neurodegenerative diseases on neural pathways, which may lead to more reliable and early diagnosis of these diseases as well as a better understanding of how they affect the brain. We introduce an intelligent visual analytics system for studying patient groups based on their labeled DTI fiber tract data and corresponding statistics. The system's AI-augmented interface guides the user through an organized and holistic analysis space, including the statistical feature space, the physical space, and the space of patients over different groups. We use a custom machine learning pipeline to help narrow down this large analysis space, and then explore it pragmatically through a range of linked visualizations. We conduct several case studies using real data from the research database of Parkinson's Progression Markers Initiative.

cs.CV↗

A Visual Analytics Framework for Reviewing Multivariate Time-Series Data with Dimensionality Reduction

Data-driven problem solving in many real-world applications involves analysis of time-dependent multivariate data, for which dimensionality reduction (DR) methods are often used to uncover the intrinsic structure and features of the data. However, DR is usually applied to a subset of data that is either single-time-point multivariate or univariate time-series, resulting in the need to manually examine and correlate the DR results out of different data subsets. When the number of dimensions is large either in terms of the number of time points or attributes, this manual task becomes too tedious and infeasible. In this paper, we present MulTiDR, a new DR framework that enables processing of time-dependent multivariate data as a whole to provide a comprehensive overview of the data. With the framework, we employ DR in two steps. When treating the instances, time points, and attributes of the data as a 3D array, the first DR step reduces the three axes of the array to two, and the second DR step visualizes the data in a lower-dimensional space. In addition, by coupling with a contrastive learning method and interactive visualizations, our framework enhances analysts' ability to interpret DR results. We demonstrate the effectiveness of our framework with four case studies using real-world datasets.

cs.HC↗

Interactive Dimensionality Reduction for Comparative Analysis

Finding the similarities and differences between groups of datasets is a fundamental analysis task. For high-dimensional data, dimensionality reduction (DR) methods are often used to find the characteristics of each group. However, existing DR methods provide limited capability and flexibility for such comparative analysis as each method is designed only for a narrow analysis target, such as identifying factors that most differentiate groups. This paper presents an interactive DR framework where we integrate our new DR method, called ULCA (unified linear comparative analysis), with an interactive visual interface. ULCA unifies two DR schemes, discriminant analysis and contrastive learning, to support various comparative analysis tasks. To provide flexibility for comparative analysis, we develop an optimization algorithm that enables analysts to interactively refine ULCA results. Additionally, the interactive visualization interface facilitates interpretation and refinement of the ULCA results. We evaluate ULCA and the optimization algorithm to show their efficiency as well as present multiple case studies using real-world datasets to demonstrate the usefulness of this framework.

cs.LG↗

Expanding Polyhedral Universe in Regge Calculus

The closed Friedmann--Lemaître--Robertson--Walker (FLRW) universe of Einstein gravity with positive cosmological constant in three dimensions is investigated by using the Collins--Williams formalism in Regge calculus. A spherical Cauchy surface is replaced with regular polyhedrons. The Regge equations are reduced to differential equations in the continuum time limit. Numerical solutions to the Regge equations approximate well the continuum FLRW universe during the era of small edge length. The deviation from the continuum solution becomes larger and larger with time. Unlike the continuum universe, the polyhedral universe expands to infinite within finite time. To remedy the shortcoming of the model universe we introduce geodesic domes and pseudo-regular polyhedrons. It is shown that the pseudo-regular polyhedron model can approximate well the results of the Regge calculus for the geodesic domes. The pseudo-regular polyhedron model approaches the continuum solution in the infinite frequency limit.

gr-qc↗

Oscillating 4-Polytopal Universe in Regge Calculus

The discretized closed Friedmann-Lemaître-Robertson-Walker (FLRW) universe with positive cosmological constant is investigated by Regge calculus. According to the Collins-Williams formalism, a hyperspherical Cauchy surface is replaced with regular 4-polytopes. Numerical solutions to the Regge equations approximate well to the continuum solution during the era of small edge length. Unlike the expanding polyhedral universe in three dimensions, the 4-polytopal universes repeat expansions and contractions. To go beyond the approximation using regular 4-polytopes we introduce pseudo-regular 4-polytopes by averaging the dihedral angles of the tessellated regular 600-cell. The degree of precision of the tessellation is called the frequency. Regge equations for the pseudo-regular 4-polytope have simple and unique expressions for any frequency. In the infinite frequency limit, the pseudo-regular 4-polytope model approaches the continuum FLRW universe.

gr-qc↗

Higher Dimensional Polytopal Universe in Regge Calculus

Higher dimensional closed Friedmann-Lemaître-Robertson-Walker (FLRW) universe with positive cosmological constant is investigated by Regge calculus. A Cauchy surface of discretized FLRW universe is replaced by a regular polytope in accordance with the Collins-Williams (CW) formalism. Polytopes in an arbitrary dimensions can be systematically dealt with by a set of five integers integrating the Schläfli symbol of the polytope. Regge action in continuum time limit is given. It possesses reparameterization invariance of the time variable. Variational principle for edge lengths and struts yields Hamiltonian constraint and evolution equation. They describe oscillating universe in dimensions larger than three. To go beyond the approximation by regular polytopes, we propose pseudo-regular polytopes with fractional Schläfli symbols as a substitute for geodesic domes in higher dimensions. We examine the pseudo-regular polytope model as an effective theory of Regge calculus for the geodesic domes. In the infinite frequency limit, the pseudo-regular polytope model reduces to the continuum FLRW universe.

gr-qc↗

A Visual Analytics System for Water Distribution System Optimization

The optimization of water distribution systems (WDSs) is vital to minimize energy costs required for their operations. A principal approach taken by researchers is identifying an optimal scheme for water pump controls through examining computational simulations of WDSs. However, due to a large number of possible control combinations and the complexity of WDS simulations, it remains non-trivial to identify the best pump controls by reviewing the simulation results. To address this problem, we design a visual analytics system that helps understand relationships between simulation inputs and outputs towards better optimization. Our system incorporates interpretable machine learning as well as multiple linked visualizations to capture essential input-output relationships from complex WDS simulations. We demonstrate our system's effectiveness through a practical case study and evaluate its usability through expert reviews. Our results show that our system can lessen the burden of analysis and assist in determining optimal operating schemes.

cs.HC↗

A Visual Analytics Framework for Contrastive Network Analysis

A common network analysis task is comparison of two networks to identify unique characteristics in one network with respect to the other. For example, when comparing protein interaction networks derived from normal and cancer tissues, one essential task is to discover protein-protein interactions unique to cancer tissues. However, this task is challenging when the networks contain complex structural (and semantic) relations. To address this problem, we design ContraNA, a visual analytics framework leveraging both the power of machine learning for uncovering unique characteristics in networks and also the effectiveness of visualization for understanding such uniqueness. The basis of ContraNA is cNRL, which integrates two machine learning schemes, network representation learning (NRL) and contrastive learning (CL), to generate a low-dimensional embedding that reveals the uniqueness of one network when compared to another. ContraNA provides an interactive visualization interface to help analyze the uniqueness by relating embedding results and network structures as well as explaining the learned features by cNRL. We demonstrate the usefulness of ContraNA with two case studies using real-world datasets. We also evaluate through a controlled user study with 12 participants on network comparison tasks. The results show that participants were able to both effectively identify unique characteristics from complex networks and interpret the results obtained from cNRL.

cs.SI↗

Comparative Visual Analytics for Assessing Medical Records with Sequence Embedding

Machine learning for data-driven diagnosis has been actively studied in medicine to provide better healthcare. Supporting analysis of a patient cohort similar to a patient under treatment is a key task for clinicians to make decisions with high confidence. However, such analysis is not straightforward due to the characteristics of medical records: high dimensionality, irregularity in time, and sparsity. To address this challenge, we introduce a method for similarity calculation of medical records. Our method employs event and sequence embeddings. While we use an autoencoder for the event embedding, we apply its variant with the self-attention mechanism for the sequence embedding. Moreover, in order to better handle the irregularity of data, we enhance the self-attention mechanism with consideration of different time intervals. We have developed a visual analytics system to support comparative studies of patient records. To make a comparison of sequences with different lengths easier, our system incorporates a sequence alignment method. Through its interactive interface, the user can quickly identify patients of interest and conveniently review both the temporal and multivariate aspects of the patient records. We demonstrate the effectiveness of our design and system with case studies using a real-world dataset from the neonatal intensive care unit of UC Davis.

physics.med-ph↗

A Visual Analytics System for Multi-model Comparison on Clinical Data Predictions

There is a growing trend of applying machine learning methods to medical datasets in order to predict patients' future status. Although some of these methods achieve high performance, challenges still exist in comparing and evaluating different models through their interpretable information. Such analytics can help clinicians improve evidence-based medical decision making. In this work, we develop a visual analytics system that compares multiple models' prediction criteria and evaluates their consistency. With our system, users can generate knowledge on different models' inner criteria and how confidently we can rely on each model's prediction for a certain patient. Through a case study of a publicly available clinical dataset, we demonstrate the effectiveness of our visual analytics system to assist clinicians and researchers in comparing and quantitatively evaluating different machine learning methods.

physics.med-ph↗

A Visual Analytics Framework for Reviewing Streaming Performance Data

Understanding and tuning the performance of extreme-scale parallel computing systems demands a streaming approach due to the computational cost of applying offline algorithms to vast amounts of performance log data. Analyzing large streaming data is challenging because the rate of receiving data and limited time to comprehend data make it difficult for the analysts to sufficiently examine the data without missing important changes or patterns. To support streaming data analysis, we introduce a visual analytic framework comprising of three modules: data management, analysis, and interactive visualization. The data management module collects various computing and communication performance metrics from the monitored system using streaming data processing techniques and feeds the data to the other two modules. The analysis module automatically identifies important changes and patterns at the required latency. In particular, we introduce a set of online and progressive analysis methods for not only controlling the computational costs but also helping analysts better follow the critical aspects of the analysis results. Finally, the interactive visualization module provides the analysts with a coherent view of the changes and patterns in the continuously captured performance data. Through a multi-faceted case study on performance analysis of parallel discrete-event simulation, we demonstrate the effectiveness of our framework for identifying bottlenecks and locating outliers.

cs.DC↗

Supporting Analysis of Dimensionality Reduction Results with Contrastive Learning

Dimensionality reduction (DR) is frequently used for analyzing and visualizing high-dimensional data as it provides a good first glance of the data. However, to interpret the DR result for gaining useful insights from the data, it would take additional analysis effort such as identifying clusters and understanding their characteristics. While there are many automatic methods (e.g., density-based clustering methods) to identify clusters, effective methods for understanding a cluster's characteristics are still lacking. A cluster can be mostly characterized by its distribution of feature values. Reviewing the original feature values is not a straightforward task when the number of features is large. To address this challenge, we present a visual analytics method that effectively highlights the essential features of a cluster in a DR result. To extract the essential features, we introduce an enhanced usage of contrastive principal component analysis (cPCA). Our method, called ccPCA (contrasting clusters in PCA), can calculate each feature's relative contribution to the contrast between one cluster and other clusters. With ccPCA, we have created an interactive system including a scalable visualization of clusters' feature contributions. We demonstrate the effectiveness of our method and system with case studies using several publicly available datasets.

cs.LG↗

An Incremental Dimensionality Reduction Method for Visualizing Streaming Multidimensional Data

Dimensionality reduction (DR) methods are commonly used for analyzing and visualizing multidimensional data. However, when data is a live streaming feed, conventional DR methods cannot be directly used because of their computational complexity and inability to preserve the projected data positions at previous time points. In addition, the problem becomes even more challenging when the dynamic data records have a varying number of dimensions as often found in real-world applications. This paper presents an incremental DR solution. We enhance an existing incremental PCA method in several ways to ensure its usability for visualizing streaming multidimensional data. First, we use geometric transformation and animation methods to help preserve a viewer's mental map when visualizing the incremental results. Second, to handle data dimension variants, we use an optimization method to estimate the projected data positions, and also convey the resulting uncertainty in the visualization. We demonstrate the effectiveness of our design with two case studies using real-world datasets.

cs.GR↗

Generalized index theorem for topological superconductors with Yang-Mills-Higgs couplings

We investigate an index theorem for a Bogoliubov-de Gennes Hamiltonian (BdGH) describing a topological superconductor with Yang-Mills-Higgs couplings in arbitrary dimensions. We find that the index of the BdGH is determined solely by the asymptotic behavior of the Higgs fields and is independent of the gauge fields. It can be nonvanishing if the dimensionality of the order parameter space is equal to the spatial dimensions. In the presence of point defects there appear localized zero energy states at the defects. Consistency of the index with the existence of zero energy bound states is examined explicitly in a vortex background in two dimensions and in a monopole background in three dimensions.

hep-th↗

Majorana bound state of a Bogoliubov-de Gennes-Dirac Hamiltonian in arbitrary dimensions

We study a Majorana zero-energy state bound to a hedgehog-like point defect in a topological superconductor described by a Bogoliubov-de Gennes (BdG)-Dirac type effective Hamiltonian. We first give an explicit wave function of a Majorana state by solving the BdG equation directly, from which an analytical index can be obtained. Next, by calculating the corresponding topological index, we show a precise equivalence between both indices to confirm the index theorem. Finally, we apply this observation to reexamine the role of another topological invariant, i.e., the Chern number associated with the Berry curvature proposed in the study of protected zero modes along the lines of topological classification of insulators and superconductors. We show that the Chern number is equivalent to the topological index, implying that it indeed reflects the number of zero-energy states. Our theoretical model belongs to the BDI class from the viewpoint of symmetry, whereas the spatial dimension of the system is left arbitrary throughout the paper.

cond-mat.supr-con↗

Index theorem and Majorana zero modes along a non-Abelian vortex in a color superconductor

Color superconductivity in high density QCD exhibits the color-flavor locked (CFL) phase. To explore zero modes in the CFL phase in the presence of a non-Abelian vortex with an SU(2) symmetry in the vortex core, we apply the index theorem to the Bogoliubov-de Gennes (BdG) Hamiltonian. From the calculation of the topological index, we find that triplet, doublet and singlet sectors of SU(2) have certain number of chiral Majorana zero modes in the limit of vanishing chemical potential. We also solve the BdG equation by the use of the series expansion to show that the number of zero modes and their chirality match the result of the index theorem. From particle-hole symmetry of the BdG Hamiltonian, we conclude that if and only if the index of a given sector is odd, one zero mode survives generically for a finite chemical potential. We argue that this result should hold nonperturbatively even in the high density limit.

hep-ph↗