We present a framework for combining automated and interactive visual analysis techniques for use on high-resolution biomechanical data. Analyzing the complex 3D motion of, e.g., pigs chewing or bats flying, can be enhanced by providing investigators with a multi-view interface that allows interaction across multiple modalities and representations. In this paper, we employ nonlinear dimensional...

In this paper we propose a new combined approach to feature space decomposition to improve the efficiency of the nonlinear dimensionality reduction method. The approach performs the decomposition of the original multidimensional space, taking into account the configuration of objects in the target low-dimensional space. The proposed approach is compared to the approach using hierarchical cluste...

Locally Linear embedding (LLE) is a popular dimension reduction method. In this paper, we systematically improve the two main steps of LLE: (A) learning the graph weights W, and (B) learning the embedding Y. We propose a sparse nonnegative W learning algorithm. We propose a weighted formulation for learning Y and show the results are identical to normalized cuts spectral clustering. We further ...

Scientists in many fields have the common and basic need of dimensionality reduction: visualizing the underlying structure of the massive multivariate data in a low-dimensional space. However, many dimensionality reduction methods confront the so-called “crowding problem” that clusters tend to overlap with each other in the embedding. Previously, researchers expect to avoid that problem and see...

The P-cluster of nitrogenase is largely known for its function to mediate electron transfer to the active cofactor site during catalysis. Here, we show that a P-cluster variant (designated P*-cluster), which consists of paired [Fe(4)S(4)]-like clusters, can catalyze ATP-independent substrate reduction in the presence of a strong reductant, europium(II) diethylenetriaminepentaacetate [Eu(II)-DTP...

Dimensionality reduction is a fundamental problem of machine learning, and has been intensively studied, where classification and clustering are two special cases of dimensionality reduction that reduce high-dimensional data to discrete points. Here we describe a simple multilayer network for dimensionality reduction that each layer of the network is a group of mutually independent k-centers cl...

Diversity has been promoted in image retrieval results using clustering algorithms to tackle queries, which refer to multiple information needs, e.g., due to ambiguity. Despite the effective results of diversity-aware methods, the image wealth of large collections and the subjectivity of human perception bring the semantic gap problem. This paper presents multimodal fusion approaches aimed at r...

We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show that these easy-to-compute orderings allow us to detect outliers (i.e. very untypical points) with a performance comparable to or better than other often much more sophisticated methods. On the other hand, we show how ...

Matrix Decomposition methods are applied to a wide range of tasks, such as data denoising, dimensionality reduction, co-clustering and community detection. However, in the presence of boolean inputs, common methods either do not scale or do not provide a boolean reconstruction, which results in high reconstruction error and low interpretability of the decomposition. We propose a novel step deco...

We propose a new linear method for dimension reduction to identify nonGaussian components in high dimensional data. Our method, NGCA (non-Gaussian component analysis), uses a very general semi-parametric framework. In contrast to existing projection methods we define what is uninteresting (Gaussian): by projecting out uninterestingness, we can estimate the relevant non-Gaussian subspace. We sho...