Representative noise-free complete-link classification with application to protein structures

作者:

Highlights:

摘要

In various applications, including many problems of knowledge discovery in databases, and particularly in the field of computational molecular biology, a compact and representative description of a vast object space is desired. In this paper, a constructive mathematical model corresponding the intuitive requirements of representativity is developed. Representativity is divided into two aspects: typicality and comprehensiveness. A new sieving method is presented where a special kind of noise is detected and eliminated by removing anomalous objects from the initial complete linkage partition. The comprehensiveness endangered by sieving is then regained by applying a special completion procedure. Theoretical results ensure that the resulting partition is representative, consisting of solid and separable classes. The conceptual model was further tested by applying the method to protein amino acid sequences of the Brookhaven Protein Data Bank. The recognized biochemical substance of the outcome confirm the representativity of the resulting classification.

论文关键词:Complete linkage clustering,Noise elimination,Knowledge discovery in databases,Representative selection,Separable partitions,Non-metric object space,Amino acid sequences,Protein data bank (PDB)

论文评审过程:Received 11 January 1996, Revised 3 June 1996, Accepted 25 June 1996, Available online 7 June 2001.

论文官网地址:https://doi.org/10.1016/S0031-3203(96)00092-1