Time series labeling algorithms based on the K-nearest neighbors' frequencies

Loading...
Publication Logo

Date

2011

Authors

Efendi N. Nasibov
Sinem Peker

Journal Title

Journal ISSN

Volume Title

Publisher

PERGAMON-ELSEVIER SCIENCE LTD

Open Access Color

Green Open Access

Yes

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Average

Research Projects

Journal Issue

Abstract

In the current paper time series labeling task is analyzed and some solution algorithms are presented. In these algorithms fuzzy c-means clustering which is one of the unsupervised learning methods is used to obtain the labels of the time series. Then K-nearest neighborhood (KNN) rule is performed on the labels to obtain more relevant smooth intervals. As an application the handled labeling algorithms are performed on bispectral index (BIS) data which are time series measures of brain activity. Finally smoothing process is found useful in the estimation of sedation stage labels. (C) 2010 Elsevier Ltd. All rights reserved.

Description

Keywords

Time series, Clustering, FCM, K-nearest neighbor, Bispectral index, CLUSTER VALIDITY, MODEL

Fields of Science

0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Citation

WoS Q

Scopus Q

OpenCitations Logo
OpenCitations Citation Count
4

Source

Expert Systems with Applications

Volume

38

Issue

Start Page

5028

End Page

5035
PlumX Metrics
Citations

CrossRef : 4

Scopus : 4

Captures

Mendeley Readers : 16

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.6843

Sustainable Development Goals

SDG data is not available