Engineering topics
Publications and source records attributed to Omalley, M. J..
In this paper, we develop a family of Neuberger-like results to find points z epsilon H satisfying L(z)z = z and P(z) = z. This family includes Neuberger's theorem and has the additional property that most of the sequences q sub n converge to idempotent elements of B sub 1(H).
A bounded operator A on a Hilbert space H was positive. These operators were symmetric, and as such constitute a natural generalization of nonnegative real diagonal matrices. The following result is thus both well known and not surprising: A positive operator has a unique positive square root (under operator composition).
The analysis concerns the role of eigenvalues in determining a particular measure of pattern class distinction called the divergence, which is the pairwise average of the expected interclass divergence derived from Hajek's two-class divergence. Decel and Quirein (1973) showed that there always exists a k x n real matrix B such that the transformation determined by B maximizes divergence in k-dimensional space, and that B can be written as a product involving an orthogonal n x n matrix U. In the present paper it is shown that divergence measure of pattern class distinction does not depend on the eigenvalues of U.
A particular measure of pattern class distinction called the average interclass divergence, or more simply, divergence, is considered. Here divergence will be the pairwise average of the expected interclass divergence derived from Hajek's two-class divergence.
The paper shows that it is possible to construct two k x n matrices, both of which maximize divergence in the transformed space of the linear feature selection problem in multiclass pattern recognition, and which are not row equivalent. Thus, even under extremely strong conditions, it is not possible to assume that all matrix solutions which maximize transformed divergence are row equivalent.
The linear feature selection problem in multi-class pattern recognition is described as that of linearly transforming statistical information from n-dimensional (real Euclidean) space into k-dimensional space, while requiring that average interclass divergence in the transformed space decrease as little as possible. Divergence is the expected interclass divergence derived from Hajek two-class divergence; it is known that there always exists a k x n matrix B such that the transformation determined by B maximizes the divergence in k-dimensional space. It is known that, if Q is any k x k invertible matrix, and B is as defined above, then QB again maximizes the divergence in k-space. It is shown that the converse of this result is false: two matrices exist, B sub 1 and B sub 2, each of which maximizes transformed divergence, which are not related in the fashion B sub 2 = QB sub 1 for any k x k matrix Q.
Techniques for solving the feature selection problem are presented. Topics discussed include the reduction of the number of variables in "best b", and the iterative selection of H sub i.
Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.
Theoretical method of numerical integration of definite integral f/t/ dt