Incremental Gaussian Mixture Clustering for Data Streams

Incremental Gaussian Mixture Clustering for Data Streams

The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bhanderi, Aniket, Bhatnagar, Raj
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Databases
Computer Science - Learning
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bhanderi, Aniket
Bhatnagar, Raj
description The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as a criterion for defining and updating clusters formed from a streaming dataset. As the clusters are formed we also identify anomalous datapoints that show up far away from all known clusters. With a number of 2-D datasets we demonstrate the effectiveness of discovering the clusters and also identifying anomalous data points.
doi_str_mv 10.48550/arxiv.2412.07217
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_07217</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_07217</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_072173</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwNzI052Sw8MxLLkrNTc0rScxRcE8sLS7OTMxT8M2sKCktSlVwziktLkktysxLV0jLL1JwSSxJVAguKUpNzC3mYWBNS8wpTuWF0twM8m6uIc4eumA74guKMnMTiyrjQXbFg-0yJqwCACY5M9U</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Incremental Gaussian Mixture Clustering for Data Streams</title><source>arXiv.org</source><creator>Bhanderi, Aniket ; Bhatnagar, Raj</creator><creatorcontrib>Bhanderi, Aniket ; Bhatnagar, Raj</creatorcontrib><description>The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as a criterion for defining and updating clusters formed from a streaming dataset. As the clusters are formed we also identify anomalous datapoints that show up far away from all known clusters. With a number of 2-D datasets we demonstrate the effectiveness of discovering the clusters and also identifying anomalous data points.</description><identifier>DOI: 10.48550/arxiv.2412.07217</identifier><language>eng</language><subject>Computer Science - Databases ; Computer Science - Learning</subject><creationdate>2024-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.07217$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.07217$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bhanderi, Aniket</creatorcontrib><creatorcontrib>Bhatnagar, Raj</creatorcontrib><title>Incremental Gaussian Mixture Clustering for Data Streams</title><description>The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as a criterion for defining and updating clusters formed from a streaming dataset. As the clusters are formed we also identify anomalous datapoints that show up far away from all known clusters. With a number of 2-D datasets we demonstrate the effectiveness of discovering the clusters and also identifying anomalous data points.</description><subject>Computer Science - Databases</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwNzI052Sw8MxLLkrNTc0rScxRcE8sLS7OTMxT8M2sKCktSlVwziktLkktysxLV0jLL1JwSSxJVAguKUpNzC3mYWBNS8wpTuWF0twM8m6uIc4eumA74guKMnMTiyrjQXbFg-0yJqwCACY5M9U</recordid><startdate>20241210</startdate><enddate>20241210</enddate><creator>Bhanderi, Aniket</creator><creator>Bhatnagar, Raj</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241210</creationdate><title>Incremental Gaussian Mixture Clustering for Data Streams</title><author>Bhanderi, Aniket ; Bhatnagar, Raj</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_072173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Databases</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Bhanderi, Aniket</creatorcontrib><creatorcontrib>Bhatnagar, Raj</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bhanderi, Aniket</au><au>Bhatnagar, Raj</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Incremental Gaussian Mixture Clustering for Data Streams</atitle><date>2024-12-10</date><risdate>2024</risdate><abstract>The problem of analyzing data streams of very large volumes is important and is very desirable for many application domains. In this paper we present and demonstrate effective working of an algorithm to find clusters and anomalous data points in a streaming datasets. Entropy minimization is used as a criterion for defining and updating clusters formed from a streaming dataset. As the clusters are formed we also identify anomalous datapoints that show up far away from all known clusters. With a number of 2-D datasets we demonstrate the effectiveness of discovering the clusters and also identifying anomalous data points.</abstract><doi>10.48550/arxiv.2412.07217</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2412.07217
ispartof
issn
language eng
recordid cdi_arxiv_primary_2412_07217
source arXiv.org
subjects Computer Science - Databases
Computer Science - Learning
title Incremental Gaussian Mixture Clustering for Data Streams
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T05%3A41%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Incremental%20Gaussian%20Mixture%20Clustering%20for%20Data%20Streams&rft.au=Bhanderi,%20Aniket&rft.date=2024-12-10&rft_id=info:doi/10.48550/arxiv.2412.07217&rft_dat=%3Carxiv_GOX%3E2412_07217%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true