### Abstract

A nonparametric sequential pathyutern classifier called a linear sequential classifier (LSC) is presented. The pattern_components are measured sequentially and the decisions either to measure the next component or to stop and classify the pattern are made using linear functions derived from sample patterns based on the least mean-square error criterion. The required linear functions are computed using an adaptlon of GrevilJe's recursive algorithm for computing the generalized inverse of a matrix. A recursive algorithm for computing the least mean-square error is given and is used to determine the order in which the pattern components are measured. Under the assumption of two equiprobable classes that are normally distributed with equal covariance matrices, it is shown that the LSC is equivalent to Wald's sequential probability ratio test. Computer-simulated experiments indicate that the LSC is more effective than existing nonparametric sequential classifiers.

Original language | English (US) |
---|---|

Pages (from-to) | 673-678 |

Number of pages | 6 |

Journal | IEEE Transactions on Information Theory |

Volume | 18 |

Issue number | 5 |

DOIs | |

State | Published - Sep 1972 |

Externally published | Yes |

### ASJC Scopus subject areas

- Information Systems
- Computer Science Applications
- Library and Information Sciences

## Fingerprint Dive into the research topics of 'Linear Sequential Pattern Classification'. Together they form a unique fingerprint.

## Cite this

*IEEE Transactions on Information Theory*,

*18*(5), 673-678. https://doi.org/10.1109/TIT.1972.1054882