首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal linear combinations using householder transformations
Authors:Henry P Decell Jr  W G Smiley III
Institution:Department of Mathematics , University of Houston ,
Abstract:In pattern classification of sampled vector valued random variables it is often essential, due to computational and accuracy considerations, to consider certain measurable transformations of the random variable. These transformations are generally of a dimension-reducing nature. In this paper we consider the class of linear dimension reducing transformations, i.e., the k × n matrices of rank k where k < n and n is the dimension of the range of the sampled vector random variable.

In this connection, we use certain results (Decell and Quirein, 1973), that guarantee, relative to various class separability criteria, the existence of an extremal transformation. These results also guarantee that the extremal transformation can be expressed in the form (Ik∣ Z)U where Ik is the k × k identity matrix and U is an orthogonal n × n matrix. These results actually limit the search for the extremal linear transformation to a search over the obviously smaller class of k × n matrices of the form (Ik ∣Z)U. In this paper these results are refined in the sense that any extremal transformation can be expressed in the form (IK∣Z)Hp … H1 where p ≤ min{k, n?k} and Hi is a Householder transformation i=l,…, p, The latter result allows one to construct a sequence of transformations (LK∣ Z)H1, (IK Z)H2H1 … such that the values of the class separability criterion evaluated at this sequence is a bounded, monotone sequence of real numbers. The construction of the i-th element of the sequence of transformations requires the solution of an n-dimensional optimization problem. The solution, for various class separability criteria, of the optimization problem will be the subject of later papers. We have conjectured (with supporting theorems and empirical results) that, since the bounded monotone sequence of real class separability values converges to its least upper bound, this least upper bound is an extremal value of the class separability criterion.

Several open questions are stated and the practical implications of the results are discussed.
Keywords:feature selection  classification  class separability  data compression  pattern recognition
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号