An incremental facility location clustering with a new hybrid constrained pseudometric

被引:0
|
作者
Bayer, Tomas [1 ]
Kolingerova, Ivana [2 ]
Potuckova, Marketa [1 ]
Cabelka, Miroslav [1 ]
Stefanova, Eva [1 ]
机构
[1] Charles Univ Prague, Fac Sci, Dept Appl Geoinformat & Cartog, Albertov 7, Prague, Czech Republic
[2] Univ West Bohemia, Fac Appl Sci, Dept Comp Sci & Engn, Tech 8, Plzen, Czech Republic
关键词
Facility location; Clusterization; Pseudometric; Detection; Simplification; Point cloud; POINT CLOUD SIMPLIFICATION; ALGORITHM; REDUCTION;
D O I
10.1016/j.patcog.2023.109520
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Euclidean metric, one of the classical similarity measures applied in clustering algorithms, has drawbacks when applied to spatial clustering. The resulting clusters are spherical and similarly sized, and the edges of objects are considerably smoothed. This paper proposes a novel hybrid constrained pseudometric formed by the linear combination of the Euclidean metric and a pseudometric plus penalty. The pseudometric is used in a new deterministic incremental heuristic facility location algorithm (IHFL). Our method generates larger, isotropic, and partially overlapping clusters of different sizes and spatial densities, better adapting to the surface complexity than the classical non-deterministic clustering. Cluster properties are used to derive new features for supervised/unsupervised learning. Possible applications are the classification of point clouds, their simplification, detection, filtering, and extraction of different structural patterns or sampled objects. Experiments were run on point clouds derived from laser scanning and images. (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] The incremental connected facility location problem
    Arulselvan, Ashwin
    Bley, Andreas
    Ljubic, Ivana
    COMPUTERS & OPERATIONS RESEARCH, 2019, 112
  • [2] On constrained facility location problems
    Li, Wei-Lin
    Zhang, Peng
    Zhu, Da-Ming
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2008, 23 (05) : 740 - 748
  • [3] On Constrained Facility Location Problems
    李委霖
    张鹏
    朱大铭
    JournalofComputerScience&Technology, 2008, (05) : 740 - 748
  • [4] On Constrained Facility Location Problems
    Wei-Lin Li
    Peng Zhang
    Da-Ming Zhu
    Journal of Computer Science and Technology, 2008, 23 : 740 - 748
  • [5] The capacity constrained facility location problem
    Aziz, Haris
    Chan, Hau
    Lee, Barton E.
    Parkes, David C.
    GAMES AND ECONOMIC BEHAVIOR, 2020, 124 : 478 - 490
  • [6] The Capacity Constrained Facility Location Problem
    Aziz, Haris
    Chan, Hau
    Lee, Barton E.
    Parkes, David C.
    WEB AND INTERNET ECONOMICS, WINE 2019, 2019, 11920 : 336 - 336
  • [7] Distance Constrained Facility Location Problem
    Weng, Kerui
    2009 IITA INTERNATIONAL CONFERENCE ON SERVICES SCIENCE, MANAGEMENT AND ENGINEERING, PROCEEDINGS, 2009, : 358 - 361
  • [8] Robust recycling facility location with clustering
    Liu, Tianqi
    Li, Guiyu
    COMPUTERS & OPERATIONS RESEARCH, 2021, 136
  • [9] Decomposition of the Location Problem in a Hybrid Clustering-Location Model
    de Aguiar Vallim Filho, Arnaldo Rabello
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 317 - 322
  • [10] A new hybrid approach to discrete multiple facility location problem
    Shishebori, Davood
    Dayarian, Iman
    Jabbarzadeh, Armin
    Barzinpour, Farnaz
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 71 (1-4) : 127 - 139