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 条
  • [31] Regularized k-means clustering of high-dimensional data and its asymptotic consistency
    Sun, Wei
    Wang, Junhui
    Fang, Yixin
    ELECTRONIC JOURNAL OF STATISTICS, 2012, 6 : 148 - 167
  • [32] IFKMHC: Implicit Fuzzy K-Means Model for High-Dimensional Data Clustering
    Shi, Zhaoyin
    Chen, Long
    Ding, Weiping
    Zhong, Xiaopin
    Wu, Zongze
    Chen, Guang-Yong
    Zhang, Chuanbin
    Wang, Yingxu
    Chen, C. L. Philip
    IEEE TRANSACTIONS ON CYBERNETICS, 2024, : 1 - 14
  • [33] A bad instance for k-means plus
    Brunsch, Tobias
    Roeglin, Heiko
    THEORETICAL COMPUTER SCIENCE, 2013, 505 : 19 - 26
  • [34] A Bad Instance for k-Means plus
    Brunsch, Tobias
    Roeglin, Heiko
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 344 - 352
  • [35] K-MEANS plus : A DEVELOPED CLUSTERING ALGORITHM FOR BIG DATA
    Niu, Kun
    Gao, Zhipeng
    Jiao, Haizhen
    Deng, Nanjie
    PROCEEDINGS OF 2016 4TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS (IEEE CCIS 2016), 2016, : 141 - 144
  • [36] Fast Scalable k-means plus plus Algorithm with MapReduce
    Xu, Yujie
    Qu, Wenyu
    Li, Zhiyang
    Ji, Changqing
    Li, Yuanyuan
    Wu, Yinan
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2014, PT II, 2014, 8631 : 15 - 28
  • [37] Face hallucination with K-means plus plus dictionary learning
    Chen, Zhenxue
    Li, Jiadi
    Liu, Chengyun
    MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (17-18) : 11685 - 11698
  • [38] Collaborative annealing power k-means plus plus clustering
    Li, Hongzong
    Wang, Jun
    KNOWLEDGE-BASED SYSTEMS, 2022, 255
  • [39] Using k-Means plus plus Algorithm for Researchers Clustering
    Rukmi, Alvida Mustika
    Iqbal, Ikhwan Muhammad
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION: EMPOWERING ENGINEERING USING MATHEMATICS, 2017, 1867
  • [40] Recombinator-k-Means: An Evolutionary Algorithm That Exploits k-Means plus plus for Recombination
    Baldassi, Carlo
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (05) : 991 - 1003