Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures

L.D. Iasemidis (), P. Pardalos (), J.C. Sackellares () and D.-S. Shiau ()
Additional contact information
L.D. Iasemidis: Arizona State University
P. Pardalos: University of Florida
J.C. Sackellares: University of Florida
D.-S. Shiau: University of Florida

Journal of Combinatorial Optimization, 2001, vol. 5, issue 1, No 2, 9-26

Abstract: Abstract Epilepsy is one of the most common disorders of the nervous system. The progressive entrainment between an epileptogenic focus and normal brain areas results to transitions of the brain from chaotic to less chaotic spatiotemporal states, the epileptic seizures. The entrainment between two brain sites can be quantified by the T-index from the measures of chaos (e.g., Lyapunov exponents) of the electrical activity (EEG) of the brain. By applying the optimization theory, in particular quadratic zero-one programming, we were able to select the most entrained brain sites 10 minutes before seizures and subsequently follow their entrainment over 2 hours before seizures. In five patients with 3–24 seizures, we found that over 90% of the seizures are predictable by the optimal selection of electrode sites. This procedure, which is applied to epilepsy research for the first time, shows the possibility of prediction of epileptic seizures well in advance (19.8 to 42.9 minutes) of their occurrence.

Keywords: epileptic seizures; Lyapunov exponents; entrainment; T-statistic; optimization (search for similar items in EconPapers)
Date: 2001
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009877331765 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:5:y:2001:i:1:d:10.1023_a:1009877331765

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009877331765

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().