PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Classification Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,621 records · Page 90Linked to original sources

Building an automated classification of DNA-binding protein domains.

Intensive growth in 3D structure data on DNA-protein complexes as reflected in the Protein Data Bank (PDB) demands new approaches to the annotation and characterization of these data and will lead to a new understanding of critical biological processes involving these data. These data and those from other protein structure classifications will become increasingly important for the modeling of complete proteomes. We propose a fully automated classification of DNA-binding protein domains based on existing 3D-structures from the PDB. The classification, by domain, relies on the Protein Domain Parser (PDP) and the Combinatorial Extension (CE) algorithm for structural alignment. The approach involves the analysis of 3D-interaction patterns in DNA-protein interfaces, assignment of structural domains interacting with DNA, clustering of domains based on structural similarity and DNA-interacting patterns. Comparison with existing resources on describing structural and functional classifications of DNA-binding proteins was used to validate and improve the approach proposed here. In the course of our study we defined a set of criteria and heuristics allowing us to automatically build a biologically meaningful classification and define classes of functionally related protein domains. It was shown that taking into consideration interactions between protein domains and DNA considerably improves the classification accuracy. Our approach provides a high-throughput and up-to-date annotation of DNA-binding protein families which can be found at http://spdc.sdsc.edu.

Artificial Intelligence↗

An artificial intelligent algorithm for tumor detection in screening mammogram.

Cancerous tumor mass is one of the major types of breast cancer. When cancerous masses are embedded in and camouflaged by varying densities of parenchymal tissue structures, they are very difficult to be visually detected on mammograms. This paper presents an algorithm that combines several artificial intelligent techniques with the discrete wavelet transform (DWT) for detection of masses in mammograms. The AI techniques include fractal dimension analysis, multiresolution markov random field, dogs-and-rabbits algorithm, and others. The fractal dimension analysis serves as a preprocessor to determine the approximate locations of the regions suspicious for cancer in the mammogram. The dogs-and-rabbits clustering algorithm is used to initiate the segmentation at the LL subband of a three-level DWT decomposition of the mammogram. A tree-type classification strategy is applied at the end to determine whether a given region is suspicious for cancer. We have verified the algorithm with 322 mammograms in the Mammographic Image Analysis Society Database. The verification results show that the proposed algorithm has a sensitivity of 97.3% and the number of false positive per image is 3.92.

Algorithms↗

Improving the reliability of stroke subgroup classification using the Trial of ORG 10172 in Acute Stroke Treatment (TOAST) criteria.

BACKGROUND AND PURPOSE: We sought to improve the reliability of the Trial of ORG 10172 in Acute Stroke Treatment (TOAST) classification of stroke subtype for retrospective use in clinical, health services, and quality of care outcome studies. The TOAST investigators devised a series of 11 definitions to classify patients with ischemic stroke into 5 major etiologic/pathophysiological groupings. Interrater agreement was reported to be substantial in a series of patients who were independently assessed by pairs of physicians. However, the investigators cautioned that disagreements in subtype assignment remain despite the use of these explicit criteria and that trials should include measures to ensure the most uniform diagnosis possible. METHODS: In preparation for a study of outcomes and management practices for patients with ischemic stroke within Department of Veterans Affairs hospitals, 2 neurologists and 2 internists first retrospectively classified a series of 14 randomly selected stroke patients on the basis of the TOAST definitions to provide a baseline assessment of interrater agreement. A 2-phase process was then used to improve the reliability of subtype assignment. In the first phase, a computerized algorithm was developed to assign the TOAST diagnostic category. The reliability of the computerized algorithm was tested with a series of synthetic cases designed to provide data fitting each of the 11 definitions. In the second phase, critical disagreements in the data abstraction process were identified and remaining variability was reduced by the development of standardized procedures for retrieving relevant information from the medical record. RESULTS: The 4 physicians agreed in subtype diagnosis for only 2 of the 14 baseline cases (14%) using all 11 TOAST definitions and for 4 of the 14 cases (29%) when the classifications were collapsed into the 5 major etiologic/pathophysiological groupings (kappa=0.42; 95% CI, 0.32 to 0.53). There was 100% agreement between classifications generated by the computerized algorithm and the intended diagnostic groups for the 11 synthetic cases. The algorithm was then applied to the original 14 cases, and the diagnostic categorization was compared with each of the 4 physicians' baseline assignments. For the 5 collapsed subtypes, the algorithm-based and physician-assigned diagnoses disagreed for 29% to 50% of the cases, reflecting variation in the abstracted data and/or its interpretation. The use of an operations manual designed to guide data abstraction improved the reliability subtype assignment (kappa=0.54; 95% CI, 0.26 to 0.82). Critical disagreements in the abstracted data were identified, and the manual was revised accordingly. Reliability with the use of the 5 collapsed groupings then improved for both interrater (kappa=0.68; 95% CI, 0.44 to 0.91) and intrarater (kappa=0.74; 95% CI, 0.61 to 0.87) agreement. Examining each remaining disagreement revealed that half were due to ambiguities in the medical record and half were related to otherwise unexplained errors in data abstraction. CONCLUSIONS: Ischemic stroke subtype based on published TOAST classification criteria can be reliably assigned with the use of a computerized algorithm with data obtained through standardized medical record abstraction procedures. Some variability in stroke subtype classification will remain because of inconsistencies in the medical record and errors in data abstraction. This residual variability can be addressed by having 2 raters classify each case and then identifying and resolving the reason(s) for the disagreement.

