Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.