Abstract
DBSCAN is a popular density-based clustering algorithm in data mining. However, its principle of first come, first served to deal with the cross-border points of multiple clusters will make some cross-border points not belong to the best clustering. To solve this problem, an adjusting strategy after DBSCAN to change the positions of the points of every cluster’s convex hull is proposed in this paper. At the end, the effectiveness of proposed adjustment strategy is verified by an experiment.
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.
