PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Performance benchmarking”

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 973 records · Page 54Linked to original sources

A community resource benchmarking predictions of peptide binding to MHC-I molecules.

Recognition of peptides bound to major histocompatibility complex (MHC) class I molecules by T lymphocytes is an essential part of immune surveillance. Each MHC allele has a characteristic peptide binding preference, which can be captured in prediction algorithms, allowing for the rapid scan of entire pathogen proteomes for peptide likely to bind MHC. Here we make public a large set of 48,828 quantitative peptide-binding affinity measurements relating to 48 different mouse, human, macaque, and chimpanzee MHC class I alleles. We use this data to establish a set of benchmark predictions with one neural network method and two matrix-based prediction methods extensively utilized in our groups. In general, the neural network outperforms the matrix-based predictions mainly due to its ability to generalize even on a small amount of data. We also retrieved predictions from tools publicly available on the internet. While differences in the data used to generate these predictions hamper direct comparisons, we do conclude that tools based on combinatorial peptide libraries perform remarkably well. The transparent prediction evaluation on this dataset provides tool developers with a benchmark for comparison of newly developed prediction methods. In addition, to generate and evaluate our own prediction methods, we have established an easily extensible web-based prediction framework that allows automated side-by-side comparisons of prediction methods implemented by experts. This is an advance over the current practice of tool developers having to generate reference predictions themselves, which can lead to underestimating the performance of prediction methods they are not as familiar with as their own. The overall goal of this effort is to provide a transparent prediction evaluation allowing bioinformaticians to identify promising features of prediction methods and providing guidance to immunologists regarding the reliability of prediction tools.

Animals↗

Alternative methods to examine hospital efficiency: data envelopment analysis and stochastic frontier analysis.

There has been increasing interest in the ability of different methods to rank efficient hospitals over their inefficient counterparts. The UK Department of Health has used three cost indices to benchmark NHS hospitals (Trusts). This study uses the same dataset and compares the efficiency rankings from the cost indices with those obtained using Data Envelopment Analysis (DEA) and Stochastic Frontier Analysis (SFA). The paper concludes that the methods each have particular strengths and weaknesses and potentially measure different aspects of efficiency. Several specifications should be used to develop ranges of inefficiency to act as signalling devices rather than point estimates. It is argued that differences in efficiency scores across different methods may be due to random "noise" and reflect data deficiencies. The conclusions concur with previous findings that there are not truly large efficiency differences between Trusts and savings from bringing up poorer performers would in fact be quite modest.

Benchmarking↗

Oxidative addition of the ethane C-C bond to Pd. An ab initio benchmark and DFT validation study.

We have computed a state-of-the-art benchmark potential energy surface (PES) for the archetypal oxidative addition of the ethane C-C bond to the palladium atom and have used this to evaluate the performance of 24 popular density functionals, covering LDA, GGA, meta-GGA, and hybrid density functionals, for describing this reaction. The ab initio benchmark is obtained by exploring the PES using a hierarchical series of ab initio methods [HF, MP2, CCSD, CCSD(T)] in combination with a hierarchical series of five Gaussian-type basis sets, up to g polarization. Relativistic effects are taken into account either through a relativistic effective core potential for palladium or through a full four-component all-electron approach. Our best estimate of kinetic and thermodynamic parameters is -10.8 (-11.3) kcal/mol for the formation of the reactant complex, 19.4 (17.1) kcal/mol for the activation energy relative to the separate reactants, and -4.5 (-6.8) kcal/mol for the reaction energy (zero-point vibrational energy-corrected values in parentheses). Our work highlights the importance of sufficient higher angular momentum polarization functions for correctly describing metal-d-electron correlation. Best overall agreement with our ab initio benchmark is obtained by functionals from all three categories, GGA, meta-GGA, and hybrid DFT, with mean absolute errors of 1.5 to 2.5 kcal/mol and errors in activation energies ranging from -0.2 to -3.2 kcal/mol. Interestingly, the well-known BLYP functional compares very reasonably with a slight underestimation of the overall barrier by -0.9 kcal/mol. For comparison, with B3LYP we arrive at an overestimation of the overall barrier by 5.8 kcal/mol. On the other hand, B3LYP performs excellently for the central barrier (i.e., relative to the reactant complex) which it underestimates by only -0.1 kcal/mol.

Journal Article↗

Ligand intramolecular motions in ligand-protein interaction: ALPHA, a novel dynamic descriptor and a QSAR study with extended steroid benchmark dataset.

