Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMahajan, Saumya-
dc.contributor.authorKumar, Pardeep [Guided by]-
dc.description.abstractClustering is one of the important streams in data mining useful for discovering groups and identifying interesting distributions in the underlying data. This project aims in analyzing and comparing the partitional and density based clustering algorithms namely K-Means and DBSCAN. The comparison is done based on the extent to which each of these algorithms identify the clusters and their pros and cons. K-Means is a partitional clustering technique that helps to identify k clusters from a given set of n data points in d-dimensional space. It starts with k random centers and refines it at each step arriving to k clusters. DBSCAN discovers clusters of arbitrary shape relying on a density based notion of clusters. Given eps as the input parameter, unlike k-means clustering, it tries to find out all possible clusters by classifying each point as core, border or noise. DBSCAN can be expensive as computation of nearest neighbors requires computing all pair wise proximities. Our implementation would provide a comparative study of K-Means against DBSCAN algorithm.en_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectData Miningen_US
dc.subjectDBSCAN algorithmen_US
dc.titleImplementation of Various Clustering Techniquesen_US
dc.typeProject Reporten_US
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Implementation of Various Clustering Techniques.pdf526.75 kBAdobe PDFView/Open

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