Back to search

CSUniversity San Bernardino - Retro

An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science
Level thesis:degree_level
Project
Discipline thesis:degree_discipline
School of Computer Science and Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kao, Chin-Chieh
Contributors dc:contributor
  • Qiao, Haiyan
  • Gomez, Ernesto
  • Voigt, Kerstin

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/4221

Chain of custody

source
Harvested from
CSUniversity San Bernardino - Retro
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Kao, Chin-Chieh. An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm. Project thesis, https://scholarworks.lib.csusb.edu/etd-project/4221