Abstract
This paper presents a new clustering algorithm that detects clusters by learning data distribution of each cluster. Different from most existing clustering techniques, the proposed method is able to generate a dynamic two-dimensional topological graph which is used to explore both partitional information and detailed data relationship in each cluster. In addition, the proposed method is also able to work incrementally and detect arbitrary-shaped clusters without requiring the number of clusters as a prerequisite. The experimental data sets including five artificial data sets with various data distributions and an original hand-gesture data set are used to evaluate the proposed method. The comparable experimental results demonstrate the superior performance of the proposed algorithm in learning robustness, efficiency, working with outliers, and visualizing data relationships.
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.