The role of intramolecular motions in ligand-macromolecule interactions has been explored by developing and validating ALPHA, a novel QSAR (quantitative structure-activity relationship) descriptor. It is based on the spectral exponents (alpha), which measure the degree of 1/f alpha noise of coordinate fluctuations in molecular dynamics (MD) simulations. ALPHA is the first truly 'dynamic' QSAR descriptor, i.e., it can be derived directly from an MD trajectory. The performance of ALPHA was tested in detail employing the CBG (corticosteroid binding globulin) affinity of 31 benchmark steroids, supplemented with 11 steroids as an external test set. The only fair (42-50%) correlations of ALPHA with static 3D and electronic descriptors mean that ALPHA forms an independent molecular property. Furthermore, inclusion of ALPHA in the SOMFA/ESP model improves the correlation coefficient from 0.86 to 0.91, and /delta/ave from 0.46 to 0.36 for the benchmark dataset. The predictive ability of ALPHA can be interpreted as indirect evidence of the dynamic contribution to ligand-macromolecule interactions. The physical background of ALPHA is discussed and the importance of molecular motions for biological activity is anticipated.

Ligands↗

A criterion for optimizing kernel parameters in KBDA for image retrieval.

A criterion is proposed to optimize the kernel parameters in Kernel-based Biased Discriminant Analysis (KBDA) for image retrieval. Kernel parameter optimization is performed by optimizing the kernel space such that the positive images are well clustered while the negative ones are pushed far away from the positives. The proposed criterion measures the goodness of a kernel space, and the optimal kernel parameter set is obtained by maximizing this criterion. Retrieval experiments on two benchmark image databases demonstrate the effectiveness of proposed criterion for KBDA to achieve the best possible performance at the cost of a small fractional computational overhead.

Algorithms↗

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↗

NONMEM version III implementation on a VAX 9000: a DCL procedure for single-step execution and the unrealized advantage of a vectorizing FORTRAN compiler.

There is great interest within the FDA, academia, and the pharmaceutical industry to provide more detailed information about the time course of drug concentration and effect in subjects receiving a drug as part of their overall therapy. Advocates of this effort expect the eventual goal of these endeavors to provide labeling which reflects the experience of drug administration to the entire population of potential recipients. The set of techniques which have been thus far applied to this task has been defined as population approach methodologies. While a consensus view on the usefulness of these techniques is not likely to be formed in the near future, most pharmaceutical companies or individuals who provide kinetic/dynamic support for drug development programs are investigating population approach methods. A major setback in this investigation has been the shortage of computational tools to analyze population data. One such algorithm, NONMEM, supplied by the NONMEM Project Group of the University of California, San Francisco has been widely used and remains the most accessible computational tool to date. The program is distributed to users as FORTRAN 77 source code with instructions for platform customization. Given the memory and compiler requirements of this algorithm and the intensive matrix manipulation required for run convergence and parameter estimation, this program's performance is largely determined by the platform and the FORTRAN compiler used to create the NONMEM executable. Benchmark testing on a VAX 9000 with Digital's FORTRAN (v. 1.2) compiler suggests that this is an acceptable platform. Due to excessive branching within the loops of the NONMEM source code, the vector processing capabilities of the KV900-AA vector processor actually decrease performance. A DCL procedure is given to provide single step execution of this algorithm.

Algorithms↗

Implementing achievable benchmarks in preventive health: a controlled trial in residency education.

PURPOSE: To evaluate the Preventive Health Achievable Benchmarks Curriculum, a multifaceted improvement intervention that included an objective, practice-based performance evaluation of internal medicine and pediatric residents' delivery of preventive services. METHOD: The authors conducted a nonrandomized experiment of intervention versus control group residents with baseline and follow-up of performance audited for 2001-2004. All 130 internal medicine and 78 pediatric residents at two continuity clinics at the University of Alabama School of Medicine, Birmingham, participated. Performance of preventive care was assessed by structured chart review. The multifaceted feedback curriculum included individualized performance feedback, academic detailing by faculty, and collective didactic sessions. The main outcome was difference in receipt of preventive care for patients seen by intervention and control residents, comparing baseline and follow-up. RESULTS: Charts were reviewed for 3,958 patients. Receipt of preventive care increased for patients of intervention residents, but not for patients of control residents. For the intervention group, significant increases occurred for five of six indicators in internal medicine: smoking screening, quit smoking advice, colon cancer screening, pneumonia vaccine, and lipid screening; and four of six in pediatrics: parental quit smoking advice, car seats, car restraints, and eye alignment (p < .05 for all). For control residents, no consistent improvements were seen. There was greater improvement for intervention than for control residents for four of six indicators in internal medicine, and two of six in pediatrics. CONCLUSIONS: Using a multifaceted feedback curriculum, the authors taught residents about the care they provide and improved documented patient care.

