Abstract
According to the characters of dynamic and SOM clustering algorithm, propose a novel clustering method, rough dynamic clustering based on grid-density algorithm (GDRDC). The algorithm contains initial clustering stages and precise adjustment stages. During switch from the first stage to second stage, according to rough sets idea, class kernel and freedom point sets base on grid-density are determined, and though which the two stages are joined. Then making farther adjustment by dynamic clustering method, the final clustering result is get. The experiment result shows that it is better than SOM and K-means, especially for nonlinear separable data.
Published Version
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.
