Sciweavers

IDEAL
2004
Springer

The Application of K-Medoids and PAM to the Clustering of Rules

13 years 9 months ago
The Application of K-Medoids and PAM to the Clustering of Rules
Abstract. Earlier research has resulted in the production of an ‘allrules’ algorithm for data-mining that produces all conjunctive rules of above given confidence and coverage thresholds. While this is a useful tool, it may produce a large number of rules. This paper describes the application of two clustering algorithms to these rules, in order to identify sets of similar rules and to better understand the data.
Alan P. Reynolds, Graeme Richards, Victor J. Raywa
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IDEAL
Authors Alan P. Reynolds, Graeme Richards, Victor J. Rayward-Smith
Comments (0)