MORe plus plus : k-Means Based Outlier Removal on High-Dimensional Data

被引:0
|
作者
Beer, Anna [1 ]
Lauterbach, Jennifer [1 ]
Seidl, Thomas [1 ]
机构
[1] Ludwig Maximilians Univ Munchen, Munich, Germany
关键词
Outlier detection; High-dimensional; Histogram-based; K-means; HISTOGRAM;
D O I
10.1007/978-3-030-32047-8_17
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
MORe++ is a k-Means based Outlier Removal method working on high dimensional data. It is simple, efficient and scalable. The core idea is to find local outliers by examining the points of different k-Means clusters separately. Like that, one-dimensional projections of the data become meaningful and allow to find one-dimensional outliers easily, which else would be hidden by points of other clusters. MORe++ does not need any additional input parameters than the number of clusters k used for k-Means, and delivers an intuitively accessible degree of outlierness. In extensive experiments it performed well compared to k-Means-- and ORC.
引用
收藏
页码:188 / 202
页数:15
相关论文
共 50 条
  • [1] Efficient High-Dimensional Kernel k-Means plus plus with Random Projection
    Chan, Jan Y. K.
    Leung, Alex Po
    Xie, Yunbo
    APPLIED SCIENCES-BASEL, 2021, 11 (15):
  • [2] k-variates plus plus : more pluses in the k-means plus
    Nock, Richard
    Canyasse, Raphael
    Boreli, Roksana
    Nielsen, Frank
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [3] Improved Guarantees for k-means plus plus and k-means plus plus Parallel
    Makarychev, Konstantin
    Reddy, Aravind
    Shan, Liren
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [4] Exact Acceleration of K-Means plus plus and K-Means∥
    Raff, Edward
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2928 - 2935
  • [5] Sparse kernel k-means for high-dimensional data
    Guan, Xin
    Terada, Yoshikazu
    PATTERN RECOGNITION, 2023, 144
  • [6] Variance Based Data Fusion for K-Means plus
    Satish, V
    Kumar, Arun Raj P.
    2017 2ND INTERNATIONAL CONFERENCE FOR CONVERGENCE IN TECHNOLOGY (I2CT), 2017, : 742 - 746
  • [7] Solving k-means on High-Dimensional Big Data
    Kappmeier, Jan-Philipp W.
    Schmidt, Daniel R.
    Schmidt, Melanie
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 259 - 270
  • [8] Outlier Robust Geodesic K-means Algorithm for High Dimensional Data
    Hassanzadeh, Aidin
    Kaarna, Arto
    Kauranne, Tuomo
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2016, 2016, 10029 : 252 - 262
  • [9] Robust and sparse k-means clustering for high-dimensional data
    Brodinova, Sarka
    Filzmoser, Peter
    Ortner, Thomas
    Breiteneder, Christian
    Rohm, Maia
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2019, 13 (04) : 905 - 932
  • [10] Robust and sparse k-means clustering for high-dimensional data
    Šárka Brodinová
    Peter Filzmoser
    Thomas Ortner
    Christian Breiteneder
    Maia Rohm
    Advances in Data Analysis and Classification, 2019, 13 : 905 - 932