Please use this identifier to cite or link to this item:
http://hdl.handle.net/11452/27005
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kayalıgil, Sinan | - |
dc.contributor.author | Özdemirel, Nur Evin | - |
dc.date.accessioned | 2022-06-09T12:45:01Z | - |
dc.date.available | 2022-06-09T12:45:01Z | - |
dc.date.issued | 2015-03 | - |
dc.identifier.citation | İnkaya, T. vd. (2015). "Ant Colony Optimization based clustering methodology". Applied Soft Computing, 28, 301-311. | en_US |
dc.identifier.issn | 1568-4946 | - |
dc.identifier.uri | https://doi.org/10.1016/j.asoc.2014.11.060 | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S1568494614006334 | - |
dc.identifier.uri | http://hdl.handle.net/11452/27005 | - |
dc.description.abstract | In this work we consider spatial clustering problem with no a priori information. The number of clusters is unknown, and clusters may have arbitrary shapes and density differences. The proposed clustering methodology addresses several challenges of the clustering problem including solution evaluation, neighborhood construction, and data set reduction. In this context, we first introduce two objective functions, namely adjusted compactness and relative separation. Each objective function evaluates the clustering solution with respect to the local characteristics of the neighborhoods. This allows us to measure the quality of a wide range of clustering solutions without a priori information. Next, using the two objective functions we present a novel clustering methodology based on Ant Colony Optimization (ACO-C). ACO-C works in a multi-objective setting and yields a set of non-dominated solutions. ACO-C has two pre-processing steps: neighborhood construction and data set reduction. The former extracts the local characteristics of data points, whereas the latter is used for scalability. We compare the proposed methodology with other clustering approaches. The experimental results indicate that ACO-C outperforms the competing approaches. The multi-objective evaluation mechanism relative to the neighborhoods enhances the extraction of the arbitrary-shaped clusters having density variations. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Ant Colony Optimization | en_US |
dc.subject | Clustering | en_US |
dc.subject | Data set reduction | en_US |
dc.subject | Multiple objectives | en_US |
dc.subject | Automatic evolution | en_US |
dc.subject | K-means | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Hybridization | en_US |
dc.subject | Density | en_US |
dc.subject | Computer science | en_US |
dc.subject | Cluster analysis | en_US |
dc.subject | Function evaluation | en_US |
dc.subject | Reduction | en_US |
dc.subject | Clustering | en_US |
dc.subject | Clustering solutions | en_US |
dc.subject | Data set | en_US |
dc.subject | Local characteristics | en_US |
dc.subject | Multi-objective evaluations | en_US |
dc.subject | Multiple-objectives | en_US |
dc.subject | Neighborhood construction | en_US |
dc.subject | Nondominated solutions | en_US |
dc.subject | Ant colony optimization | en_US |
dc.title | Ant Colony Optimization based clustering methodology | en_US |
dc.type | Article | en_US |
dc.identifier.wos | 000348452500030 | tr_TR |
dc.identifier.scopus | 2-s2.0-84919930171 | tr_TR |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi | tr_TR |
dc.contributor.department | Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü. | tr_TR |
dc.contributor.orcid | 0000-0002-6260-0162 | tr_TR |
dc.identifier.startpage | 301 | tr_TR |
dc.identifier.endpage | 311 | tr_TR |
dc.identifier.volume | 28 | tr_TR |
dc.relation.journal | Applied Soft Computing | en_US |
dc.contributor.buuauthor | İnkaya, Tülin | - |
dc.contributor.researcherid | AAH-2155-2021 | tr_TR |
dc.relation.collaboration | Yurt içi | tr_TR |
dc.subject.wos | Computer science, artificial intelligence | en_US |
dc.subject.wos | Computer science, interdisciplinary applications | en_US |
dc.indexed.wos | SCIE | en_US |
dc.indexed.scopus | Scopus | en_US |
dc.wos.quartile | Q1 | en_US |
dc.contributor.scopusid | 24490728300 | tr_TR |
dc.subject.scopus | Data Clustering; K-Mean Algorithm; Cluster Analysis | en_US |
Appears in Collections: | Scopus Web of Science |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.