An Innovative Algorithm for Adaptive Data Stream Clustering

Main Article Content

G. Senthil Velan, K. Somasundaram, Dr. V. N. Rajavarman

Abstract

The primary goal of data mining is to group information. It is important to note that observations within a group are similar, yet observations within a group are distinct, since this creates difficulties when categorising a sequence of observations. This is not appropriate for random access since there is no full dataset at the start of training and the data flows at a breakneck pace throughout training. We are unable to access the data unless we get authorization. To create the aggregate, you just need to perform a single or a few small data transfers. These kinds of data are referred to as data streams. To solve the issue of grouping data streams, a system must be developed that can segregate observations according to storage and temporal limitations. Many algorithms combine summary statistics and independent components to generate grouped data using a two-step approach for groups that include fundamental components, such as flow point data, while others use a one-step method for groups that do not contain basic components. Alternative sources of competition are possible. It is possible to generate tile groups when not connected to the internet. This article discusses data stream grouping methods, as well as the most popular transport platforms that groups utilise to transmit their data.

Article Details

Section
Articles