On the relation of slow feature analysis and Laplacian eigenmaps

The past decade has seen a rise of interest in Laplacian eigenmaps (LEMs) for nonlinear dimensionality reduction. LEMs have been used in spectral clustering, in semisupervised learning, and for providing efficient state representations for reinforcement learning. Here, we show that LEMs are closely related to slow feature analysis (SFA), a biologically inspired, unsupervised learning algorithm originally designed for learning invariant visual representations. We show that SFA can be interpreted as a function approximation of LEMs, where the topological neighborhoods required for LEMs are implicitly defined by the temporal structure of the data. Based on this relation, we propose a generalization of SFA to arbitrary neighborhood relations and demonstrate its applicability for spectral clustering. Finally, we review previous work with the goal of providing a unifying view on SFA and LEMs. © 2011 Massachusetts Institute of Technology.

Geometric optimization methods for independent component analysis applied on gene expression data

DNA microarrays provide a huge amount of data and require therefore dimensionality reduction methods to extract meaningful biological information. Independent Component Analysis (ICA) was proposed by several authors as an interesting means. Unfortunately, experimental data are usually of poor quality- because of noise, outliers and lack of samples. Robustness to these hurdles will thus be a key feature for an ICA algorithm. This paper identifies a robust contrast function and proposes a new ICA algorithm. © 2007 IEEE.

Parallel coordinates in computational engineering design

Modern Engineering Design involves the deployment of many computational tools. Re- search on challenging real-world design problems is focused on developing improvements for the engineering design process through the integration and application of advanced com- putational search/optimization and analysis tools. Successful application of these methods generates vast quantities of data on potential optimum designs. To gain maximum value from the optimization process, designers need to visualise and interpret this information leading to better understanding of the complex and multimodal relations between param- eters, objectives and decision-making of multiple and strongly conflicting criteria. Initial work by the authors has identified that the Parallel Coordinates interactive visualisation method has considerable potential in this regard. This methodology involves significant levels of user-interaction, making the engineering designer central to the process, rather than the passive recipient of a deluge of pre-formatted information. In the present work we have applied and demonstrated this methodology in two differ- ent aerodynamic turbomachinery design cases; a detailed 3D shape design for compressor blades, and a preliminary mean-line design for the whole compressor core. The first case comprises 26 design parameters for the parameterisation of the blade geometry, and we analysed the data produced from a three-objective optimization study, thus describing a design space with 29 dimensions. The latter case comprises 45 design parameters and two objective functions, hence developing a design space with 47 dimensions. In both cases the dimensionality can be managed quite easily in Parallel Coordinates space, and most importantly, we are able to identify interesting and crucial aspects of the relationships between the design parameters and optimum level of the objective functions under con- sideration. These findings guide the human designer to find answers to questions that could not even be addressed before. In this way, understanding the design leads to more intelligent decision-making and design space exploration. © 2012 AIAA.

On the two classes of global primary modal instability in laminar separation bubbles

The self-excited global instability mechanisms existing in flat-plate laminar separation bubbles are studied here, in order to shed light on the causes of unsteadiness and three- dimensionality of unforced, nominally two-dimensional separated flows. The presence of two known linear global mechanisms, namely an oscillator behavior driven by local regions of absolute inflectional instability and a centrifugal instability giving rise to a steady three- dimensionalization of the bubble, is studied in a series of model separation bubbles. Present results indicate that absolute instability, and consequently a global oscillator behavior, does not exist for two-dimensional bubbles with a peak reversed-flow velocity below 12% of the free-stream velocity. However, the three-dimensional instability becomes active for recirculation levels as low as urev ≈ 7%. These findings suggest a route to the three-dimensionality and unsteadiness observed in experiments and simulations substantially different from that usually found in the literature, in which two-dimensional vortex shedding is followed by three-dimensionalization.

