Treffer: An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm
Title:
An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm
Authors:
Source:
Theses Digitization Project
Publisher Information:
CSUSB ScholarWorks
Publication Year:
2013
Collection:
California State University, San Bernardino Research: CSUSB ScholarWorks
Subject Terms:
Document Type:
Fachzeitschrift
text
File Description:
application/pdf
Language:
unknown
Availability:
Accession Number:
edsbas.80E20FF3
Database:
BASE
Weitere Informationen
For this project, a comprehensive literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.