Abstract
In this paper, two different optimization formulations for clustering problem are considered. The first one is the common mixed-integer optimization formulation and the second one is the binary integer optimization formulation which was proposed by the authors. The costs of the optimization problems were minimized by two different gradient dynamical networks. The performances of the networks were compared with each other on the image compression applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
