NDLI: Density connected clustering with local subspace preferences

Content Provider	IEEE Xplore Digital Library
Author	Bohm, C. Railing, K. Kriegel, H.-P. Kroger, P.
Copyright Year	2004
Description	Author affiliation: Inst. for Comput. Sci., Munich Univ., Germany (Bohm, C.; Railing, K.; Kriegel, H.-P.; Kroger, P.)
Abstract	Many clustering algorithms tend to break down in high-dimensional feature spaces, because the clusters often exist only in specific subspaces (attribute subsets) of the original feature space. Therefore, the task of projected clustering (or subspace clustering) has been defined recently. As a solution to tackle this problem, we propose the concept of local subspace preferences, which captures the main directions of high point density. Using this concept, we adopt density-based clustering to cope with high-dimensional data. In particular, we achieve the following advantages over existing approaches: Our proposed method has a determinate result, does not depend on the order of processing, is robust against noise, performs only one single scan over the database, and is linear in the number of dimensions. A broad experimental evaluation shows that our approach yields results of significantly better quality than recent work on clustering high-dimensional data.
Sponsorship	IEEE Comput. Soc. Tech. Comm. on Computational Intelligence (TCCI) IEEE Comput. Soc. Tech. Comm. on Pattern Analysis and Machine Intelligence (TCPAMI)
Starting Page	27
Ending Page	34
File Size	233927
Page Count	8
File Format	PDF
ISBN	0769521428
DOI	10.1109/ICDM.2004.10087
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-11-01
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Partitioning algorithms Data mining Clustering methods Principal component analysis Computer science Noise robustness Databases Nearest neighbor searches Visualization
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

A novel subspace clustering algorithm with dimensional density

P3C: A Robust Projected Clustering Algorithm

Fuzzy nearest neighbor clustering of high-dimensional data

Spectral Approaches to Nearest Neighbor Search

Local Agglomerative Characteristics based clustering algorithm

Hierarchical Clustering Ensemble Algorithm Based Association Rules

A distribution-based clustering algorithm for mining in large spatial databases

The Approach of Adaptive Spectral Clustering Analyze on High Dimensional Data

Anytime k-nearest neighbor search for database applications

Density connected clustering with local subspace preferences

Similar Documents

A novel subspace clustering algorithm with dimensional density

P3C: A Robust Projected Clustering Algorithm

Fuzzy nearest neighbor clustering of high-dimensional data

Spectral Approaches to Nearest Neighbor Search

Local Agglomerative Characteristics based clustering algorithm

Hierarchical Clustering Ensemble Algorithm Based Association Rules

A distribution-based clustering algorithm for mining in large spatial databases

The Approach of Adaptive Spectral Clustering Analyze on High Dimensional Data

Anytime k-nearest neighbor search for database applications

Density connected clustering with local subspace preferences