Algorithms of Machine Learning for K-Clustering

被引:0
|
作者
Luis Castillo, S. Jose [1 ]
Fernandez del Castillo, Jose R. [1 ]
Gonzalez Sotos, Leon [1 ]
机构
[1] Univ Alcala de Henares, Dept Comp Sci, Madrid 28871, Spain
关键词
Machine Learning; Data Mining; Evolutionary Algorithm; algorithms;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Machine learning is a scientific discipline that is concerned with the design and development of algorithms that allow computers to change behavior based on data, such as from sensor data or databases. They exist a number of authors have applied genetic algorithms (GA) to the problem of K-clustering, where the required number of clusters is known. Various algorithms are used to enable the GAs to cluster and to enhance their performance, but there is little or no comparison between the different algorithms. It is not clear which algorithms are best suited to the clustering problem, or how any adaptions will affect GA performance for differing data sets. In this article we shall compare a number of algorithms of GA appropriate for the k-clustering problem with some distributions of the collections Reuters 21578, including some used for more general grouping problem.
引用
收藏
页码:443 / 452
页数:10
相关论文
共 50 条
  • [1] Sliding Window Algorithms for k-Clustering Problems
    Borassi, Michele
    Epasto, Alessandro
    Lattanzi, Silvio
    Vassilviskii, Sergei
    Zadimoghaddam, Morteza
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [2] Better Algorithms for Individually Fair k-Clustering
    Chakrabarty, Deeparnab
    Negahbani, Maryam
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [3] Algorithms for fair k-clustering with multiple protected attributes
    Bohm, Matteo
    Fazzone, Adriano
    Leonardi, Stefano
    Menghini, Cristina
    Schwiegelshohn, Chris
    [J]. OPERATIONS RESEARCH LETTERS, 2021, 49 (05) : 787 - 789
  • [4] Efficient Online Learning for Dynamic k-Clustering
    Fotakis, Dimitris
    Piliouras, Georgios
    Skoulakis, Stratis
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [5] Consistent k-Clustering
    Lattanzi, Silvio
    Vassilvitskii, Sergei
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [6] Distributed k-clustering algorithms for random wireless multihop networks
    Ravelomanana, V
    [J]. NETWORKING - ICN 2005, PT 1, 2005, 3420 : 109 - 116
  • [7] On approximate geometric k-clustering
    Matousek, J
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2000, 24 (01) : 61 - 84
  • [8] Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median
    Behsaz, Babak
    Friggstad, Zachary
    Salavatipour, Mohammad R.
    Sivakumar, Rohit
    [J]. ALGORITHMICA, 2019, 81 (03) : 1006 - 1030
  • [9] k-Clustering with Fair Outliers
    Almanza, Matteo
    Epasto, Alessandro
    Panconesi, Alessandro
    Re, Giuseppe
    [J]. WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2022, : 5 - 15
  • [10] Variance-based k-clustering algorithms by Voronoi diagrams and randomization
    Inaba, M
    Katoh, N
    Imai, H
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (06) : 1199 - 1206