Authors: Davidović, Tatjana 
Glišović, Nataša
Rašković, Miodrag 
Title: Bee colony optimization for clustering incomplete data
Journal: CEUR Workshop Proceedings
Volume: 2098
First page: 94
Last page: 108
Conference: School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018; Omsk; Russian Federation; 8 July 2018 through 14 July 2018
Issue Date: 1-Jan-2018
ISSN: 1613-0073
URL: http://ceur-ws.org/Vol-2098/paper8.pdf
Abstract: 
Many decision making processes include the situations when not all relevant data are available. The main issues one has to deal with when clustering incomplete data are the mechanism for filling in the missing values, the definition of a proper distance function and/or the selection of the most appropriate clustering method. It is very hard to find the method that can adequately estimate missing values in all required situations. Therefore, in the recent literature a new distance function, based on the propositional logic, that does not require to determine the values of missing data, is proposed. Exploiting this distance, we developed Bee Colony Optimization (BCO) approach for clustering incomplete data based on the p-median classification model. BCO is a population-based meta-heuristic inspired by the foraging habits of honey bees. It belongs to the class of Swarm intelligence (SI) methods. The improvement variant of BCO is implemented, the one that transforms complete solutions in order to improve their quality. The efficiency of the proposed approach is demonstrated by the comparison with some recent clustering methods.
Keywords: Classification of objects | Data bases | Missing values | Nature-inspired methods | Swarm intelligence
Publisher: CEUR-WS
Project: Graph theory and mathematical programming with applications in chemistry and computer science 
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 

Show full item record

Page view(s)

39
checked on Oct 2, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.