Acute Disease↗

Optimization of discriminant partial least squares regression models for the detection of animal by-product meals in compound feedingstuffs by near-infrared spectroscopy.

This paper evaluates two multivariate strategies for classifying near-infrared (NIR) spectroscopic data for the detection of animal by-product meals (henceforth generically termed AbP) as an ingredient in compound feedingstuffs. Classification models were developed to discriminate between the presence and absence of animal-origin meals in compound feeds using two forms of discriminant partial least squares (PLS) regression: the algorithms PLS1 and PLS2. The training set comprised 433 commercial feeds, of which 148 contained AbP and the other 285 were stated to be AbP-free. Since the initial set contained unequal numbers of each class, the effect of this imbalance was analyzed by applying the same algorithms to a training set containing equal numbers of AbP-free and AbP-containing samples. The best classification model (97.42% of samples correctly classified), obtained with PLS2, that showed less sensitivity to the use of class-unbalanced sets, was externally validated using a set of 18 samples (10 AbP-containing and 8 AbP-free); all samples were correctly classified, except for one AbP-free sample that was classified as containing AbP (false positive). The results suggest that the application of PLS discriminant analysis to NIR spectroscopic data enables detection of AbP, a feed ingredient banned since the bovine spongiform encephalopathy (BSE) crisis; this confirms the value of NIRS qualitative analysis for product authentication purposes.

Algorithms↗

Diagnostic potential of near-infrared Raman spectroscopy in the colon: differentiating adenomatous from hyperplastic polyps.

BACKGROUND: Near-infrared Raman spectroscopy is a promising optical technique for GI tissue diagnosis. This study assessed the diagnostic potential of near-infrared Raman spectroscopy in the colon by evaluating its ability to distinguish between adenomatous and hyperplastic polyps. METHODS: Ex vivo and in vivo Raman spectra of colon polyps were collected by using a custom-built, fiber-optic, near-infrared Raman spectroscopic system. Multivariate statistical techniques, including principal component analysis and linear discriminant analysis, were used to develop diagnostic algorithms for classifying colon polyps based on their spectral characteristics. With the number of samples available, spectral classification of polyps was tested by using a leave-one-out, cross-validation method. RESULTS: Fifty-four ex vivo Raman spectra were analyzed (20 hyperplastic, 34 adenomatous). The spectral-based diagnostic algorithms identified adenomatous polyps with 91% sensitivity, 95% specificity, and 93% accuracy. In vivo, adenomas (n = 10) were distinguished from hyperplastic polyps (n = 9) with 100% sensitivity, 89% specificity, and 95% accuracy. CONCLUSIONS: Near-infrared Raman spectroscopy differentiated adenomatous from hyperplastic polyps with high diagnostic accuracy. To our knowledge, this is the first demonstration of the potential of near-infrared Raman spectroscopy for differentiation of colonic polyps during GI endoscopy.

Adenomatous Polyps↗

Designing a simpler high blood cholesterol case detection strategy: are the advantages of the NCEP protocol worth the complexity?

