Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/8756
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jain, Dhruv | - |
dc.date.accessioned | 2019-08-20T05:16:10Z | - |
dc.date.available | 2019-08-20T05:16:10Z | - |
dc.date.issued | 2017-06-01 | - |
dc.identifier.uri | http://10.1.7.192:80/jspui/handle/123456789/8756 | - |
dc.description.abstract | Today in this age where we talk about terabytes and petabytes of data generation each and every day, there is a need for tools which help in the analysis and processing of this data. Clustering is a type of unsupervised learning in which clusters of different types can be created using various algorithms such as K-Means, DBSCAN, OPTICS, Nearest-neighbor chain and many others. It is a process of creating different partitions to a set of data (or objects) into a set of meaningful sub-classes, called clusters. Density-Based Spatial Clustering of Applications with Noise(DBSCAN) is a density based clustering algorithm used for data clustering. This algorithm will be used to a special kind of dataset ie spatio-temporal dataset. Here these datasets are used to form clusters and then incremental clustering is performed on them which eventually will add to reducing the time complexity. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 15MCEC10; | - |
dc.subject | Computer 2015 | en_US |
dc.subject | Project Report 2015 | en_US |
dc.subject | Computer Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 15MCE | en_US |
dc.subject | 15MCEC | en_US |
dc.subject | 15MCEC10 | en_US |
dc.title | Incremental Clustering with Special Emphasis on Spatio Temporal Data | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
15MCEC10.pdf | 15MCEC10 | 1.53 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.