An incremental clustering algorithm based on hyperbolic smoothing

Basit Öğe Kaydı
dc.contributor.authorBagirov, A. M.
dc.contributor.authorOrdin, B.
dc.contributor.authorOzturk, G.
dc.contributor.authorXavier, A. E.
dc.date.accessioned2019-10-27T22:27:12Z
dc.date.available2019-10-27T22:27:12Z
dc.date.issued2015
dc.departmentEge Üniversitesien_US
dc.description.abstractClustering is an important problem in data mining. It can be formulated as a nonsmooth, nonconvex optimization problem. For the most global optimization techniques this problem is challenging even in medium size data sets. In this paper, we propose an approach that allows one to apply local methods of smooth optimization to solve the clustering problems. We apply an incremental approach to generate starting points for cluster centers which enables us to deal with nonconvexity of the problem. The hyperbolic smoothing technique is applied to handle nonsmoothness of the clustering problems and to make it possible application of smooth optimization algorithms to solve them. Results of numerical experiments with eleven real-world data sets and the comparison with state-of-the-art incremental clustering algorithms demonstrate that the smooth optimization algorithms in combination with the incremental approach are powerful alternative to existing clustering algorithms.en_US
dc.description.sponsorshipAustralian Research CouncilAustralian Research Council [DP140103213]en_US
dc.description.sponsorshipDr. Burak Ordin acknowledges TUBITAK for its support of his visit to the University of Ballarat, Australia. This research by A. M. Bagirov was supported under Australian Research Council's Discovery Projects funding scheme (Project No. DP140103213). We are grateful to two anonymous referees for their comments and criticism that helped the authors to significantly improve the quality of the paper.en_US
dc.identifier.doi10.1007/s10589-014-9711-7
dc.identifier.endpage241en_US
dc.identifier.issn0926-6003
dc.identifier.issn1573-2894
dc.identifier.issn0926-6003en_US
dc.identifier.issn1573-2894en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage219en_US
dc.identifier.urihttps://doi.org/10.1007/s10589-014-9711-7
dc.identifier.urihttps://hdl.handle.net/11454/50601
dc.identifier.volume61en_US
dc.identifier.wosWOS:000351906500010en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofComputational Optimization and Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNonsmooth optimizationen_US
dc.subjectCluster analysisen_US
dc.subjectSmoothing techniquesen_US
dc.subjectNonlinear programmingen_US
dc.titleAn incremental clustering algorithm based on hyperbolic smoothingen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu