Performance of clustering algorithms on time-dependent spatial patterns

Authors:
Ben Pinkowski
Affiliations:
Computer Science Department, Western Michigan University
Venue:
ANSS '88 Proceedings of the 21st annual symposium on Simulation
Year:
1988

Citing 5
Cited 0

Elements of simulation

Elements of simulation
Efficient Implementation of the Fuzzy c-Means Clustering Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Monte Carlo comparison of six hierarchical clustering methods on random data

Pattern Recognition
Integration of artificial intelLigence and simulation in a comprehensive decisioN-support system

Simulation
Discrete discriminant models: a performance simulation with reference to expert systems' applications

ANSS '87 Proceedings of the 20th annual symposium on Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A single linkage clustering algorithm adapted for points distributed over time (SLOT) is used to recover clusters from coplanar points associated with time parameters. Cluster number and shape determine separability and hence effectiveness of the algorithm. Performance in simulation experiments also depended on the probability of recording cluster points. SLOT links points observed at different times if they are within some limiting distance, and the distance parameter becomes critical when detectability is low. Performance comparisons are made with other algorithms, and results are presented in the context of a rule-based expert system for solving problems involving cluster analysis of time-dependent spatial patterns.