Abstract
In this paper, we propose an adaptation of the well-known k-means algorithm for solving the multiple spheres detection problem when data points are homogeneously scattered around several spheres. We call this adaptation the k-closest spheres algorithm. In order to choose good initial spheres, we use a few iterations of the global optimizing algorithm DIRECT , resulting in the high efficiency of the proposed k-closest spheres algorithm. We present illustrative examples for the case of non-intersecting and for the case of intersecting spheres. We also show a real-world application in analyzing earthquake depths.
Sign-in/Register to access full text options 
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.
