Search PubMedSearch

PubMed · 5221130

Predicting effectiveness of Bayesian classification systems.

Abstract

The source did not provide an abstract. Follow the original record for more information.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L M Herman, M B Dollinger. 1966. Predicting effectiveness of Bayesian classification systems.. https://doi.org/10.1007/bf02289467

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

The EMBL nucleotide sequence database.

The European Molecular Biology Laboratory (EMBL) Nucleotide Sequence Database (http://www.ebi.ac. uk/embl/index.html ) is maintained at the European Bioinformatics Institute (EBI) in an international collaboration with the DNA Data Bank of Japan (DDBJ) and GenBank (USA). Data is exchanged amongst the collaborative databases on a daily basis. The major contributors to the EMBL database are individual authors and genome project groups. WEBIN is the preferred web-based submission system for individual submitters, whilst automatic procedures allow incorporation of sequence data from large-scale genome sequencing centres and from the European Patent Office (EPO). Database releases are produced quarterly. Network services allow free access to the most up-to-date data collection via Internet and WWW interfaces. EBI's Sequence Retrieval System (SRS) is a network browser for databanks in molecular biology, integrating and linking the main nucleotide and protein databases plus many specialised databases. For sequence similarity searching a variety of tools (e.g., BLITZ, FASTA, BLAST) are available which allow external users to compare their own sequences against the most currently available data in the EMBL Nucleotide Sequence Database and SWISS-PROT.

Classification

Toward more meaningful hierarchical classification of protein three-dimensional structures.

Recently, several hierarchical classifications of protein three-dimensional (3D) structures have been published. However, none of them provides any assessment of the validity of a hierarchical representation or test individual clusters contained within. In fact, testing here of published trees reveals that they vary in meaning. Protein structure similarity measures are then assessed in terms of the robustness of the resulting trees for 24 protein families. A meaningful tree is defined as one in which all the clusters are found to be reliable according to a jackknife test. With the use of this criterion, a previously published similarity measure described as a "better RMS" is shown in fact to be usually less suited to protein fold classification than normal RMS after superposition. Here the "best" protein structure similarity measure for hierarchical classification-in terms of that which after clustering produces the highest number of meaningful trees, 20, for the 24 families-is found to be a new one. This measure includes information on the relationship of a distance at a given aligned position in a pair to the rest of the unique distances at that position in a protein family. There are only 2 families of the 24 tested, the globins (3 trees) and Kazal-type serine proteinase inhibitors (21 trees), in which the topology (branching order) of the meaningful 3D structure-based trees is constant. Thus, a new view of protein family sequence-structure relationships is afforded by comparing meaningful trees for each family. More generally, there is a need for care in interpretation of the results of those molecular biology algorithms that force a tree structure on data without assessing its applicability. Proteins 1999;37:20-29.

Classification

Combining classification trees using MLE.

We propose a probability distribution for an equivalence class of classification trees (that is, those that ignore the value of the cutpoints but retain tree structure). This distribution is parameterized by a central tree structure representing the true model, and a precision or concentration coefficient representing the variability around the central tree. We use this distribution to model an observed set of classification trees exhibiting variability in tree structure. We propose the maximum likelihood estimate of the central tree as the best tree to represent the set. This MLE retains the interpretability of a single tree model and has excellent generalizability. We implement an ascent search for the MLE tree structure using a data set of 13 classification trees that predict the presence or absence of cancer based on immune system parameters.

Classification