Dimensionality Reduction For Pattern Recognition Publisher's description
from Luigi Rosa
Advances in data collection and storage capabilities during the past decades have led to an information overload in most sciences.
Advances in data collection and storage capabilities during the past decades have led to an information overload in most sciences. Researchers working in domains as diverse as engineering, astronomy, biology, remote sensing, economics, and consumer transactions, face larger and larger observations and simulations on a daily basis. Such datasets, in contrast with smaller, more traditional datasets that have been studied extensively in the past, present new challenges in data analysis. Traditional statistical methods break down partly because of the increase in the number of observations, but mostly because of the increase in the number of variables associated with each observation. The dimension of the data is the number of variables that are measured on each observation. High-dimensional datasets present many mathematical challenges as well as some opportunities, and are bound to give rise to new theoretical developments. One of the problems with high-dimensional datasets is that, in many cases, not all the measured variables are вЂњimportantвЂќ for understanding the underlying phenomena of interest. While certain computationally expensive novel methods can construct predictive models with high accuracy from high-dimensional data, it is still of interest in many applications to reduce the dimension of the original data prior to any modeling of the data. In mathematical terms, the problem can be stated as follows: given the random variable p-dimensional x = (x1,вЂ¦, xp), find a lower dimensional representation of it, s = (s1,вЂ¦, sk) with k<=p, that captures the content in the original data, according to some criterion. The components of s are sometimes called the hidden components. Different fields use different names for the the term вЂњvariableвЂќ is mostly used in statistics, while вЂњfeatureвЂќ and вЂњattributeвЂќ are alternatives commonly used in the computer science and machine learning literature. We have developed an algorithm for face recognition based on Hierachical Dimensionality Reduction: we show that the proposed method is an efficient way of representing face patterns as well as reducing dimension of multidimensional feature.
System Requirements:В· Matlab
Program Release Status: New Release
Program Install Support: Install and Uninstall