Back to search

North Dakota State University

Clustering Algorithm Comparison for Ellipsoidal Data

Abstract

dc:description.abstract

The main objective of cluster analysis is the statistical technique of identifying data points and assigning them into meaningful clusters. The purpose of this paper is to compare different types of clustering algorithms to find the clustering algorithm that performs the best for varying complexities in Gaussian data. The clustering algorithms used would include: Partitioning Around Medoids (PAM), K-means, Hierarchical with different linkages (Ward’s linkage, Single linkage, Complete linkage, Average linkage, McQuitty’s method, Gower’s method, and Centroid method). The different types of complexities would include different number of dimensions, average pairwise overlap between clusters, number of points simulated from each cluster. After the data is simulated the Adjusted Rand Index will be used gauge the performance of the clusters. From that a t-test will also be used to see if there are any clustering algorithms that as well as other clustering algorithms.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Loeffler, Shane Robert

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/25176

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Loeffler, Shane Robert. Clustering Algorithm Comparison for Ellipsoidal Data. North Dakota State University, 2015. https://hdl.handle.net/10365/25176