Abstract
There are large datasets in high dimensional database to solve the cluster identification problem and for identifying dense clusters in a noisy data. In this paper by using densely intra connected sub graphs our analysis identified the clusters. We have used pattern recognition algorithms for representing the graphs and solve the cluster identification problem using K-Means-Mode, single linkage clustering and K-Nearest Neighbor Algorithm. The computational analysis show that when running on 160 CPU’s, one of our algorithm can solve a cluster identification problem on a dataset with 1,000,000 data points almost 1000 times faster than on single CPU, indicating that the problem for handling large data is done in an efficient manner.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer Science and Informatics
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.