Manopt, a matlab toolbox for optimization on manifolds

Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design effcient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. Such structured constraints appear pervasively in machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent component analysis, metric learning, dimensionality reduction and so on. The Manopt toolbox, available at www.manopt.org, is a user-friendly, documented piece of software dedicated to simplify experimenting with state of the art Riemannian optimization algorithms. By dealing internally with most of the differential geometry, the package aims particularly at lowering the entrance barrier. © 2014 Nicolas Boumal.

A Cancer Recognition Method Based on DNA Microarray

The accurate cancer classification is of great importance in clinical treatment. Recently, the DNA microarray technology provides a promising approach to the diagnosis and prognosis of cancer types. However, it has no perfect method for the multiclass classification problem. The difficulty lies in the fact that the data are of high dimensionality with small sample size. This paper proposed an automatic classification method of multiclass cancers based on Biomimetic pattern recognition (BPR). To the public GCM data set, the average correct classification rate reaches 80% under the condition that the correct rejection rate is 81%.

Computational information geometry and its applications

Digitization is the main feature of modern Information Science. Conjoining the digits and the coordinates, the relation between Information Science and high-dimensional space is consanguineous, and the information issues are transformed to the geometry problems in some high-dimensional spaces. From this basic idea, we propose Computational Information Geometry (CIG) to make information analysis and processing. Two kinds of applications of CIG are given, which are blurred image restoration and pattern recognition. Experimental results are satisfying. And in this paper, how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is also introduced. Lots of the algorithms have been realized using software.

Deterministic Column-Based Matrix Decomposition

In this paper, we propose a deterministic column-based matrix decomposition method. Conventional column-based matrix decomposition (CX) computes the columns by randomly sampling columns of the data matrix. Instead, the newly proposed method (termed as CX_D) selects columns in a deterministic manner, which well approximates singular value decomposition. The experimental results well demonstrate the power and the advantages of the proposed method upon three real-world data sets.

CHARACTERISTICS OF THE MAGNETIC DEPOPULATION OF SUBBANDS IN VERY NARROW SYSTEMS

We present a model for electrons confined in narrow conducting channels by a parabolic well under moderate to high magnetic fields which takes into account a cutoff in the filling of the subbands. Such a cutoff gives rise to energy-separated subbands and a two-dimensional (2D) like subband depopulation, resulting in a relation between sublevel index n and inverse magnetic field B-1 such that in the high-field regime it changes over to the well-known 2D form as expected, and in the moderate field regime it shows pronounced deviation from linearity. This agrees well with the experimental results. The linear region of the n-B-1 experimental plot is believed to arise from the two dimensionality of the system. Calculations show that no resolvable 1D sublevel exists in the 0.5-mu-m-wide wire at very small magnetic fields (including zero field), which agrees qualitatively with the experimental results found in other wires that the Hall resistance, R(H), approaches its classical value B/n(e)e in this region and R(H) = 0 at B = 0, where n(e) is the electron concentration. In this model the linear and nonlinear regions in the experimental n-B-1 plot are used to extract the characteristic frequency omega-0, and the effective 2D electron concentration N(e)2D, respectively.

An integrated aurora image retrieval system: AuroraEye

With the digital all-sky imager (ASI) emergence in aurora research, millions of images are captured annually. However, only a fraction of which can be actually used. To address the problem incurred by low efficient manual processing, an integrated image analysis and retrieval system is developed. For precisely representing aurora image, macroscopic and microscopic features are combined to describe aurora texture. To reduce the feature dimensionality of the huge dataset, a modified local binary pattern (LBP) called ALBP is proposed to depict the microscopic texture, and scale-invariant Gabor and orientation-invariant Gabor are employed to extract the macroscopic texture. A physical property of aurora is inducted as region features to bridge the gap between the low-level visual features and high-level semantic description. The experiments results demonstrate that the ALBP method achieves high classification rate and low computational complexity. The retrieval simulation results show that the developed retrieval system is efficient for huge dataset. (c) 2010 Elsevier Inc. All rights reserved.

Discriminative Orthogonal Neighborhood-Preserving Projections for Classification

