Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/395129
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBindu Singla-
dc.contributor.authorKiran Yadav-
dc.contributor.authorJyotsna Singh-
dc.date.accessioned2023-06-15T07:55:38Z-
dc.date.available2023-06-15T07:55:38Z-
dc.identifier.otherukmvital:123033-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/395129-
dc.description.abstractClustering is in the eye of beholder. Researchers proposed many principles and models whose corresponding optimization problem can only be approximately solved by even large number of algorithms. Each algorithm emphasizes how it is different from previous algorithms. ln our experiment we are comparing hierarchical and partitional clustering in terms of efficiency, intra-cluster similarity, and stability, a desirable property of clustering is stability that is small change to data should not lead dramatically different clustering.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE),Piscataway, US-
dc.subjectClustering techniques-
dc.titleComparison and analysis of clustering techniques-
dc.typeSeminar Papers-
dc.format.pages3-
dc.identifier.callnoT58.5.C634 2008 kat sem j.3-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:
There are no files associated with this item.


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