Adult↗

A study on protein sequence alignment quality.

One of the most central methods in bioinformatics is the alignment of two protein or DNA sequences. However, so far large-scale benchmarks examining the quality of these alignments are scarce. On the other hand, recently several large-scale studies of the capacity of different methods to identify related sequences has led to new insights about the performance of fold recognition methods. To increase our understanding about fold recognition methods, we present a large-scale benchmark of alignment quality. We compare alignments from several different alignment methods, including sequence alignments, hidden Markov models, PSI-BLAST, CLUSTALW, and threading methods. For most methods, the alignment quality increases significantly at about 20% sequence identity. The difference in alignment quality between different methods is quite small, and the main difference can be seen at the exact positioning of the sharp rise in alignment quality, that is, around 15-20% sequence identity. The alignments are improved by using structural information. In general, the best alignments are obtained by methods that use predicted secondary structure information and sequence profiles obtained from PSI-BLAST. One interesting observation is that for different pairs many different methods create the best alignments. This finding implies that if a method that could select the best alignment method for each pair existed, a significant improvement of the alignment quality could be gained.

Computational Biology↗

stDyer-image improves clustering analysis of spatially resolved transcriptomics and proteomics with morphological images.

MOTIVATION: Spatially resolved transcriptomics (SRT) and spatially resolved proteomics (SRP) data enable the study of gene expression and protein abundances within their precise spatial and cellular contexts in tissues. Certain SRT and SRP technologies also capture corresponding morphology images, adding another layer of valuable information. However, few existing methods developed for SRT data effectively leverage these supplementary images to enhance clustering performance. RESULTS: Here, we introduce stDyer-image, an end-to-end deep learning framework designed for clustering for SRT and SRP datasets with images. Unlike existing methods that utilize images to complement gene expression data, stDyer-image directly links image features to cluster labels. This approach draws inspiration from pathologists, who can visually identify specific cell types or tumor regions from morphological images without relying on gene expression or protein abundances. Benchmarks against state-of-the-art tools demonstrate that stDyer-image achieves superior performance in clustering. Moreover, it is capable of handling large-scale datasets across diverse technologies, making it a versatile and powerful tool for spatial omics analysis. AVAILABILITY AND IMPLEMENTATION: The source code of stDyer-image and detailed tutorials are available at https://github.com/ericcombiolab/stDyer-image.

Proteomics↗

Intelligent on-line fault tolerant control for unanticipated catastrophic failures.

As dynamic systems become increasingly complex, experience rapidly changing environments, and encounter a greater variety of unexpected component failures, solving the control problems of such systems is a grand challenge for control engineers. Traditional control design techniques are not adequate to cope with these systems, which may suffer from unanticipated dynamic failures. In this research work, we investigate the on-line fault tolerant control problem and propose an intelligent on-line control strategy to handle the desired trajectories tracking problem for systems suffering from various unanticipated catastrophic faults. Through theoretical analysis, the sufficient condition of system stability has been derived and two different on-line control laws have been developed. The approach of the proposed intelligent control strategy is to continuously monitor the system performance and identify what the system's current state is by using a fault detection method based upon our best knowledge of the nominal system and nominal controller. Once a fault is detected, the proposed intelligent controller will adjust its control signal to compensate for the unknown system failure dynamics by using an artificial neural network as an on-line estimator to approximate the unexpected and unknown failure dynamics. The first control law is derived directly from the Lyapunov stability theory, while the second control law is derived based upon the discrete-time sliding mode control technique. Both control laws have been implemented in a variety of failure scenarios to validate the proposed intelligent control scheme. The simulation results, including a three-tank benchmark problem, comply with theoretical analysis and demonstrate a significant improvement in trajectory following performance based upon the proposed intelligent control strategy.

Artificial Intelligence↗

Critical success factors for performance improvement programs.

