We develop methodology for visualization of labeled mixed-featured datasets. We first investigate datasets with continuous features where our Max-Ratio Projection (MRP) method utilizes the group information in high dimensions to provide distinctive lower-dimensional projections that are then displayed using Radviz3D. O…
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,657 papers · 148 categories
Trend · papers per month
48 results for “visual feature projection”
We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness (low variance) and adaptiveness (low bias). Direct interpretation of a RF model…
Semi-automatic data annotation helps experts label unlabeled samples based on feature space projection.
problem Laborious manual data annotation for machine learning.
method Interactive semi-automatic approach using feature space projection and semi-supervised learning.
result Reduces user annotation effort and improves classification accuracy.
Paper proposes redundancy-free features for zero-shot object recognition.
problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.
CCP clusters correlated features and projects them to 1D for efficient dimensionality reduction.
problem Efficiency in handling large datasets with high intrinsic dimensions.
method CCP partitions features into correlated clusters and projects them to 1D based on sample correlations.
result CCP achieves efficient dimensionality reduction without matrix diagonalization.
Feature Learning for Nonlinear Dimensionality Reduction toward Maximal Extraction of Hidden Patternscs.LG
FEALM learns features for better nonlinear DR of hidden patterns.
problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.
In this paper, we propose and study random maxout features, which are constructed by first projecting the input data onto sets of randomly generated vectors with Gaussian elements, and then outputing the maximum projection value for each set. We show that the resulting random feature map, when used in conjunction with …
Yarbus' claim to decode the observer's task from eye movements has received mixed reactions. In this paper, we have supported the hypothesis that it is possible to decode the task. We conducted an exploratory analysis on the dataset by projecting features and data points into a scatter plot to visualize the nuance prop…
Enhances projection pursuit tree classifier with visual diagnostics for better multi-class classification.
problem Rigidity of original algorithm limits performance in complex high-dimensional classification problems.
method Allowing more splits and flexible class groupings in projection pursuit computation, and developing visual diagnostics.
result Demonstrates enhanced classifier performs as intended through interactive visual diagnostics.
Improved 3D ECG feature attributions for clinical interpretation.
problem Lack of interpretability in deep learning models for 12-lead ECG analysis.
method Cross-modal mapping of feature attributions from 12-lead ECG models onto CineECG 3D space.
result Mapped feature attributions yield higher Dice scores than standard 12-lead attributions.
A method to visualize multidimensional local subspaces using implicit differentiation.
problem Understanding the effect of multidimensional projection on local subspaces.
method Implicit function differentiation to analyze local subspaces shaped by multidimensional ellipses.
result Visualization of local subspaces provides insights into the global structure of data.
Two new algorithms select matrix rows and columns to preserve distances.
problem Preserving distances in large matrix visualizations.
method Selects rows and columns to preserve distances.
result Preserves distances as closely as possible.
Cross-domain visual data matching is one of the fundamental problems in many real-world vision tasks, e.g., matching persons across ID photos and surveillance videos. Conventional approaches to this problem usually involves two steps: i) projecting samples from different domains into a common space, and ii) computing (…
This research reverses feature visualization in neural networks to optimize for specific feature objectives.
problem The invertibility of feature visualization in neural networks is not well understood.
method The approach involves optimizing for the feature objective that generates the input used in feature visualization, using the gradient of a specific objective function.
result A closed-form solution is found to minimize the gradient, providing an alternative view on network sensitivity.
Polarimetric Synthetic Aperture Radar (PolSAR) images are establishing as an important source of information in remote sensing applications. The most complete format this type of imaging produces consists of complex-valued Hermitian matrices in every image coordinate and, as such, their visualization is challenging. Th…
New method visualizes tabular feature semantics for better model understanding.
problem Lack of feature interaction interpretation in tabular ML models.
method Feature Vectors method for global tabular dataset interpretability.
result Visualizes semantic relationships among tabular features.
WAPPO optimizes feature distributions for better visual transfer in RL.
problem Improving visual transfer in reinforcement learning.
method WAPPO uses Wasserstein Confusion to minimize feature distribution distance.
result WAPPO outperforms previous methods in visual transfer across different environments.
FeatureEnVi aids in feature engineering with visual analytics.
problem Insufficient support for feature engineering in visual analytics tools.
method Stepwise selection and semi-automatic extraction approaches.
result Extracts heavily engineered features evaluated by multiple metrics.
Two-dimensional embeddings remain the dominant approach to visualize high dimensional data. The choice of embeddings ranges from highly non-linear ones, which can capture complex relationships but are difficult to interpret quantitatively, to axis-aligned projections, which are easy to interpret but are limited to biva…
DEN creates interpretable visualizations using Siamese networks.
problem Creating interpretable visualizations of complex datasets.
method Differentiating Embedding Networks (DEN) using Siamese neural networks and loss functions.
result DEN outperforms existing techniques on FashionMNIST and interpretable features are identified.
t-SNE loses important features in data visualization.
problem t-SNE's loss of important features in data visualization.
method Established mathematical framework to understand t-SNE's loss in different scenarios.
result t-SNE loses important features of data in various scenarios.
The Hopf fibration mapping circles on a 3-sphere to points on a 2-sphere is well known to topologists. While the 2-sphere is embedded in 3-space, four-dimensional Euclidean space is needed to visualize the 3-sphere. Visualizing objects in 4-space using computer graphics based on their analytical representations has bec…
Visual Explanation by Interpretation: Improving Visual Feedback Capabilities of Deep Neural Networkscs.CV
Interpretation and explanation of deep models is critical towards wide adoption of systems that rely on them. In this paper, we propose a novel scheme for both interpretation as well as explanation in which, given a pretrained model, we automatically identify internal features relevant for the set of classes considered…
Researchers classify and visualize 5-cube cubical surfaces.
problem Classifying and visualizing surfaces in a 5-dimensional cube.
method Exhaustive search, classification by genus and demigenus, 3D visualization, reinforcement learning for optimization.
result 2690 connected closed cubical surfaces in the 5-cube, visualized and optimized for 3D printing.
theft package simplifies feature extraction for time series analysis in R.
problem Lack of a unified access point and methodological pipelines for feature-based time series analysis.
method theft package provides a unified framework for computing features from six open-source time series feature sets.
result theft enables comprehensive quantification and interpretation of time series structure.
In recent years, a large amount of model-agnostic methods to improve the transparency, trustability and interpretability of machine learning models have been developed. We introduce local feature importance as a local version of a recent model-agnostic global feature importance method. Based on local feature importance…
t-Distributed Stochastic Neighbor Embedding (t-SNE) for the visualization of multidimensional data has proven to be a popular approach, with successful applications in a wide range of domains. Despite their usefulness, t-SNE projections can be hard to interpret or even misleading, which hurts the trustworthiness of the…
Random Forests [Breiman:2001] (RF) are a fully non-parametric statistical method requiring no distributional assumptions on covariate relation to the response. RF are a robust, nonlinear technique that optimizes predictive accuracy by fitting an ensemble of trees to stabilize model estimates. The randomForestSRC packag…
NegToMe uses images to guide text-based models away from unwanted visual elements.
problem Insufficient text-based adversarial guidance for complex visual concepts.
method Negative token merging (NegToMe) using visual features from reference images.
result Significantly enhances output diversity and reduces visual similarity to copyrighted content.
We study projectional properties of Poisson cut-out sets in non-Euclidean spaces. In the first Heisenbeg group, endowed with the Korányi metric, we show that the Hausdorff dimension of the vertical projection (projection along the center of the Heisenberg group) almost surely equals and …
Dimensionality reduction methods, also known as projections, are frequently used for exploring multidimensional data in machine learning, data science, and information visualization. Among these, t-SNE and its variants have become very popular for their ability to visually separate distinct data clusters. However, such…
Nonlinear Dimensionality Reduction for Data Visualization: An Unsupervised Fuzzy Rule-based Approachcs.LG
Proposes a fuzzy rule-based method for data visualization.
problem Preserving neighborhood relationships and handling non-linear manifolds in data visualization.
method Uses a first-order Takagi-Sugeno model with clusters and Geodesic c-means clustering for rule generation and parameter estimation.
result Behaves desirably and performs better than or comparable to other methods.
In this short article I introduce the knotR package, which creates two dimensional knot diagrams optimized for visual appearance using the R programming language. The knotR package is a systematic R-centric suite of software for the creation of production-quality artwork of knot diagrams, released under GPL2.
Analyzes NFT market trends, trade networks, and visual features.
problem Understanding the structure and evolution of NFT market.
method Data analysis of 6.1 million trades of 4.7 million NFTs.
result NFTs form tight clusters and collections contain visually homogeneous objects.
Interpretable Selection and Visualization of Features and Interactions Using Bayesian Forestsstat.ML
It is becoming increasingly important for machine learning methods to make predictions that are interpretable as well as accurate. In many practical applications, it is of interest which features and feature interactions are relevant to the prediction task. We present a novel method, Selective Bayesian Forest Classifie…
New method makes quality metrics scale-invariant for high-dimensional data.
problem Scale sensitivity in quality metrics affects the accuracy of data projections.
method Analytical and empirical investigation of stress and KL divergence; introduction of a scale-invariant technique.
result The proposed technique accurately captures expected behavior and makes metrics scale-invariant.
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…
Paper develops a framework for generating coherent image captions using visual features and hierarchical topics.
problem Generating semantically coherent paragraphs to describe image content.
method Plug-and-play hierarchical-topic-guided image paragraph generation framework integrating visual extractor and deep topic model.
result Proposed models can distill interpretable multi-layer semantic topics and generate diverse and coherent captions.
Visual attention serves as a means of feature selection mechanism in the perceptual system. Motivated by Broadbent's leaky filter model of selective attention, we evaluate how such mechanism could be implemented and affect the learning process of deep reinforcement learning. We visualize and analyze the feature maps of…
Visualization of Board of Director Connections for Analysis in Socially Responsible Investingq-fin.GN
Visualizes board connections for socially responsible investing insights.
problem Understanding corporate governance and sustainability through board connections.
method Data Visualization tool to reveal connections between Directors and Executives.
result Strength of tool in investigating corporate governance and sustainability.
JD.com uses a new CNN model to improve ad click prediction.
problem Improving CTR prediction for ads with visual content.
method Proposes Category-specific CNN (CSCNN) to incorporate category knowledge early in the feature extraction process.
result CSCNN outperforms existing methods in CTR prediction.
We introduce a dimension reduction method for visualizing the clustering structure obtained from a finite mixture of Gaussian densities. Information on the dimension reduction subspace is obtained from the variation on group means and, depending on the estimated mixture model, on the variation on group covariances. The…
Understanding how images of objects and scenes behave in response to specific ego-motions is a crucial aspect of proper visual development, yet existing visual learning methods are conspicuously disconnected from the physical source of their images. We propose to exploit proprioceptive motor signals to provide unsuperv…
Study evaluates interpretability of time series foundation models' latent spaces.
problem Improving interpretability of latent spaces in time series models for visual analytics.
method Evaluated MOMENT family of transformer-based models on five datasets, fine-tuning for performance.
result Fine-tuning improved latent space clarity but limited interpretability remained.
New methods for assessing and visualizing feature groups in machine learning models.
problem Lack of methods for interpreting feature groups in machine learning models.
method Permutation-based, refitting, and Shapley-based techniques for grouped feature importance. Introduced a sequential procedure for identifying stable feature combinations. Developed a combined features effect plot.
result Effective methods for assessing and visualizing the importance and effect of feature groups in machine learning models.
The visual systems of many mammals, including humans, is able to integrate the geometric information of visual stimuli and to perform cognitive tasks already at the first stages of the cortical processing. This is thought to be the result of a combination of mechanisms, which include feature extraction at single cell l…
The paper explains knowledge distillation by analyzing visual concepts in DNNs.
problem Understanding how knowledge distillation affects the learning of visual concepts in deep neural networks.
method The paper proposes three hypotheses and designs mathematical metrics to evaluate feature representations of DNNs.
result The hypotheses were verified through experiments on various DNNs.
Developing a visual platform for faster astronomical source cataloging.
problem Speeding up cataloging of large area surveys in radio astronomy.
method Integration of advanced source finding and classification tools into a visual analytic platform.
result Improvement and acceleration of cataloging process in astronomical surveys.