Navigation

Inhalt Hotkeys
Fakultät für Mathematik
Fakultät für Mathematik
Daniel Akume, Gerhard-Wilhelm Weber : Cluster Algorithms: Theory and Methods

Daniel Akume, Gerhard-Wilhelm Weber : Cluster Algorithms: Theory and Methods


Author(s):
Daniel Akume, Gerhard-Wilhelm Weber
Title:
Cluster Algorithms: Theory and Methods
Electronic source:
application/pdf
Preprint series:
Technische Universität Chemnitz, Fakultät für Mathematik (Germany). Preprint 9, 2001
Mathematics Subject Classification:
94C15 [ Applications of graph theory ]
46N10 [ Applications in optimization, convex analysis, mathematical programming, economics ]
Abstract:
The aim of this work is to study the suitability of some techniques in the clustering of Loan banking contracts. We start by presenting two optimization problems that eventually lead to two clustering algorithms - the single-Link and the k-means. We further compare both methods based on certain assessment techniques, space and time complexity, and conclude that the k-means method is more appropriate in view of forecasting customer behaviour.
Keywords:
cluster; loan banking; algorithm; graph theory; single-Link; k-means; complexity
Language:
English
Publication time:
11 / 2001

Presseartikel