BACKGROUND: Most health care organizations struggle with the design and implementation of effective, systemwide improvement programs. In 2000, the University HealthSystem Consortium initiated a benchmarking project to identify the organizational elements that predict a successful perfermance improvement (PI) program and that are best suited to support change initiatives. METHODS: Forty-one organizations completed a survey about the presence of critical components, processes used to improve performance, and organizational PI structures. Follow-up site visits were conducted at three organizations. CRITICAL SUCCESS FACTORS FOR A PI PROGRAM: Eight organizational success factors for an effective performance improvement program were identified: (1) Strong Administrative Fxecutive and Performance Improvement Leadership, (2) Active Involvement of the Board of Trustees, (3) Effective Oversight Structure, (4) Expert Performance Improvement Staff, (5) Physician Involvement and Accountability, (6) Active Staff Involvement, (7) Effective Use of Information Resources-Data Used for Decision Making, and (8) Effective Communication Strategy. DISCUSSION: The approach offered is grounded in the belief that effective organizational structures and processes are prerequisites to improving health care delivery. Although some empirical support for the proposed model is provided, additional research will be required to determine the effectiveness of this approach.

Benchmarking↗

Wais-III norms for working-age adults: a benchmark for conducting vocational, career, and employment-related evaluations.

The Wechsler Intelligence Scales are routinely used to assess threshold variables which correlate with subsequent job performance. Intellectual testing within educational and clinical settings accommodates natural developmental changes by referencing results to restricted age-band norms. However, accuracy in vocational and career consultation, as well as equity in hiring and promotion requires the application of a single normative benchmark unbiased by chronological age. Such unitary norms for working-age adults (18- to 64-yr.-olds) were derived from the WAIS-III standardization sample in accord with the proportional representation of the seven age-bands subsumed within this age range. Tabular summaries of results are given for the conversion of raw scores to scaled scores for the working-age population which can be used to derive IQ values and Index Scores.

Adolescent↗

Performance evaluation of fingerprint verification systems.

This paper is concerned with the performance evaluation of fingerprint verification systems. After an initial classification of biometric testing initiatives, we explore both the theoretical and practical issues related to performance evaluation by presenting the outcome of the recent Fingerprint Verification Competition (FVC2004). FVC2004 was organized by the authors of this work for the purpose of assessing the state-of-the-art in this challenging pattern recognition application and making available a new common benchmark for an unambiguous comparison of fingerprint-based biometric systems. FVC2004 is an independent, strongly supervised evaluation performed at the evaluators' site on evaluators' hardware. This allowed the test to be completely controlled and the computation times of different algorithms to be fairly compared. The experience and feedback received from previous, similar competitions (FVC2000 and FVC2002) allowed us to improve the organization and methodology of FVC2004 and to capture the attention of a significantly higher number of academic and commercial organizations (67 algorithms were submitted for FVC2004). A new, "Light" competition category was included to estimate the loss of matching performance caused by imposing computational constraints. This paper discusses data collection and testing protocols, and includes a detailed analysis of the results. We introduce a simple but effective method for comparing algorithms at the score level, allowing us to isolate difficult cases (images) and to study error correlations and algorithm "fusion." The huge amount of information obtained, including a structured classification of the submitted algorithms on the basis of their features, makes it possible to better understand how current fingerprint recognition systems work and to delineate useful research directions for the future.

Algorithms↗

Top-down induction of model trees with regression and splitting nodes.

Model trees are an extension of regression trees that associate leaves with multiple regression models. In this paper, a method for the data-driven construction of model trees is presented, namely, the Stepwise Model Tree Induction (SMOTI) method. Its main characteristic is the induction of trees with two types of nodes: regression nodes, which perform only straight-line regression, and splitting nodes, which partition the feature space. The multiple linear model associated with each leaf is then built stepwise by combining straight-line regressions reported along the path from the root to the leaf. In this way, internal regression nodes contribute to the definition of multiple models and have a "global" effect, while straight-line regressions at leaves have only "local" effects. Experimental results on artificially generated data sets show that SMOTI outperforms two model tree induction systems, M5' and RETIS, in accuracy. Results on benchmark data sets used for studies on both regression and model trees show that SMOTI performs better than RETIS in accuracy, while it is not possible to draw statistically significant conclusions on the comparison with M5'. Model trees induced by SMOTI are generally simple and easily interpretable and their analysis often reveals interesting patterns.

Algorithms↗

On the use of multi-objective evolutionary algorithms for the induction of fuzzy classification rule systems.

