Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.


Science 13 July 1979:
Vol. 205. no. 4402, pp. 193 - 195
DOI: 10.1126/science.451587

Articles

Science, Vol 205, Issue 4402, 193-195
Copyright © 1979 by American Association for the Advancement of Science


articles

Automatic classification of electroencephalograms: Kullback-Leibler nearest neighbor rules

W Gersch, F Martinelli, J Yonemoto, MD Low, and JA Mc Ewan

A prototypic problem in screening of electroencephalograms in the automatic classification of stationary electroencephalogram time series is treated here by the Kullback-Leibler nearest neighbor rule approach. In that problem, the category or state of an individual is classified by comparison of his or her electroencephalogram with those taken from other individuals in the alternative categories. The Kullback-Leibler nearest neighbor classification rules yield a statistically reliable estimate of the smallest possible probability of electroencephalogram misclassification with a relatively small number of labeled sample electroencephalograms. The automatic classification of anesthesia levels L1 and L3, respectively the anesthesia levels insufficient and sufficient for deep surgery, is treated by machine computation on the electroencephalogram alone.





To Advertise     Find Products


Science. ISSN 0036-8075 (print), 1095-9203 (online)