Abstract

Initial seed artefacts play a vital role in proper categorization of the given data set in partitioning based clustering algorithms. Hence, it is important to identify them. We propose a density with distance based method which ensures identification of seed artefacts from different clusters that leads to more accurate clustering results. Our algorithm improves on the search for initial seed artefacts iteratively until the minimum value of the sum of within sum errors, normalized by their data sizes, is ensured. This is because the initial artefacts are selected from different clusters. Here the choice of seed artefacts guarantees a global optimum clustering solution. We have compared our results with random, Wu, Cao and Khan’s methods of initial seed artefact selection, to show the efficacy of our method.

Full Text
Paper version not known

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 call

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.