Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms

Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each ot...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2014-06
Main Authors: Chakraborty, Sanjay, Nagwani, N K, Dey, Lopamudra
Format: Article
Language:English
Subjects:
Algorithms
Cluster analysis
Clustering
Performance evaluation
Vector quantization
Warehouses
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Chakraborty, Sanjay
Nagwani, N K
Dey, Lopamudra
description Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the performance of incremental K-means clustering algorithm and it also explains the characteristics of these two algorithms based on the changes of the data in the database. This paper also explains some logical differences between these two most popular clustering algorithms. This paper uses an air pollution database as original database on which the experiment is performed.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2084497595</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2084497595</sourcerecordid><originalsourceid>FETCH-proquest_journals_20844975953</originalsourceid><addsrcrecordid>eNqNikELgjAYQEcQJOV_GHQW1uZSj2ZFEVRQdxk2S3HfZ_vs_9ehS7dOD957IxZIpRZRGks5YSFRK4SQy0RqrQJ2Oltfo3cGKssLdL3xDSFwrPkeKm-dhcF0_BA5a4C4gduPX68uRX7keXdH3wwPRzM2rk1HNvxyyubbzbXYRb3H58vSULb48vBJpRRpHGeJzrT673oD28s-CA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2084497595</pqid></control><display><type>article</type><title>Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms</title><source>Publicly Available Content (ProQuest)</source><creator>Chakraborty, Sanjay ; Nagwani, N K ; Dey, Lopamudra</creator><creatorcontrib>Chakraborty, Sanjay ; Nagwani, N K ; Dey, Lopamudra</creatorcontrib><description>Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the performance of incremental K-means clustering algorithm and it also explains the characteristics of these two algorithms based on the changes of the data in the database. This paper also explains some logical differences between these two most popular clustering algorithms. This paper uses an air pollution database as original database on which the experiment is performed.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Cluster analysis ; Clustering ; Performance evaluation ; Vector quantization ; Warehouses</subject><ispartof>arXiv.org, 2014-06</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2084497595?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>776,780,25728,36986,44563</link.rule.ids></links><search><creatorcontrib>Chakraborty, Sanjay</creatorcontrib><creatorcontrib>Nagwani, N K</creatorcontrib><creatorcontrib>Dey, Lopamudra</creatorcontrib><title>Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms</title><title>arXiv.org</title><description>Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the performance of incremental K-means clustering algorithm and it also explains the characteristics of these two algorithms based on the changes of the data in the database. This paper also explains some logical differences between these two most popular clustering algorithms. This paper uses an air pollution database as original database on which the experiment is performed.</description><subject>Algorithms</subject><subject>Cluster analysis</subject><subject>Clustering</subject><subject>Performance evaluation</subject><subject>Vector quantization</subject><subject>Warehouses</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNikELgjAYQEcQJOV_GHQW1uZSj2ZFEVRQdxk2S3HfZ_vs_9ehS7dOD957IxZIpRZRGks5YSFRK4SQy0RqrQJ2Oltfo3cGKssLdL3xDSFwrPkeKm-dhcF0_BA5a4C4gduPX68uRX7keXdH3wwPRzM2rk1HNvxyyubbzbXYRb3H58vSULb48vBJpRRpHGeJzrT673oD28s-CA</recordid><startdate>20140618</startdate><enddate>20140618</enddate><creator>Chakraborty, Sanjay</creator><creator>Nagwani, N K</creator><creator>Dey, Lopamudra</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PIMPY</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20140618</creationdate><title>Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms</title><author>Chakraborty, Sanjay ; Nagwani, N K ; Dey, Lopamudra</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20844975953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Cluster analysis</topic><topic>Clustering</topic><topic>Performance evaluation</topic><topic>Vector quantization</topic><topic>Warehouses</topic><toplevel>online_resources</toplevel><creatorcontrib>Chakraborty, Sanjay</creatorcontrib><creatorcontrib>Nagwani, N K</creatorcontrib><creatorcontrib>Dey, Lopamudra</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied &amp; Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chakraborty, Sanjay</au><au>Nagwani, N K</au><au>Dey, Lopamudra</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms</atitle><jtitle>arXiv.org</jtitle><date>2014-06-18</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the performance of incremental K-means clustering algorithm and it also explains the characteristics of these two algorithms based on the changes of the data in the database. This paper also explains some logical differences between these two most popular clustering algorithms. This paper uses an air pollution database as original database on which the experiment is performed.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-06
issn 2331-8422
language eng
recordid cdi_proquest_journals_2084497595
source Publicly Available Content (ProQuest)
subjects Algorithms
Cluster analysis
Clustering
Performance evaluation
Vector quantization
Warehouses
title Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-03-05T02%3A24%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Performance%20Comparison%20of%20Incremental%20K-means%20and%20Incremental%20DBSCAN%20Algorithms&rft.jtitle=arXiv.org&rft.au=Chakraborty,%20Sanjay&rft.date=2014-06-18&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2084497595%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20844975953%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2084497595&rft_id=info:pmid/&rfr_iscdi=true