NDLI: Statistical grid-based clustering over data streams

Content Provider	ACM Digital Library
Author	Lee, Won Suk Park, Nam Hun
Abstract	A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Due to this reason, most algorithms for data streams sacrifice the correctness of their results for fast processing time. The processing time is greatly influenced by the amount of information that should be maintained. This paper proposes a statistical grid-based approach to clustering data elements of a data stream. Initially, the multidimensional data space of a data stream is partitioned into a set of mutually exclusive equal-size initial cells. When the support of a cell becomes high enough, the cell is dynamically divided into two mutually exclusive intermediate cells based on its distribution statistics. Three different ways of partitioning a dense cell are introduced. Eventually, a dense region of each initial cell is recursively partitioned until it becomes the smallest cell called a unit cell. A cluster of a data stream is a group of adjacent dense unit cells. In order to minimize the number of cells, a sparse intermediate or unit cell is pruned if its support becomes much less than a minimum support. Furthermore, in order to confine the usage of memory space, the size of a unit cell is dynamically minimized such that the result of clustering becomes as accurate as possible. The proposed algorithm is analyzed by a series of experiments to identify its various characteristics.
Starting Page	32
Ending Page	37
Page Count	6
File Format	PDF
ISSN	01635808
DOI	10.1145/974121.974127
Journal	ACM SIGMOD Record (SGMD)
Volume Number	33
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-06-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Clustering data streams using grid-based synopsis

Continuous queries over data streams

Grid-based subspace clustering over data streams

Exploiting predicate-window semantics over data streams

On Density-Based Data Streams Clustering Algorithms: A Survey

Parallelizing skyline queries over uncertain data streams with sliding window partitioning and grid index

On computing correlated aggregates over continual data streams

On clustering massive text and categorical data streams

A clustering approach for sampling data streams in sensor networks

Statistical grid-based clustering over data streams

Similar Documents

Clustering data streams using grid-based synopsis

Continuous queries over data streams

Grid-based subspace clustering over data streams

Exploiting predicate-window semantics over data streams

On Density-Based Data Streams Clustering Algorithms: A Survey

Parallelizing skyline queries over uncertain data streams with sliding window partitioning and grid index

On computing correlated aggregates over continual data streams

On clustering massive text and categorical data streams

A clustering approach for sampling data streams in sensor networks

Statistical grid-based clustering over data streams