OBJECTIVE: To determine whether the complex strategy of lipid measurements for the detection of patients with high blood cholesterol levels proposed by the first Expert Panel of the National Cholesterol Education Panel (NCEP) could be simplified without significant loss of accuracy. DESIGN: Decision-analysis-based model of competing case detection strategies as compared with the NCEP strategy. A Markov model was used to estimate numbers of people treated over ten years as a result of the different classification strategies. DATA SOURCES: Conditional probabilities for the decision trees were derived from cholesterol distributions in national population-based surveys. Parameters for the Markov model were from published major epidemiologic studies and clinical trials. MAIN OUTCOME MEASURES: Misclassification to treatment vs non-treatment as a continuous function of the distribution of true low-density lipoprotein (LDL). RESULTS: A simplified strategy was designed that screens high-risk persons with two LDL measurements and low-risk people with one cholesterol measurement followed by two LDL measurements if the initial value is high. This algorithm requires 37% fewer measurements to classify a population. The overall accuracy of classification to treatment based on the NCEP I cutoff points is high, with a positive predictive value of 95% and a negative predictive value of 87% (relative to 97% and 80%, respectively, for the NCEP I protocol). This strategy is very similar to published NCEP II guidelines. A strategy that recommends an LDL determination for everyone, as a recent NIH consensus panel suggested, also significantly reduces the number of measurements required by 48%. The positive predictive value is 93%, vs 97% for the NCEP I protocol. The negative predictive value is 92%, vs 80% for the NCEP I. CONCLUSIONS: The complex measurement strategy initially proposed in the NCEP I guidelines did not improve accuracy of classification over the simpler and more convenient strategies that the authors evaluated and that have been substantially adopted in the NCEP II guidelines.

Adult↗

The challenge of managing patients with polyarteritis nodosa.

PURPOSE OF REVIEW: In this short review we focus on the problems faced by clinicians caused by the changing definitions of polyarteritis nodosa. RECENT FINDINGS: The term polyarteritis nodosa has been used for more than 100 years as a diagnostic term for patients with systemic vasculitis; however, specific vasculitides have been singled out like branches being chopped off a tree. Now, so little is left of the trunk of that tree that it is questionable to what extent we can trust older literature with respect to clinical features, natural history and response to treatment. Many authors of case reports, as well as authors of reviews and book chapters, claim they adhere to the Chapel Hill Consensus Conference definition of polyarteritis nodosa, yet still cite almost exclusively studies using older definitions without highlighting this dilemma. In the past year, two proposals affecting classification have been published: one stating that cutaneous polyarteritis nodosa and hepatitis-associated polyarteritis nodosa are diseases distinct from classical polyarteritis nodosa, and one providing an algorithm to separate microscopic polyangiitis from classical polyarteritis nodosa. SUMMARY: There is hope that a wide acceptance of the new classification principles will lead to a more uniform way to diagnose classical polyarteritis nodosa, which will facilitate clinical studies and eventually improve management.

Antibodies, Antineutrophil Cytoplasmic↗

Pattern classification by a neurofuzzy network: application to vibration monitoring.

An innovative neurofuzzy network is proposed herein for pattern classification applications, specifically for vibration monitoring. A fuzzy set interpretation is incorporated into the network design to handle imprecise information. A neural network architecture is used to automatically deduce fuzzy if-then rules based on a hybrid supervised learning scheme. The neurofuzzy classifier proposed is equipped with a one-pass, on-line, and incremental learning algorithm. This network can be considered a self-organized classifier with the ability to adaptively learn new information without forgetting old knowledge. The classification performance of the proposed neurofuzzy network is validated on the Fisher's Iris data, which is a well-known benchmark data set. For the generalization capability, the neurofuzzy network can achieve 97.33% correct classification. In addition, to demonstrate the efficiency and effectiveness of the proposed neurofuzzy paradigm, numerical simulations have been performed using the Westland data set. The Westland data set consists of vibration data collected from a US Navy CH-46E helicopter test stand. Using a simple fast Fourier transform technique for feature extraction, the proposed neurofuzzy network has shown promising results. Using various torque levels for training and testing, the network achieved 100% correct classification.

Algorithms↗

Molecular classification of liver cirrhosis in a rat model by proteomics and bioinformatics.

