Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems

Bagirov, Adil M., Taheri, Sona and Ugon, Julien 2016, Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems, Pattern recognition, vol. 53, pp. 12-24, doi: 10.1016/j.patcog.2015.11.011.

Attached Files
Name Description MIMEType Size Downloads

Title Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Author(s) Bagirov, Adil M.
Taheri, Sona
Ugon, JulienORCID iD for Ugon, Julien orcid.org/0000-0001-5290-8051
Journal name Pattern recognition
Volume number 53
Start page 12
End page 24
Total pages 13
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2016-05
ISSN 0031-3203
Keyword(s) Science & Technology
Technology
Computer Science, Artificial Intelligence
Engineering, Electrical & Electronic
Computer Science
Engineering
Cluster analysis
Non-smooth optimization
Non-convex optimization
Incremental clustering algorithms
K-MEANS ALGORITHM
SEARCH
POINT
Language eng
DOI 10.1016/j.patcog.2015.11.011
Field of Research 0899 Other Information And Computing Sciences
0906 Electrical And Electronic Engineering
0801 Artificial Intelligence And Image Processing
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2015, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30112966

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 9 times in TR Web of Science
Scopus Citation Count Cited 9 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 15 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Fri, 24 Aug 2018, 15:15:55 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.