Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T07:14:25.178Z Has data issue: false hasContentIssue false

REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA

Published online by Cambridge University Press:  15 December 2009

A. V. KELAREV*
Affiliation:
Graduate School of Information Technology and Mathematical Sciences, University of Ballarat, PO Box 663, Ballarat, Victoria 3353, Australia (email: a.kelarev@ballarat.edu.au)
P. WATTERS
Affiliation:
Graduate School of Information Technology and Mathematical Sciences, University of Ballarat, PO Box 663, Ballarat, Victoria 3353, Australia (email: p.watters@ballarat.edu.au)
J. L. YEARWOOD
Affiliation:
Graduate School of Information Technology and Mathematical Sciences, University of Ballarat, PO Box 663, Ballarat, Victoria 3353, Australia (email: j.yearwood@ballarat.edu.au)
*
✉For correspondence; e-mail: a.kelarev@ballarat.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper continues the investigation of semigroup constructions motivated by applications in data mining. We give a complete description of the error-correcting capabilities of a large family of clusterers based on Rees matrix semigroups well known in semigroup theory. This result strengthens and complements previous formulas recently obtained in the literature. Examples show that our theorems do not generalize to other classes of semigroups.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Publishing Association, Inc. 2009