Extracting comprehensible and general classifiers from data in the form of rule systems is an important task in many problem domains. This study investigates the utility of a multi-objective evolutionary algorithm (MOEA) for this task. Multi-objective evolutionary algorithms are capable of finding several trade-off solutions between different objectives in a single run. In the context of the present study, the objectives to be optimised are the complexity of the rule systems, and their fit to the data. Complex rule systems are required to fit the data well. However, overly complex rule systems often generalise poorly on new data. In addition they tend to be incomprehensible. It is, therefore, important to obtain trade-off solutions that achieve the best possible fit to the data with the lowest possible complexity. The rule systems produced by the proposed multi-objective evolutionary algorithm are compared with those produced by several other existing approaches for a number of benchmark datasets. It is shown that the algorithm produces less complex classifiers that perform well on unseen data.

Algorithms↗

Proteomics at scale: Bottlenecks and opportunities for early-career researchers in a fast developing field.

The field of proteomics has rapidly evolved over the last five years enabled by rapid advances in instrumentation and computation. At the same time, the proteomics community is also growing. This is reflected by the increasing participation in international conferences such as those organized by the European Proteomics Association and the Human Proteome Organization. These events provide early-career researchers with unique opportunities to exchange ideas, develop collaborations, and build networks that support professional development. One such network is the Young Proteomics Investigators Club, a European initiative supported by European Proteomics Association and led by early-career researchers. In this Community-Driven project, we investigate recent trends in proteomics by screening conference abstracts and evaluating the session attendance at Human Proteome Organization Congresses and European Proteomics Association conferences. Based on these analyses, we identified five areas that, from our perspective, are shaping the current trends in proteomics: clinical proteomics, proteomics of post-translational modifications, single-cell proteomics, systems biology and multi-omics, and computational proteomics. For each area, we highlight both unique challenges and identify a common theme: a shift from exploratory studies with manageable sample numbers towards large screenings and cohorts and the generation of big data, which often comes with the lack of computational support, organizational networks, and infrastructure. In this light, we describe the unique challenges and opportunities faced by early-career researchers. We point to actionable directions for enabling reproducible and transparent proteomics as well as community-driven projects and initiatives, which are often providing training and support. SIGNIFICANCE: In this perspective, the Young Proteomics Investigators Club (YPIC) discusses advances in analytical developments and computational approaches in proteomics research. Based on empirical analysis of recent European Proteomics Association conference and Human Proteome Organization congresses contributions, we identify clinical, single-cell, post-translational and systems-level proteomics as the research areas that have gained most momentum in the last three to five years. What makes this work distinctive is that it is written by and for early-career researchers, thereby uniquely identifying where momentum, challenges, and unmet needs converge for the newest generation of proteomics researchers. Rather than cataloguing advances, we examine the widening gap between what modern proteomics can generate and what individual researchers can realistically process, validate, and interpret. We describe specific structural barriers including access to high performance computing, limited formal training in scalable data analysis, the need for unified benchmarking standards and navigating clinical collaboration frameworks. We then highlight opportunities for the field, such as community-curated benchmarks, interdisciplinary mentorship models, and shared computational infrastructure. By making these challenges explicit from an early-career researchers standpoint, we aim to inform how training, funding, and community initiatives can be shaped to support the next generation of proteomics researchers.

Proteomics↗

Granular self-organizing map (grSOM) for structure identification.

This work presents a useful extension of Kohonen's Self-Organizing Map (KSOM) for structure identification in linguistic (fuzzy) system modeling applications. More specifically the granular SOM neural model is presented for inducing a distribution of nonparametric fuzzy interval numbers (FINs) from the data. A FIN can represent a local probability distribution function and/or a conventional fuzzy set; moreover, a FIN is interpreted as an information granule. Learning is based on a novel metric distance d(K)(.,.) between FINs. The metric d(K)(.,.) can be tuned nonlinearly by a mass function m(x), the latter attaches a weight of significance to a real number 'x' in a data dimension. Rigorous analysis is based on mathematical lattice theory. A grSOM can cope with ambiguity by processing linguistic (fuzzy) input data and/or intervals. This work presents a simple grSOM variant, namely greedy grSOM, for classification. A genetic algorithm (GA) introduces tunable nonlinearities during training. Extensive comparisons are shown with related work from the literature. The practical effectiveness of the greedy grSOM is demonstrated comparatively in three benchmark classification problems. Statistical evidence strongly suggests that the proposed techniques improve classification performance. In addition, the greedy grSOM induces descriptive decision-making knowledge (fuzzy rules) from the training data.

Fuzzy Logic↗