Please use this identifier to cite or link to this item: http://nopr.niscpr.res.in/handle/123456789/31443
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSwapna, Ch Swetha-
dc.contributor.authorKumar, V V-
dc.contributor.authorMurthy, J V R-
dc.date.accessioned2015-05-08T11:28:20Z-
dc.date.available2015-05-08T11:28:20Z-
dc.date.issued2015-05-
dc.identifier.issn0975-1084 (Online); 0022-4456 (Print)-
dc.identifier.urihttp://hdl.handle.net/123456789/31443-
dc.description261-264en_US
dc.description.abstractThe paper discusses yet another approach of clustering datasets whose cluster numbers are not known beforehand. The suggested approach effectively determines the number of clusters or partitions while running the algorithm. The proposed method is only limited to partitional clustering inspired from the K-means algorithm. In this work a Modified Teaching-Learning-Based Optimization (MTLBO) is used to form the clusters and determine the number of clusters on the run. The comparison of the results obtained by MTLBO is done with the classical TLBO and Classical Differential Evolution (DE) technique. The results show that MTLBO gives better accuracy than the other two with respect to the number of function evaluations and cluster validity measures. Several benchmark datasets are simulated from the UCI machine repository and results are tabulated in the paper.en_US
dc.language.isoen_USen_US
dc.publisherNISCAIR-CSIR, Indiaen_US
dc.rights CC Attribution-Noncommercial-No Derivative Works 2.5 Indiaen_US
dc.sourceJSIR Vol.74(05) [May 2015]en_US
dc.subjectClusteringen_US
dc.subjectMTLBOen_US
dc.subjectEvolutionary Computationen_US
dc.titleA New Approach to Cluster Datasets without Prior Knowledge of Number of Clustersen_US
dc.typeArticleen_US
Appears in Collections:JSIR Vol.74(05) [May 2015]

Files in This Item:
File Description SizeFormat 
JSIR 74(5) 261-264.pdf170.36 kBAdobe PDFView/Open


Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.