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

被引:5
|
作者
Nasibov, Efendi N. [1 ]
Peker, Sinem [2 ]
机构
[1] Dokuz Eylul Univ, Fac Sci, Dept Comp Sci, TR-35160 Izmir, Turkey
[2] Yasar Univ, Fac Sci & Letters, Dept Stat, TR-35100 Izmir, Turkey
关键词
Time series; Clustering; FCM; K-nearest neighbor; Bispectral index; CLUSTER VALIDITY; MODEL;
D O I
10.1016/j.eswa.2010.09.147
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:5028 / 5035
页数:8
相关论文
共 50 条
  • [31] Work in Progress: K-Nearest Neighbors Techniques for ABAC Policies Clustering
    Benkaouz, Yahya
    Erradi, Mohammed
    Freisleben, Bernd
    ABAC'16: PROCEEDINGS OF THE 2016 ACM INTERNATIONAL WORKSHOP ON ATTRIBUTE BASED ACCESS CONTROL, 2016, : 72 - 75
  • [32] On Application of a Probabilistic K-Nearest Neighbors Model for Cluster Validation Problem
    Volkovich, Zeev
    Barzily, Zeev
    Avros, Renata
    Toledano-Kitai, Dvora
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2011, 40 (16) : 2997 - 3010
  • [33] Oversampling by genetic algorithm and k-nearest neighbors for network intrusion problem
    Jindaluang, Wattana
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 43 (03) : 2515 - 2528
  • [34] NNVDC: A new versatile density-based clustering method using k-Nearest Neighbors
    Prasad, Rabinder Kumar
    Sarmah, Rosy
    Chakraborty, Subrata
    Sarmah, Sauravjyoti
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 227
  • [35] Hybrid model for predicting an unknown process based on a cluster version of the K-nearest neighbors method
    Ruslan, Gatin
    Svetlana, Novikova
    Natalia, Valitova
    Elmira, Kremleva
    2024 3RD INTERNATIONAL CONFERENCE ON ROBOTICS, ARTIFICIAL INTELLIGENCE AND INTELLIGENT CONTROL, RAIIC 2024, 2024, : 419 - 422
  • [36] ANALYSIS OF CUSTOMER CHURN PREDICTION USING LOGISTIC REGRESSION, k-NEAREST NEIGHBORS, DECISION TREE AND RANDOM FOREST ALGORITHMS
    Atay, Mehmet Tarik
    Turanli, Munevver
    ADVANCES AND APPLICATIONS IN STATISTICS, 2025, 92 (02) : 147 - 169
  • [37] Mining Spatial High Utility Core Patterns under k-Nearest Neighbors
    Luo J.
    Wang L.-Z.
    Wang X.-X.
    Xiao Q.
    Jisuanji Xuebao/Chinese Journal of Computers, 2022, 45 (02): : 354 - 368
  • [38] Ensemble Learning with Extremely Randomized k-Nearest Neighbors for Accurate and Efficient Classification
    Saber, Abid
    Abbas, Moncef
    Fergani, Belkacem
    NEW GENERATION COMPUTING, 2025, 43 (01)
  • [39] Frequency-based k-Nearest Neighbors algorithm for electromechanical impedance based detection of damage in adhesive joints
    Tenreiro, A. Francisco G.
    Lopes, Antonio M.
    da Silva, Lucas F. M.
    APPLIED SOFT COMPUTING, 2025, 171
  • [40] Combining Fourier and lagged k-nearest neighbor imputation for biomedical time series data
    Rahman, Shah Atiqur
    Huang, Yuxiao
    Claassen, Jan
    Heintzman, Nathaniel
    Kleinberg, Samantha
    JOURNAL OF BIOMEDICAL INFORMATICS, 2015, 58 : 198 - 207