Abstract

A new methodology, a Kullback Leibler-nearest neighbor (KL-NN) rule method is introduced for the EEG population screening problem. It is applied to the classification of anesthesia levels of humans in surgery by the analysis of EEGs alone. Stationary epoch multichannel EEGs are considered. In the EEG population screening problem, the category or state of an individual is classified by comparison of his/her EEG with labeled sample EEGs taken from other individuals. In the KL-NN method, a measure of dissimilarity is computed between a new to-be-classified EEG and each of the labeled sample EEGs. The measure of dissimilarity is a Kullback Leibler measure of the dissimilarity between the sample covariance functions of the EEG time series, computed as if the EEGs were Gaussian distributed. The new EEG is classified to have the same categorical label of its nearest neighbor EEG, (or of a majority of its nearest neighbor EEGs) in the minimum KL number sense. The KL-NN rule has the important statistical property that, with only a relatively small number of categorically labeled sample EEGs, the KL-NN rules yield a statistically reliable estimate of the best achievable discriminability between categorical EEG populations. In an application of the KL-NN rule method, the level of anesthesia insufficient for deep surgery was distinguished from the anesthesia level sufficient for deep surgery on humans in surgery under halothane-nitrous oxide anesthesia. Analysis was carried out on 20- sec EEG epochs from 18 different individuals. The results were that the probabilities of correct classification of anesthesia levels, based on the analysis of two and four EEG data channels, were 85 and 89% respectively. Ninty-seven percent of 62 independent two-channel EEGs, from the same 18- individual population, were classified correctly against the labeled sample EEG däta.

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.