A New Integral Function Algorithm for Global Optimization and Its Application to the Data Clustering Problem

被引：0
作者：
Pandiya R. [1 ]
Ahdika A. [2 ]
Khomsah S. [3 ]
Ramadhani R.D. [3 ]
机构：
[1] Department of Informatics, Institut Teknologi Telkom Purwokerto
[2] Department of Statistics, Universitas Islam Indonesia
[3] Department of Data Sciences, Institut Teknologi Telkom Purwokerto
来源：
Mendel | 2023年 / 29卷 / 02期
关键词：
Data Clustering; Global Minimum Point; Global Optimization; Integral Function Algorithm;
D O I：
10.13164/mendel.2023.2.162
中图分类号：
学科分类号：
摘要：
The filled function method is an approach to finding global minimum points of multidimensional unconstrained global optimization problems. The conventional parametric filled functions have computational weaknesses when they are employed in some benchmark optimization functions. This paper proposes a new integral function algorithm based on the auxiliary function approach. The proposed method can successfully be used to find the global minimum point of a function of several variables. Some testing global optimization problems have been used to show the ability of this recommended method. The integral function algorithm is then implemented to solve the center-based data clustering problem. The results show that the proposed algorithm can solve the problem successfully. © 2023, Brno University of Technology. All rights reserved.
引用
收藏
页码：162 / 168
页数：6
相关论文
共 33 条
  • [1] Ahmed A., A new filled function for global minimization and system of nonlinear equations, Optimization, 71, pp. 4083-4106, (2022)
  • [2] Dhillon I., Mallela S., Kumar R., A divisive information-theoretic feature clustering algorithm for text classification, Journal of Machine Learning Research, 3, pp. 1265-1287, (2003)
  • [3] El-Gindy T., Salim M., Ahmed A., A new filled function method applied to unconstrained global optimization, Applied Mathematics and Computation, 273, pp. 1246-1256, (2016)
  • [4] Gao Y., Yang Y., You M., A new filled function method for global optimization, Applied Mathematics and Computation, 268, pp. 268-695, (2015)
  • [5] Gaviano M., Kvasov D. E., Lera D., Sergeyev Y. D., Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization, ACM Transactions on Mathematical Software, 29, pp. 469-480, (2003)
  • [6] Ge R., The theory of filled function method for finding global minimizers of nonlinearly constrained minimization problems, Journal of Computational Mathematics, 5, pp. 1-9, (1987)
  • [7] Ge R., A filled function method for finding a global minimizer of a function of several variables, Mathematical Programming, 46, pp. 191-204, (1990)
  • [8] Ge R., Qin Y., A class of filled functions for finding global minimizers of a function of several variables, Journal of Optimization Theory and Applications, 54, pp. 241-252, (1987)
  • [9] Hansen N., Auger A., Finck S., Ros R., Real parameter black-box optimization benchmarking 2012: Experimental setup, (2012)
  • [10] Jin Y., Wang H., Chugh T., Guo D., Miettinen K., K data-driven evolutionary optimization: An overview and case studies, IEEE Transactions on Evolutionary Computation, 23, pp. 442-458, (2018)
1234