Distributed Fair k-Center Clustering Problems with Outliers

被引：2
|
作者：
Yuan, Fan [1 ]
Diao, Luhong [1 ]
Du, Donglei [2 ]
Liu, Lei [1 ]
机构：
[1] Beijing Univ Technol, Dept Operat Res & Informat Engn, Beijing 100124, Peoples R China
[2] Univ New Brunswick, Fac Management, Fredericton, NB E3B 5A3, Canada
来源：
PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT 2021 | 2022年 / 13148卷
基金：
北京市自然科学基金; 加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词：
Clustering problem; Approximate algorithm; Fair k-center problem with outliers; Distributed fair k-center problem with outliers;
D O I：
10.1007/978-3-030-96772-7_39
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Big data clustering is a fundamental problem with a vast number of applications. Due to the increasing size of data, interests in clustering problems in distributed computation models have increased. On the other hand, because important decision making is being automated with the help of algorithms, therefore, fairness in algorithms has become an especially important research topic. In this work, we design new distributed algorithms for the fair k-center problem with outliers. Our main contributions are: (1) In the fair k-center problem with outliers setting we give a 4-approximation ratio algorithm. (2) In the distributed fair k-center problem with outliers setting we give a 18-approximation ratio algorithm.
引用
收藏
页码：430 / 440
页数：11
相关论文
共 50 条
  • [21] KFC: A Scalable Approximation Algorithm for k-center Fair Clustering
    Harb, Elfarouk
    Shan, Lam Ho
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [22] A New Notion of Individually Fair Clustering: α-Equitable k-Center
    Chakrabarti, Darshan
    Dickerson, John P.
    Esmaeili, Seyed A.
    Srinivasan, Aravind
    Tsepenekas, Leonidas
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 151, 2022, 151 : 6387 - 6408
  • [23] Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
    Ding, Hu
    Yu, Haikuo
    Wang, Zixiu
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [24] Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially
    Ceccarello, Matteo
    Pietracaprina, Andrea
    Pucci, Geppino
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (07): : 766 - 778
  • [25] A Pairwise Fair and Community-preserving Approach to k-Center Clustering
    Brubach, Brian
    Chakrabarti, Darshan
    Dickerson, John P.
    Khuller, Samir
    Srinivasan, Aravind
    Tsepenekas, Leonidas
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [26] A Pairwise Fair and Community-preserving Approach to k-Center Clustering
    Brubach, Brian
    Chakrabarti, Darshan
    Dickerson, John P.
    Khuller, Samir
    Srinivasan, Aravind
    Tsepenekas, Leonidas
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [27] Extreme k-Center Clustering
    Bateni, MohammadHossein
    Esfandiari, Hossein
    Fischer, Manuela
    Mirrokni, Vahab
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 3941 - 3949
  • [28] On Parallel k-Center Clustering
    Coy, Sam
    Czumaj, Artur
    Mishra, Gopinath
    PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 65 - 75
  • [29] Streaming Fair k-Center Clustering over Massive Dataset with Performance Guarantee
    Lin, Zeyu
    Guo, Longkun
    Jia, Chaoqi
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PT III, PAKDD 2024, 2024, 14647 : 105 - 117
  • [30] k-Clustering with Fair Outliers
    Almanza, Matteo
    Epasto, Alessandro
    Panconesi, Alessandro
    Re, Giuseppe
    WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2022, : 5 - 15
12345