Liver cirrhosis is a worldwide health problem. Reliable, noninvasive methods for early detection of liver cirrhosis are not available. Using a three-step approach, we classified sera from rats with liver cirrhosis following different treatment insults. The approach consisted of: (i) protein profiling using surface-enhanced laser desorption/ionization (SELDI) technology; (ii) selection of a statistically significant serum biomarker set using machine learning algorithms; and (iii) identification of selected serum biomarkers by peptide sequencing. We generated serum protein profiles from three groups of rats: (i) normal (n=8), (ii) thioacetamide-induced liver cirrhosis (n=22), and (iii) bile duct ligation-induced liver fibrosis (n=5) using a weak cation exchanger surface. Profiling data were further analyzed by a recursive support vector machine algorithm to select a panel of statistically significant biomarkers for class prediction. Sensitivity and specificity of classification using the selected protein marker set were higher than 92%. A consistently down-regulated 3495 Da protein in cirrhosis samples was one of the selected significant biomarkers. This 3495 Da protein was purified on-chip and trypsin digested. Further structural characterization of this biomarkers candidate was done by using cross-platform matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS) peptide mass fingerprinting (PMF) and matrix-assisted laser desorption/ionization time of flight/time of flight (MALDI-TOF/TOF) tandem mass spectrometry (MS/MS). Combined data from PMF and MS/MS spectra of two tryptic peptides suggested that this 3495 Da protein shared homology to a histidine-rich glycoprotein. These results demonstrated a novel approach to discovery of new biomarkers for early detection of liver cirrhosis and classification of liver diseases.

Algorithms↗

Automatic determination of radial basis functions: an immunity-based approach.

The appropriate operation of a radial basis function (RBF) neural network depends mainly upon an adequate choice of the parameters of its basis functions. The simplest approach to train an RBF network is to assume fixed radial basis functions defining the activation of the hidden units. Once the RBF parameters are fixed, the optimal set of output weights can be determined straightforwardly by using a linear least squares algorithm, which generally means reduction in the learning time as compared to the determination of all RBF network parameters using supervised learning. The main drawback of this strategy is the requirement of an efficient algorithm to determine the number, position, and dispersion of the RBFs. The approach proposed here is inspired by models derived from the vertebrate immune system, that will be shown to perform unsupervised cluster analysis. The algorithm is introduced and its performance is compared to that of the random, k-means center selection procedures and other results from the literature. By automatically defining the number of RBF centers, their positions and dispersions, the proposed method leads to parsimonious solutions. Simulation results are reported concerning regression and classification problems.

Algorithms↗

Gene selection algorithms for microarray data based on least squares support vector machine.

BACKGROUND: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary to conduct the discriminant analysis with all the genes. Hence, gene selection is usually performed to select important genes. RESULTS: A gene selection method searches for an optimal or near optimal subset of genes with respect to a given evaluation criterion. In this paper, we propose a new evaluation criterion, named the leave-one-out calculation (LOOC, A list of abbreviations appears just above the list of references) measure. A gene selection method, named leave-one-out calculation sequential forward selection (LOOCSFS) algorithm, is then presented by combining the LOOC measure with the sequential forward selection scheme. Further, a novel gene selection algorithm, the gradient-based leave-one-out gene selection (GLGS) algorithm, is also proposed. Both of the gene selection algorithms originate from an efficient and exact calculation of the leave-one-out cross-validation error of the least squares support vector machine (LS-SVM). The proposed approaches are applied to two microarray datasets and compared to other well-known gene selection methods using codes available from the second author. CONCLUSION: The proposed gene selection approaches can provide gene subsets leading to more accurate classification results, while their computational complexity is comparable to the existing methods. The GLGS algorithm can also better scale to datasets with a very large number of genes.

Algorithms↗

Proposal for classifying the acute emetogenicity of cancer chemotherapy.

PURPOSE: To propose a classification of the acute emetogenicity of antineoplastic chemotherapy agents, and to develop an algorithm to define the emetogenicity of combination chemotherapy regimens. METHODS: A Medline search was conducted to identify (1) clinical trials that used chemotherapy as single-agent therapy, and (2) major reviews of antiemetic therapy. The search was limited to patients who received commonly used doses of chemotherapy agents, primarily by short (< 3 hours) intravenous infusions. Based on review of this information and our collective clinical experience, we assigned chemotherapy agents to one of five emetogenic levels by consensus. A preliminary algorithm to determine the emetogenicity of combination chemotherapy regimens was then designed by consensus. A final algorithm was developed after we analyzed a data base composed of patients treated on the placebo arms of four randomized antiemetic trials. RESULTS: Chemotherapy agents were divided into five levels: level 1 (< 10% of patients experience acute [< or = 24 hours after chemotherapy] emesis without antiemetic prophylaxis); level 2 (10% to 30%); level 3 (30% to 60%); level 4 (60% to 90%); and level 5 (> 90%). For combinations, the emetogenic level was determined by identifying the most emetogenic agent in the combination and then assessing the relative contribution of the other agents. The following rules apply: (1) level 1 agents do not contribute to the emetogenic level of a combination; (2) adding > or = one level 2 agent increases the emetogenicity of the combination by one level greater than the most emetogenic agent in the combination; and (3) adding level 3 or 4 agents increases the emetogenicity of the combination by one level per agent. CONCLUSION: The proposed classification schema provides a practical means to determine the emetogenic potential of individual chemotherapy agents and combination regimens during the 24 hours after administration. This system can serve as a framework for the development of antiemetic guidelines.

