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.

• Type: Conference
• Year: 2004
• Where: IDEAL
• Authors: Alan P. Reynolds, Graeme Richards, Victor J. Rayward-Smith
• Keywords: Conjunctive Rules, Coverage Thresholds, Earlier Research, IDEAL 2004