Abstract
Robustness is an important concept when dealing with clustering algorithms. While most literature directed to this concept discusses robustness with respect to changes in the given data set, this paper focuses on robustness with respect to changes in the initial conditions. We build on our previous work, where we introduced the concepts of instability and cluster stability variance to measure the robustness in terms of initial conditions. Results from previous work are extended to a much broader class of clusterings, and we introduce the notion of structure-preserving data element. It is proven that removing a structure-preserving unstable data element from the data set increases the robustness of the considered clustering algorithm, as measured by its instability, while the structure of the given data set is conserved. The practical significance of detecting structure-preserving unstable data elements is also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.