Acute Disease↗

A case-based learning approach to grouping cases with multiple malformations.

A case-based classification system can provide assistance to specialists in dysmorphology. This article describes a case-based model designed to assist in identification and retrospective analysis of rare types of syndromes that have proved difficult to diagnose. The primary task of diagnosis is complemented by a learning, or grouping, task. Using data sets of diagnosed cases in related categories of syndromes, we demonstrate how a case-based learning algorithm can extend the retrieval and indexing mechanisms of standard databases to provide a focus for analysis of syndrome classifications.

Abnormalities, Multiple↗

Enhancing density-based data reduction using entropy.

Data reduction algorithms determine a small data subset from a given large data set. In this article, new types of data reduction criteria, based on the concept of entropy, are first presented. These criteria can evaluate the data reduction performance in a sophisticated and comprehensive way. As a result, new data reduction procedures are developed. Using the newly introduced criteria, the proposed data reduction scheme is shown to be efficient and effective. In addition, an outlier-filtering strategy, which is computationally insignificant, is developed. In some instances, this strategy can substantially improve the performance of supervised data analysis. The proposed procedures are compared with related techniques in two types of application: density estimation and classification. Extensive comparative results are included to corroborate the contributions of the proposed algorithms.

Algorithms↗

[Effect of antitachycardia pacemaker on atrial tachyarrhythmia detection, prevention and termination].

OBJECTIVE: The present study retrospectively evaluated the reliability of detecting atrial tachyarrhythmias (ATA), the efficacy of automatic atrial antitachycardia pacing (ATP) and the performance of atrial preventive pacing (APP) algorithms in an implanted antitachycardia DDDRP pacemaker for patients with sick sinus syndrome and paroxysmal ATA. METHODS: In all 24 patients, a DDDRP pacemaker (Medtronic AT500/AT501) was implanted. APP algorithms were switched on at the implanting physician's discretion. During each pacemaker follow-up, information was saved to disk and the ATA burden between those patients with APP algorithms switched "ON" and "OFF" were compared. Reliability of ATA detection was determined by reviewing the stored electrograms and ATP efficacy was also reviewed. Both the pacemaker memory data and manual EGM retrieval were used for the analysis. RESULTS: Complication-free survival at (17.63 +/- 8.79) months was 100%. In 12 patients APP was not turned "ON" until the latest follow-up, in 6 patients APP was switched "ON" at their first visit after implantation, and in another 6 patients APP was switched "ON" after a median follow-up of 9.29 months. There were 97 367 episodes of ATA detected by the devices, of those with stored atrial electrograms the correct classification of ATA was (76.77 +/- 20.52)%. The percentage of atrial pacing with APP algorithms turned on was (87.95 +/- 20.93)%, which was significantly higher than that in patients with APP "OFF" (50.73 +/- 34.46)% (P < 0.01). ATP efficacy was (50.27 +/- 19.29)%. However, the ATA burden (14.73% vs 16.52%, or 7.52 hours vs 6.58 hours per week, P > 0.05) and the longest duration of single ATA episode (27.27 hours vs 20.75 hours, P > 0.05) were not significantly different between those patients with APP "ON" and "OFF". No proarrhythmic effect or major cardiovascular event was observed. CONCLUSIONS: The antitachycardia DDDRP pacemaker correctly detects and diagnoses about 75% of the ATA episodes, while the ATP therapy successfully terminates atrial tachycardia or flutter in about 50% of attacks. However, there is no difference in ATA burden with the APP algorithms and high incidence of atrial pacing. As a non-curative therapy strategy, this high-cost device may only be used in strictly selected indication patients in addition to other treatments of ATA.

