NDLI: Clustering High Dimensional Data Streams with Representative Points

Content Provider	IEEE Xplore Digital Library
Author	Xiujun Wang Hong Shen
Copyright Year	2009
Abstract	In this paper, we propose a novel algorithm for clustering high dimensional data streams with representative data points. The fixed-size interval partitioning adopted in traditional grid based clustering methods can not capture clusters in each dimension well when they are applied in evolving high dimensional data streams. It may generate unnecessary dense grids which misrepresent clusters in a subspace. To overcome these drawbacks, we quantify each dimension (attribute) of data points separately and use the generated representative data points for each dimension instead of fixed-size intervals. These data points are updated with incoming data points continuously so that they can capture the cluster trends in each dimension more accurately than the fixed-size intervals. Instead of discarding the historical data point as a whole, our algorithm confines data discarding at attribute level with the statistics stored in the representative data points. This enables us to keep useful parts of data points and discard the trivial parts. Experiment results on synthetic and real data sets display the high effectiveness and accuracy of the proposed method.
Starting Page	449
Ending Page	453
File Size	358794
Page Count	5
File Format	PDF
ISBN	9780769537351
DOI	10.1109/FSKD.2009.341
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-08-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Shape Clustering methods Clustering algorithms Probability Displays Partitioning algorithms Statistics Mesh generation Fuzzy systems
Content Type	Text
Resource Type	Article

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

Visual cluster validity (VCV) displays for prototype generator clustering methods

HDG-Tree: A Structure for Clustering High-dimensional Data Streams

BEADS: High dimensional data cluster visualization

Fuzzy nearest neighbor clustering of high-dimensional data

Competitive fuzzy clustering

Generation of membership functions via possibilistic clustering

Irregular Grid-Based Clustering over High-Dimensional Data Streams

Network-Based Clustering and Embedding for High-Dimensional Data Visualization

A fast subspace partition clustering algorithm for high dimensional data streams

Clustering High Dimensional Data Streams with Representative Points

Similar Documents

Visual cluster validity (VCV) displays for prototype generator clustering methods

HDG-Tree: A Structure for Clustering High-dimensional Data Streams

BEADS: High dimensional data cluster visualization

Fuzzy nearest neighbor clustering of high-dimensional data

Competitive fuzzy clustering

Generation of membership functions via possibilistic clustering

Irregular Grid-Based Clustering over High-Dimensional Data Streams

Network-Based Clustering and Embedding for High-Dimensional Data Visualization

A fast subspace partition clustering algorithm for high dimensional data streams

Clustering High Dimensional Data Streams with Representative Points