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 条
  • [41] Cuckoo, Bat and Krill Herd based k-means plus plus clustering algorithms
    Aggarwal, Shruti
    Singh, Paramvir
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 6): : 14169 - 14180
  • [42] Mrmr plus and Cfs plus feature selection algorithms for high-dimensional data
    Angulo, Adrian Pino
    Shin, Kilho
    APPLIED INTELLIGENCE, 2019, 49 (05) : 1954 - 1967
  • [43] Fast and Robust K-means Clustering via Feature Learning on High-dimensional Data
    Wang, Xiao-dong
    Chen, Rung-Ching
    Yan, Fei
    2017 IEEE 8TH INTERNATIONAL CONFERENCE ON AWARENESS SCIENCE AND TECHNOLOGY (ICAST), 2017, : 194 - 198
  • [44] An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data
    Jing, Liping
    Ng, Michael K.
    Huang, Joshua Zhexue
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (08) : 1026 - 1041
  • [45] The Sparse MinMax k-Means Algorithm for High-Dimensional Clustering
    Dey, Sayak
    Das, Swagatam
    Mallipeddi, Rammohan
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 2103 - 2110
  • [46] Discriminative fuzzy K-means clustering with local structure preservation for high-dimensional data
    Yu, Yu-Feng
    Wei, Peiwen
    Wu, Xiaoling
    Feng, Qiying
    Zhang, Chuanbin
    Knowledge-Based Systems, 2024, 304
  • [47] Image Forgery Detection based on SIFT and k-means plus
    Baykal, Elif
    Ustubioglu, Beste
    Ulutas, Guzin
    2016 39TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2016, : 474 - 477
  • [48] User Value Identification Based on Improved RFM Model and K-Means plus plus Algorithm for Complex Data Analysis
    Wu, Jun
    Shi, Li
    Yang, Liping
    Niu, Xiaxia
    Li, Yuanyuan
    Cui, Xiaodong
    Tsai, Sang-Bing
    Zhang, Yunbo
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
  • [49] Nystrom Method with Kernel K-means plus plus Samples as Landmarks
    Oglic, Dino
    Gartner, Thomas
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [50] A Better k-means plus plus Algorithm via Local Search
    Lattanzi, Silvio
    Sohler, Christian
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97