Abstract
CLIQUE is a clustering algorithm based on grid and density, which is sensitive to grid division parameter M and density threshold R, and has poor clustering accuracy. This paper proposes an improved algorithm, which is not sensitive to the initial grid division parameter M, and can automatically split the grid. Combined with the K-means algorithm, the clustering effect is improved. The F value on the S1 dataset is 36.9% higher than that of the classic CLIQUE algorithm.
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.
