The application of k-medoids and PAM to the clustering of rules

Reynolds, A. P., Richards, G. and Rayward-Smith, V. J. (2004) The application of k-medoids and PAM to the clustering of rules. In: Intelligent Data Engineering and Automated Learning – IDEAL 2004. Lecture Notes in Computer Science, 3177 . Springer, pp. 173-178. ISBN 978-3-540-22881-3

Full text not available from this repository. (Request a copy)

Abstract

Earlier research has resulted in the production of an ‘all-rules’ 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.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 21 Jul 2011 14:08
Last Modified: 09 Aug 2019 13:30
URI: https://ueaeprints.uea.ac.uk/id/eprint/21888
DOI: 10.1007/978-3-540-28651-6_25

Actions (login required)

View Item View Item