By Topic

A chaotic map algorithm for knowledge discovery in time series: a case study on biomedical signals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. Bellotti ; Dipt. di Fisica, Univ. degli Studi di Bari, Italy ; M. Castellano ; F. De Carlo

A chaotic map algorithm is proposed to study similarity-based knowledge of temporal patterns. Several information sources can be regarded as time series, both in scientific and technological fields such as nuclear physics, computer network, biomedical signals, and many others. The application of an automatic knowledge discovery mechanism has a strong impact on system science and engineering. The advantage of the proposed algorithm is due to its capability to extract meaningful features from complex data sets, as temporal patterns, without teacher. A case study has been carried on biomedical signals, such as electroencephalographic records, to recognize patterns affected by the Huntington's disease, one of the most dangerous pathology of the central nervous system. The chaotic map algorithm succeeds in distinguishing between pathological and normal patterns, with high values of both sensitivity and specificity.

Published in:

IEEE Transactions on Nuclear Science  (Volume:51 ,  Issue: 3 )