Aged↗

Discrimination of pathological voices using a time-frequency approach.

Acoustical measures of vocal function are routinely used in the assessments of disordered voice, and for monitoring the patient's progress over the course of voice therapy. Typically, acoustic measures are extracted from sustained vowel stimuli where short-term and long-term perturbations in fundamental frequency and intensity, and the level of "glottal noise" are used to characterize the vocal function. However, acoustic measures extracted from continuous speech samples may well be required for accurate prediction of abnormal voice quality that is relevant to the client's "real world" experience. In contrast with sustained vowel research, there is relatively sparse literature on the effectiveness of acoustic measures extracted from continuous speech samples. This is partially due to the challenge of segmenting the speech signal into voiced, unvoiced, and silence periods before features can be extracted for vocal function characterization. In this paper we propose a joint time-frequency approach for classifying pathological voices using continuous speech signals that obviates the need for such segmentation. The speech signals were decomposed using an adaptive time-frequency transform algorithm, and several features such as the octave max, octave mean, energy ratio, length ratio, and frequency ratio were extracted from the decomposition parameters and analyzed using statistical pattern classification techniques. Experiments with a database consisting of continuous speech samples from 51 normal and 161 pathological talkers yielded a classification accuracy of 93.4%.

Algorithms↗

On the statistical assessment of classifiers using DNA microarray data.

BACKGROUND: In this paper we present a method for the statistical assessment of cancer predictors which make use of gene expression profiles. The methodology is applied to a new data set of microarray gene expression data collected in Casa Sollievo della Sofferenza Hospital, Foggia--Italy. The data set is made up of normal (22) and tumor (25) specimens extracted from 25 patients affected by colon cancer. We propose to give answers to some questions which are relevant for the automatic diagnosis of cancer such as: Is the size of the available data set sufficient to build accurate classifiers? What is the statistical significance of the associated error rates? In what ways can accuracy be considered dependant on the adopted classification scheme? How many genes are correlated with the pathology and how many are sufficient for an accurate colon cancer classification? The method we propose answers these questions whilst avoiding the potential pitfalls hidden in the analysis and interpretation of microarray data. RESULTS: We estimate the generalization error, evaluated through the Leave-K-Out Cross Validation error, for three different classification schemes by varying the number of training examples and the number of the genes used. The statistical significance of the error rate is measured by using a permutation test. We provide a statistical analysis in terms of the frequencies of the genes involved in the classification. Using the whole set of genes, we found that the Weighted Voting Algorithm (WVA) classifier learns the distinction between normal and tumor specimens with 25 training examples, providing e = 21% (p = 0.045) as an error rate. This remains constant even when the number of examples increases. Moreover, Regularized Least Squares (RLS) and Support Vector Machines (SVM) classifiers can learn with only 15 training examples, with an error rate of e = 19% (p = 0.035) and e = 18% (p = 0.037) respectively. Moreover, the error rate decreases as the training set size increases, reaching its best performances with 35 training examples. In this case, RLS and SVM have error rates of e = 14% (p = 0.027) and e = 11% (p = 0.019). Concerning the number of genes, we found about 6000 genes (p < 0.05) correlated with the pathology, resulting from the signal-to-noise statistic. Moreover the performances of RLS and SVM classifiers do not change when 74% of genes is used. They progressively reduce up to e = 16% (p < 0.05) when only 2 genes are employed. The biological relevance of a set of genes determined by our statistical analysis and the major roles they play in colorectal tumorigenesis is discussed. CONCLUSIONS: The method proposed provides statistically significant answers to precise questions relevant for the diagnosis and prognosis of cancer. We found that, with as few as 15 examples, it is possible to train statistically significant classifiers for colon cancer diagnosis. As for the definition of the number of genes sufficient for a reliable classification of colon cancer, our results suggest that it depends on the accuracy required.

Aged↗

Multiclass classification of microarray data with repeated measurements: application to cancer.

Prediction of the diagnostic category of a tissue sample from its gene-expression profile and selection of relevant genes for class prediction have important applications in cancer research. We have developed the uncorrelated shrunken centroid (USC) and error-weighted, uncorrelated shrunken centroid (EWUSC) algorithms that are applicable to microarray data with any number of classes. We show that removing highly correlated genes typically improves classification results using a small set of genes.

Algorithms↗