Orthogonal neighborhood-preserving projection (ONPP) is a recently developed orthogonal linear algorithm for overcoming the out-of-sample problem existing in the well-known manifold learning algorithm, i.e., locally linear embedding. It has been shown that ONPP is a strong analyzer of high-dimensional data. However, when applied to classification problems in a supervised setting, ONPP only focuses on the intraclass geometrical information while ignores the interaction of samples from different classes. To enhance the performance of ONPP in classification, a new algorithm termed discriminative ONPP (DONPP) is proposed in this paper. DONPP 1) takes into account both intraclass and interclass geometries; 2) considers the neighborhood information of interclass relationships; and 3) follows the orthogonality property of ONPP. Furthermore, DONPP is extended to the semisupervised case, i.e., semisupervised DONPP (SDONPP). This uses unlabeled samples to improve the classification accuracy of the original DONPP. Empirical studies demonstrate the effectiveness of both DONPP and SDONPP.

Evaluation of a combined wavelet and a combined principal component analysis classification system for BCG diagnostic problem

Heart disease is one of the main factor causing death in the developed countries. Over several decades, variety of electronic and computer technology have been developed to assist clinical practices for cardiac performance monitoring and heart disease diagnosis. Among these methods, Ballistocardiography (BCG) has an interesting feature that no electrodes are needed to be attached to the body during the measurement. Thus, it is provides a potential application to asses the patients heart condition in the home. In this paper, a comparison is made for two neural networks based BCG signal classification models. One system uses a principal component analysis (PCA) method, and the other a discrete wavelet transform, to reduce the input dimensionality. It is indicated that the combined wavelet transform and neural network has a more reliable performance than the combined PCA and neural network system. Moreover, the wavelet transform requires no prior knowledge of the statistical distribution of data samples and the computation complexity and training time are reduced.

一种基于改进LLE方法的传感器故障诊断方法研究

针对非线性系统传感器故障诊断难以解决的问题,提出了一种新的基于局部嵌入映射(LLE)的方法,解决了非线性数据的特征映射问题。首先,改进了基于分形维估计的内在维数的估计,通过线性拟合解决了线性区域的自动确定。然后,将故障状态与空间分布结合起来,通过确定数据点在空间超球内的分布完成故障的检测,在这个过程中将超球的确定与LLE算法中基于核函数的样本外数据扩展结合起来,大大减少了计算量,提高了算法的实时性,从而为复杂非线性传感器的故障诊断提供了一种新的有效的方法。

Restructuring Sparse High Dimensional Data for Effective Retrieval

The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, documents and queries are represented as vectors of word counts. In its simplest form, relevance is defined to be the dot product between a document and a query vector--a measure of the number of common terms. A central difficulty in text retrieval is that the presence or absence of a word is not sufficient to determine relevance to a query. Linear dimensionality reduction has been proposed as a technique for extracting underlying structure from the document collection. In some domains (such as vision) dimensionality reduction reduces computational complexity. In text retrieval it is more often used to improve retrieval performance. We propose an alternative and novel technique that produces sparse representations constructed from sets of highly-related words. Documents and queries are represented by their distance to these sets. and relevance is measured by the number of common clusters. This technique significantly improves retrieval performance, is efficient to compute and shares properties with the optimal linear projection operator and the independent components of documents.

Fast Pose Estimation with Parameter Sensitive Hashing

Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensional problems such as pose estimation, the number of required examples and the computational complexity rapidly becme prohibitively high. We introduce a new algorithm that learns a set of hashing functions that efficiently index examples relevant to a particular estimation task. Our algorithm extends a recently developed method for locality-sensitive hashing, which finds approximate neighbors in time sublinear in the number of examples. This method depends critically on the choice of hash functions; we show how to find the set of hash functions that are optimally relevant to a particular estimation problem. Experiments demonstrate that the resulting algorithm, which we call Parameter-Sensitive Hashing, can rapidly and accurately estimate the articulated pose of human figures from a large database of example images.