Minimizing the semantic gap in biomedical content-based image retrieval

NASA Astrophysics Data System (ADS)

Guan, Haiying; Antani, Sameer; Long, L. Rodney; Thoma, George R.

2010-03-01

A major challenge in biomedical Content-Based Image Retrieval (CBIR) is to achieve meaningful mappings that minimize the semantic gap between the high-level biomedical semantic concepts and the low-level visual features in images. This paper presents a comprehensive learning-based scheme toward meeting this challenge and improving retrieval quality. The article presents two algorithms: a learning-based feature selection and fusion algorithm and the Ranking Support Vector Machine (Ranking SVM) algorithm. The feature selection algorithm aims to select 'good' features and fuse them using different similarity measurements to provide a better representation of the high-level concepts with the low-level image features. Ranking SVM is applied to learn the retrieval rank function and associate the selected low-level features with query concepts, given the ground-truth ranking of the training samples. The proposed scheme addresses four major issues in CBIR to improve the retrieval accuracy: image feature extraction, selection and fusion, similarity measurements, the association of the low-level features with high-level concepts, and the generation of the rank function to support high-level semantic image retrieval. It models the relationship between semantic concepts and image features, and enables retrieval at the semantic level. We apply it to the problem of vertebra shape retrieval from a digitized spine x-ray image set collected by the second National Health and Nutrition Examination Survey (NHANES II). The experimental results show an improvement of up to 41.92% in the mean average precision (MAP) over conventional image similarity computation methods.

22 CFR 11.11 - Mid-level Foreign Service officer career candidate appointments.

Code of Federal Regulations, 2014 CFR

2014-04-01

... cannot reasonably be met from within the ranks of the career service, including by special training of... rank-order register for the class and functional specialty for which the candidate has been found... aptitude for learning them. A candidate may be appointed without first having passed an examination in a...

22 CFR 11.11 - Mid-level Foreign Service officer career candidate appointments.

Code of Federal Regulations, 2012 CFR

2012-04-01

... cannot reasonably be met from within the ranks of the career service, including by special training of... rank-order register for the class and functional specialty for which the candidate has been found... aptitude for learning them. A candidate may be appointed without first having passed an examination in a...

22 CFR 11.11 - Mid-level Foreign Service officer career candidate appointments.

Code of Federal Regulations, 2011 CFR

2011-04-01

... cannot reasonably be met from within the ranks of the career service, including by special training of... rank-order register for the class and functional specialty for which the candidate has been found... aptitude for learning them. A candidate may be appointed without first having passed an examination in a...

A collaborative filtering approach for protein-protein docking scoring functions.

PubMed

Bourquard, Thomas; Bernauer, Julie; Azé, Jérôme; Poupon, Anne

2011-04-22

A protein-protein docking procedure traditionally consists in two successive tasks: a search algorithm generates a large number of candidate conformations mimicking the complex existing in vivo between two proteins, and a scoring function is used to rank them in order to extract a native-like one. We have already shown that using Voronoi constructions and a well chosen set of parameters, an accurate scoring function could be designed and optimized. However to be able to perform large-scale in silico exploration of the interactome, a near-native solution has to be found in the ten best-ranked solutions. This cannot yet be guaranteed by any of the existing scoring functions. In this work, we introduce a new procedure for conformation ranking. We previously developed a set of scoring functions where learning was performed using a genetic algorithm. These functions were used to assign a rank to each possible conformation. We now have a refined rank using different classifiers (decision trees, rules and support vector machines) in a collaborative filtering scheme. The scoring function newly obtained is evaluated using 10 fold cross-validation, and compared to the functions obtained using either genetic algorithms or collaborative filtering taken separately. This new approach was successfully applied to the CAPRI scoring ensembles. We show that for 10 targets out of 12, we are able to find a near-native conformation in the 10 best ranked solutions. Moreover, for 6 of them, the near-native conformation selected is of high accuracy. Finally, we show that this function dramatically enriches the 100 best-ranking conformations in near-native structures.

A Collaborative Filtering Approach for Protein-Protein Docking Scoring Functions

PubMed Central

Bourquard, Thomas; Bernauer, Julie; Azé, Jérôme; Poupon, Anne

2011-01-01

A protein-protein docking procedure traditionally consists in two successive tasks: a search algorithm generates a large number of candidate conformations mimicking the complex existing in vivo between two proteins, and a scoring function is used to rank them in order to extract a native-like one. We have already shown that using Voronoi constructions and a well chosen set of parameters, an accurate scoring function could be designed and optimized. However to be able to perform large-scale in silico exploration of the interactome, a near-native solution has to be found in the ten best-ranked solutions. This cannot yet be guaranteed by any of the existing scoring functions. In this work, we introduce a new procedure for conformation ranking. We previously developed a set of scoring functions where learning was performed using a genetic algorithm. These functions were used to assign a rank to each possible conformation. We now have a refined rank using different classifiers (decision trees, rules and support vector machines) in a collaborative filtering scheme. The scoring function newly obtained is evaluated using 10 fold cross-validation, and compared to the functions obtained using either genetic algorithms or collaborative filtering taken separately. This new approach was successfully applied to the CAPRI scoring ensembles. We show that for 10 targets out of 12, we are able to find a near-native conformation in the 10 best ranked solutions. Moreover, for 6 of them, the near-native conformation selected is of high accuracy. Finally, we show that this function dramatically enriches the 100 best-ranking conformations in near-native structures. PMID:21526112

Selection of suitable e-learning approach using TOPSIS technique with best ranked criteria weights

NASA Astrophysics Data System (ADS)

Mohammed, Husam Jasim; Kasim, Maznah Mat; Shaharanee, Izwan Nizal Mohd

2017-11-01

This paper compares the performances of four rank-based weighting assessment techniques, Rank Sum (RS), Rank Reciprocal (RR), Rank Exponent (RE), and Rank Order Centroid (ROC) on five identified e-learning criteria to select the best weights method. A total of 35 experts in a public university in Malaysia were asked to rank the criteria and to evaluate five e-learning approaches which include blended learning, flipped classroom, ICT supported face to face learning, synchronous learning, and asynchronous learning. The best ranked criteria weights are defined as weights that have the least total absolute differences with the geometric mean of all weights, were then used to select the most suitable e-learning approach by using TOPSIS method. The results show that RR weights are the best, while flipped classroom approach implementation is the most suitable approach. This paper has developed a decision framework to aid decision makers (DMs) in choosing the most suitable weighting method for solving MCDM problems.

Machine Learning Estimation of Atom Condensed Fukui Functions.

PubMed

Zhang, Qingyou; Zheng, Fangfang; Zhao, Tanfeng; Qu, Xiaohui; Aires-de-Sousa, João

2016-02-01

To enable the fast estimation of atom condensed Fukui functions, machine learning algorithms were trained with databases of DFT pre-calculated values for ca. 23,000 atoms in organic molecules. The problem was approached as the ranking of atom types with the Bradley-Terry (BT) model, and as the regression of the Fukui function. Random Forests (RF) were trained to predict the condensed Fukui function, to rank atoms in a molecule, and to classify atoms as high/low Fukui function. Atomic descriptors were based on counts of atom types in spheres around the kernel atom. The BT coefficients assigned to atom types enabled the identification (93-94 % accuracy) of the atom with the highest Fukui function in pairs of atoms in the same molecule with differences ≥0.1. In whole molecules, the atom with the top Fukui function could be recognized in ca. 50 % of the cases and, on the average, about 3 of the top 4 atoms could be recognized in a shortlist of 4. Regression RF yielded predictions for test sets with R(2) =0.68-0.69, improving the ability of BT coefficients to rank atoms in a molecule. Atom classification (as high/low Fukui function) was obtained with RF with sensitivity of 55-61 % and specificity of 94-95 %. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks

PubMed Central

Chen, Jianhui; Liu, Ji; Ye, Jieping

2013-01-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms. PMID:24077658

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks.

PubMed

Chen, Jianhui; Liu, Ji; Ye, Jieping

2012-02-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms.

A machine learning approach for ranking clusters of docked protein‐protein complexes by pairwise cluster comparison

PubMed Central

Pfeiffenberger, Erik; Chaleil, Raphael A.G.; Moal, Iain H.

2017-01-01

ABSTRACT Reliable identification of near‐native poses of docked protein–protein complexes is still an unsolved problem. The intrinsic heterogeneity of protein–protein interactions is challenging for traditional biophysical or knowledge based potentials and the identification of many false positive binding sites is not unusual. Often, ranking protocols are based on initial clustering of docked poses followed by the application of an energy function to rank each cluster according to its lowest energy member. Here, we present an approach of cluster ranking based not only on one molecular descriptor (e.g., an energy function) but also employing a large number of descriptors that are integrated in a machine learning model, whereby, an extremely randomized tree classifier based on 109 molecular descriptors is trained. The protocol is based on first locally enriching clusters with additional poses, the clusters are then characterized using features describing the distribution of molecular descriptors within the cluster, which are combined into a pairwise cluster comparison model to discriminate near‐native from incorrect clusters. The results show that our approach is able to identify clusters containing near‐native protein–protein complexes. In addition, we present an analysis of the descriptors with respect to their power to discriminate near native from incorrect clusters and how data transformations and recursive feature elimination can improve the ranking performance. Proteins 2017; 85:528–543. © 2016 Wiley Periodicals, Inc. PMID:27935158

Identification of Functionally Related Enzymes by Learning-to-Rank Methods.

PubMed

Stock, Michiel; Fober, Thomas; Hüllermeier, Eyke; Glinca, Serghei; Klebe, Gerhard; Pahikkala, Tapio; Airola, Antti; De Baets, Bernard; Waegeman, Willem

2014-01-01

Enzyme sequences and structures are routinely used in the biological sciences as queries to search for functionally related enzymes in online databases. To this end, one usually departs from some notion of similarity, comparing two enzymes by looking for correspondences in their sequences, structures or surfaces. For a given query, the search operation results in a ranking of the enzymes in the database, from very similar to dissimilar enzymes, while information about the biological function of annotated database enzymes is ignored. In this work, we show that rankings of that kind can be substantially improved by applying kernel-based learning algorithms. This approach enables the detection of statistical dependencies between similarities of the active cleft and the biological function of annotated enzymes. This is in contrast to search-based approaches, which do not take annotated training data into account. Similarity measures based on the active cleft are known to outperform sequence-based or structure-based measures under certain conditions. We consider the Enzyme Commission (EC) classification hierarchy for obtaining annotated enzymes during the training phase. The results of a set of sizeable experiments indicate a consistent and significant improvement for a set of similarity measures that exploit information about small cavities in the surface of enzymes.

Production of grooming-associated sounds by chimpanzees (Pan troglodytes) at Ngogo: variation, social learning, and possible functions.

PubMed

Watts, David P

2016-01-01

Chimpanzees (Pan troglodytes) use some communicative signals flexibly and voluntarily, with use influenced by learning. These signals include some vocalizations and also sounds made using the lips, oral cavity, and/or teeth, but not the vocal tract, such as "attention-getting" sounds directed at humans by captive chimpanzees and lip smacking during social grooming. Chimpanzees at Ngogo, in Kibale National Park, Uganda, make four distinct sounds while grooming others. Here, I present data on two of these ("splutters" and "teeth chomps") and consider whether social learning contributes to variation in their production and whether they serve social functions. Higher congruence in the use of these two sounds between dyads of maternal relatives than dyads of non-relatives implies that social learning occurs and mostly involves vertical transmission, but the results are not conclusive and it is unclear which learning mechanisms may be involved. In grooming between adult males, tooth chomps and splutters were more likely in long than in short bouts; in bouts that were bidirectional rather than unidirectional; in grooming directed toward high-ranking males than toward low-ranking males; and in bouts between allies than in those between non-allies. Males were also more likely to make these sounds while they were grooming other males than while they were grooming females. These results are expected if the sounds promote social bonds and induce tolerance of proximity and of grooming by high-ranking males. However, the alternative hypothesis that the sounds are merely associated with motivation to groom, with no additional social function, cannot be ruled out. Limited data showing that bouts accompanied by teeth chomping or spluttering at their initiation were longer than bouts for which this was not the case point toward a social function, but more data are needed for a definitive test. Comparison to other research sites shows that the possible existence of grooming-specific sound dialects in chimpanzees deserves further investigation.

Learning to rank diversified results for biomedical information retrieval from multiple features.

PubMed

Wu, Jiajin; Huang, Jimmy; Ye, Zheng

2014-01-01

Different from traditional information retrieval (IR), promoting diversity in IR takes consideration of relationship between documents in order to promote novelty and reduce redundancy thus to provide diversified results to satisfy various user intents. Diversity IR in biomedical domain is especially important as biologists sometimes want diversified results pertinent to their query. A combined learning-to-rank (LTR) framework is learned through a general ranking model (gLTR) and a diversity-biased model. The former is learned from general ranking features by a conventional learning-to-rank approach; the latter is constructed with diversity-indicating features added, which are extracted based on the retrieved passages' topics detected using Wikipedia and ranking order produced by the general learning-to-rank model; final ranking results are given by combination of both models. Compared with baselines BM25 and DirKL on 2006 and 2007 collections, the gLTR has 0.2292 (+16.23% and +44.1% improvement over BM25 and DirKL respectively) and 0.1873 (+15.78% and +39.0% improvement over BM25 and DirKL respectively) in terms of aspect level of mean average precision (Aspect MAP). The LTR method outperforms gLTR on 2006 and 2007 collections with 4.7% and 2.4% improvement in terms of Aspect MAP. The learning-to-rank method is an efficient way for biomedical information retrieval and the diversity-biased features are beneficial for promoting diversity in ranking results.

The Trail Making test: a study of its ability to predict falls in the acute neurological in-patient population.

PubMed

Mateen, Bilal Akhter; Bussas, Matthias; Doogan, Catherine; Waller, Denise; Saverino, Alessia; Király, Franz J; Playford, E Diane

2018-05-01

To determine whether tests of cognitive function and patient-reported outcome measures of motor function can be used to create a machine learning-based predictive tool for falls. Prospective cohort study. Tertiary neurological and neurosurgical center. In all, 337 in-patients receiving neurosurgical, neurological, or neurorehabilitation-based care. Binary (Y/N) for falling during the in-patient episode, the Trail Making Test (a measure of attention and executive function) and the Walk-12 (a patient-reported measure of physical function). The principal outcome was a fall during the in-patient stay ( n = 54). The Trail test was identified as the best predictor of falls. Moreover, addition of other variables, did not improve the prediction (Wilcoxon signed-rank P < 0.001). Classical linear statistical modeling methods were then compared with more recent machine learning based strategies, for example, random forests, neural networks, support vector machines. The random forest was the best modeling strategy when utilizing just the Trail Making Test data (Wilcoxon signed-rank P < 0.001) with 68% (± 7.7) sensitivity, and 90% (± 2.3) specificity. This study identifies a simple yet powerful machine learning (Random Forest) based predictive model for an in-patient neurological population, utilizing a single neuropsychological test of cognitive function, the Trail Making test.

Learning Efficient Sparse and Low Rank Models.

PubMed

Sprechmann, P; Bronstein, A M; Sapiro, G

2015-09-01

Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion in discriminative learning scenarios. In this work, we propose to move the emphasis from the model to the pursuit algorithm, and develop a process-centric view of parsimonious modeling, in which a learned deterministic fixed-complexity pursuit process is used in lieu of iterative optimization. We show a principled way to construct learnable pursuit process architectures for structured sparse and robust low rank models, derived from the iteration of proximal descent algorithms. These architectures learn to approximate the exact parsimonious representation at a fraction of the complexity of the standard optimization methods. We also show that appropriate training regimes allow to naturally extend parsimonious models to discriminative settings. State-of-the-art results are demonstrated on several challenging problems in image and audio processing with several orders of magnitude speed-up compared to the exact optimization algorithms.

Improving the Incoherence of a Learned Dictionary via Rank Shrinkage.

PubMed

Ubaru, Shashanka; Seghouane, Abd-Krim; Saad, Yousef

2017-01-01

This letter considers the problem of dictionary learning for sparse signal representation whose atoms have low mutual coherence. To learn such dictionaries, at each step, we first update the dictionary using the method of optimal directions (MOD) and then apply a dictionary rank shrinkage step to decrease its mutual coherence. In the rank shrinkage step, we first compute a rank 1 decomposition of the column-normalized least squares estimate of the dictionary obtained from the MOD step. We then shrink the rank of this learned dictionary by transforming the problem of reducing the rank to a nonnegative garrotte estimation problem and solving it using a path-wise coordinate descent approach. We establish theoretical results that show that the rank shrinkage step included will reduce the coherence of the dictionary, which is further validated by experimental results. Numerical experiments illustrating the performance of the proposed algorithm in comparison to various other well-known dictionary learning algorithms are also presented.

FSMRank: feature selection algorithm for learning to rank.

PubMed

Lai, Han-Jiang; Pan, Yan; Tang, Yong; Yu, Rong

2013-06-01

In recent years, there has been growing interest in learning to rank. The introduction of feature selection into different learning problems has been proven effective. These facts motivate us to investigate the problem of feature selection for learning to rank. We propose a joint convex optimization formulation which minimizes ranking errors while simultaneously conducting feature selection. This optimization formulation provides a flexible framework in which we can easily incorporate various importance measures and similarity measures of the features. To solve this optimization problem, we use the Nesterov's approach to derive an accelerated gradient algorithm with a fast convergence rate O(1/T(2)). We further develop a generalization bound for the proposed optimization problem using the Rademacher complexities. Extensive experimental evaluations are conducted on the public LETOR benchmark datasets. The results demonstrate that the proposed method shows: 1) significant ranking performance gain compared to several feature selection baselines for ranking, and 2) very competitive performance compared to several state-of-the-art learning-to-rank algorithms.

Max-margin multiattribute learning with low-rank constraint.

PubMed

Zhang, Qiang; Chen, Lin; Li, Baoxin

2014-07-01

Attribute learning has attracted a lot of interests in recent years for its advantage of being able to model high-level concepts with a compact set of midlevel attributes. Real-world objects often demand multiple attributes for effective modeling. Most existing methods learn attributes independently without explicitly considering their intrinsic relatedness. In this paper, we propose max margin multiattribute learning with low-rank constraint, which learns a set of attributes simultaneously, using only relative ranking of the attributes for the data. By learning all the attributes simultaneously through low-rank constraint, the proposed method is able to capture their intrinsic correlation for improved learning; by requiring only relative ranking, the method avoids restrictive binary labels of attributes that are often assumed by many existing techniques. The proposed method is evaluated on both synthetic data and real visual data including a challenging video data set. Experimental results demonstrate the effectiveness of the proposed method.

ICTNET at Web Track 2012 Ad-hoc Task

DTIC Science & Technology

2012-11-01

Model and use it as baseline this year. 3.2 Learning to rank Learning to rank (LTR) introduces machine learning to retrieval ranking problem. It...Yoram Singer. An efficient boosting algorithm  for  combining preferences [J]. The Journal of  Machine   Learning  Research. 2003. 

Real-time modeling of primitive environments through wavelet sensors and Hebbian learning

NASA Astrophysics Data System (ADS)

Vaccaro, James M.; Yaworsky, Paul S.

1999-06-01

Modeling the world through sensory input necessarily provides a unique perspective for the observer. Given a limited perspective, objects and events cannot always be encoded precisely but must involve crude, quick approximations to deal with sensory information in a real- time manner. As an example, when avoiding an oncoming car, a pedestrian needs to identify the fact that a car is approaching before ascertaining the model or color of the vehicle. In our methodology, we use wavelet-based sensors with self-organized learning to encode basic sensory information in real-time. The wavelet-based sensors provide necessary transformations while a rank-based Hebbian learning scheme encodes a self-organized environment through translation, scale and orientation invariant sensors. Such a self-organized environment is made possible by combining wavelet sets which are orthonormal, log-scale with linear orientation and have automatically generated membership functions. In earlier work we used Gabor wavelet filters, rank-based Hebbian learning and an exponential modulation function to encode textural information from images. Many different types of modulation are possible, but based on biological findings the exponential modulation function provided a good approximation of first spike coding of `integrate and fire' neurons. These types of Hebbian encoding schemes (e.g., exponential modulation, etc.) are useful for quick response and learning, provide several advantages over contemporary neural network learning approaches, and have been found to quantize data nonlinearly. By combining wavelets with Hebbian learning we can provide a real-time front-end for modeling an intelligent process, such as the autonomous control of agents in a simulated environment.

Learning to predict chemical reactions.

PubMed

Kayala, Matthew A; Azencott, Chloé-Agathe; Chen, Jonathan H; Baldi, Pierre

2011-09-26

Being able to predict the course of arbitrary chemical reactions is essential to the theory and applications of organic chemistry. Approaches to the reaction prediction problems can be organized around three poles corresponding to: (1) physical laws; (2) rule-based expert systems; and (3) inductive machine learning. Previous approaches at these poles, respectively, are not high throughput, are not generalizable or scalable, and lack sufficient data and structure to be implemented. We propose a new approach to reaction prediction utilizing elements from each pole. Using a physically inspired conceptualization, we describe single mechanistic reactions as interactions between coarse approximations of molecular orbitals (MOs) and use topological and physicochemical attributes as descriptors. Using an existing rule-based system (Reaction Explorer), we derive a restricted chemistry data set consisting of 1630 full multistep reactions with 2358 distinct starting materials and intermediates, associated with 2989 productive mechanistic steps and 6.14 million unproductive mechanistic steps. And from machine learning, we pose identifying productive mechanistic steps as a statistical ranking, information retrieval problem: given a set of reactants and a description of conditions, learn a ranking model over potential filled-to-unfilled MO interactions such that the top-ranked mechanistic steps yield the major products. The machine learning implementation follows a two-stage approach, in which we first train atom level reactivity filters to prune 94.00% of nonproductive reactions with a 0.01% error rate. Then, we train an ensemble of ranking models on pairs of interacting MOs to learn a relative productivity function over mechanistic steps in a given system. Without the use of explicit transformation patterns, the ensemble perfectly ranks the productive mechanism at the top 89.05% of the time, rising to 99.86% of the time when the top four are considered. Furthermore, the system is generalizable, making reasonable predictions over reactants and conditions which the rule-based expert does not handle. A web interface to the machine learning based mechanistic reaction predictor is accessible through our chemoinformatics portal ( http://cdb.ics.uci.edu) under the Toolkits section.

Learning to Predict Chemical Reactions

PubMed Central

Kayala, Matthew A.; Azencott, Chloé-Agathe; Chen, Jonathan H.

2011-01-01

Being able to predict the course of arbitrary chemical reactions is essential to the theory and applications of organic chemistry. Approaches to the reaction prediction problems can be organized around three poles corresponding to: (1) physical laws; (2) rule-based expert systems; and (3) inductive machine learning. Previous approaches at these poles respectively are not high-throughput, are not generalizable or scalable, or lack sufficient data and structure to be implemented. We propose a new approach to reaction prediction utilizing elements from each pole. Using a physically inspired conceptualization, we describe single mechanistic reactions as interactions between coarse approximations of molecular orbitals (MOs) and use topological and physicochemical attributes as descriptors. Using an existing rule-based system (Reaction Explorer), we derive a restricted chemistry dataset consisting of 1630 full multi-step reactions with 2358 distinct starting materials and intermediates, associated with 2989 productive mechanistic steps and 6.14 million unproductive mechanistic steps. And from machine learning, we pose identifying productive mechanistic steps as a statistical ranking, information retrieval, problem: given a set of reactants and a description of conditions, learn a ranking model over potential filled-to-unfilled MO interactions such that the top ranked mechanistic steps yield the major products. The machine learning implementation follows a two-stage approach, in which we first train atom level reactivity filters to prune 94.00% of non-productive reactions with a 0.01% error rate. Then, we train an ensemble of ranking models on pairs of interacting MOs to learn a relative productivity function over mechanistic steps in a given system. Without the use of explicit transformation patterns, the ensemble perfectly ranks the productive mechanism at the top 89.05% of the time, rising to 99.86% of the time when the top four are considered. Furthermore, the system is generalizable, making reasonable predictions over reactants and conditions which the rule-based expert does not handle. A web interface to the machine learning based mechanistic reaction predictor is accessible through our chemoinformatics portal (http://cdb.ics.uci.edu) under the Toolkits section. PMID:21819139

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

A sampling-based method for ranking protein structural models by integrating multiple scores and features.

PubMed

Shi, Xiaohu; Zhang, Jingfen; He, Zhiquan; Shang, Yi; Xu, Dong

2011-09-01

One of the major challenges in protein tertiary structure prediction is structure quality assessment. In many cases, protein structure prediction tools generate good structural models, but fail to select the best models from a huge number of candidates as the final output. In this study, we developed a sampling-based machine-learning method to rank protein structural models by integrating multiple scores and features. First, features such as predicted secondary structure, solvent accessibility and residue-residue contact information are integrated by two Radial Basis Function (RBF) models trained from different datasets. Then, the two RBF scores and five selected scoring functions developed by others, i.e., Opus-CA, Opus-PSP, DFIRE, RAPDF, and Cheng Score are synthesized by a sampling method. At last, another integrated RBF model ranks the structural models according to the features of sampling distribution. We tested the proposed method by using two different datasets, including the CASP server prediction models of all CASP8 targets and a set of models generated by our in-house software MUFOLD. The test result shows that our method outperforms any individual scoring function on both best model selection, and overall correlation between the predicted ranking and the actual ranking of structural quality.

When drug discovery meets web search: Learning to Rank for ligand-based virtual screening.

PubMed

Zhang, Wei; Ji, Lijuan; Chen, Yanan; Tang, Kailin; Wang, Haiping; Zhu, Ruixin; Jia, Wei; Cao, Zhiwei; Liu, Qi

2015-01-01

The rapid increase in the emergence of novel chemical substances presents a substantial demands for more sophisticated computational methodologies for drug discovery. In this study, the idea of Learning to Rank in web search was presented in drug virtual screening, which has the following unique capabilities of 1). Applicable of identifying compounds on novel targets when there is not enough training data available for these targets, and 2). Integration of heterogeneous data when compound affinities are measured in different platforms. A standard pipeline was designed to carry out Learning to Rank in virtual screening. Six Learning to Rank algorithms were investigated based on two public datasets collected from Binding Database and the newly-published Community Structure-Activity Resource benchmark dataset. The results have demonstrated that Learning to rank is an efficient computational strategy for drug virtual screening, particularly due to its novel use in cross-target virtual screening and heterogeneous data integration. To the best of our knowledge, we have introduced here the first application of Learning to Rank in virtual screening. The experiment workflow and algorithm assessment designed in this study will provide a standard protocol for other similar studies. All the datasets as well as the implementations of Learning to Rank algorithms are available at http://www.tongji.edu.cn/~qiliu/lor_vs.html. Graphical AbstractThe analogy between web search and ligand-based drug discovery.

Multisensory training can promote or impede visual perceptual learning of speech stimuli: visual-tactile vs. visual-auditory training.

PubMed

Eberhardt, Silvio P; Auer, Edward T; Bernstein, Lynne E

2014-01-01

In a series of studies we have been investigating how multisensory training affects unisensory perceptual learning with speech stimuli. Previously, we reported that audiovisual (AV) training with speech stimuli can promote auditory-only (AO) perceptual learning in normal-hearing adults but can impede learning in congenitally deaf adults with late-acquired cochlear implants. Here, impeder and promoter effects were sought in normal-hearing adults who participated in lipreading training. In Experiment 1, visual-only (VO) training on paired associations between CVCVC nonsense word videos and nonsense pictures demonstrated that VO words could be learned to a high level of accuracy even by poor lipreaders. In Experiment 2, visual-auditory (VA) training in the same paradigm but with the addition of synchronous vocoded acoustic speech impeded VO learning of the stimuli in the paired-associates paradigm. In Experiment 3, the vocoded AO stimuli were shown to be less informative than the VO speech. Experiment 4 combined vibrotactile speech stimuli with the visual stimuli during training. Vibrotactile stimuli were shown to promote visual perceptual learning. In Experiment 5, no-training controls were used to show that training with visual speech carried over to consonant identification of untrained CVCVC stimuli but not to lipreading words in sentences. Across this and previous studies, multisensory training effects depended on the functional relationship between pathways engaged during training. Two principles are proposed to account for stimulus effects: (1) Stimuli presented to the trainee's primary perceptual pathway will impede learning by a lower-rank pathway. (2) Stimuli presented to the trainee's lower rank perceptual pathway will promote learning by a higher-rank pathway. The mechanisms supporting these principles are discussed in light of multisensory reverse hierarchy theory (RHT).

Multisensory training can promote or impede visual perceptual learning of speech stimuli: visual-tactile vs. visual-auditory training

PubMed Central

Eberhardt, Silvio P.; Auer Jr., Edward T.; Bernstein, Lynne E.

2014-01-01

In a series of studies we have been investigating how multisensory training affects unisensory perceptual learning with speech stimuli. Previously, we reported that audiovisual (AV) training with speech stimuli can promote auditory-only (AO) perceptual learning in normal-hearing adults but can impede learning in congenitally deaf adults with late-acquired cochlear implants. Here, impeder and promoter effects were sought in normal-hearing adults who participated in lipreading training. In Experiment 1, visual-only (VO) training on paired associations between CVCVC nonsense word videos and nonsense pictures demonstrated that VO words could be learned to a high level of accuracy even by poor lipreaders. In Experiment 2, visual-auditory (VA) training in the same paradigm but with the addition of synchronous vocoded acoustic speech impeded VO learning of the stimuli in the paired-associates paradigm. In Experiment 3, the vocoded AO stimuli were shown to be less informative than the VO speech. Experiment 4 combined vibrotactile speech stimuli with the visual stimuli during training. Vibrotactile stimuli were shown to promote visual perceptual learning. In Experiment 5, no-training controls were used to show that training with visual speech carried over to consonant identification of untrained CVCVC stimuli but not to lipreading words in sentences. Across this and previous studies, multisensory training effects depended on the functional relationship between pathways engaged during training. Two principles are proposed to account for stimulus effects: (1) Stimuli presented to the trainee’s primary perceptual pathway will impede learning by a lower-rank pathway. (2) Stimuli presented to the trainee’s lower rank perceptual pathway will promote learning by a higher-rank pathway. The mechanisms supporting these principles are discussed in light of multisensory reverse hierarchy theory (RHT). PMID:25400566

Multi-Task Learning with Low Rank Attribute Embedding for Multi-Camera Person Re-Identification.

PubMed

Su, Chi; Yang, Fan; Zhang, Shiliang; Tian, Qi; Davis, Larry Steven; Gao, Wen

2018-05-01

We propose Multi-Task Learning with Low Rank Attribute Embedding (MTL-LORAE) to address the problem of person re-identification on multi-cameras. Re-identifications on different cameras are considered as related tasks, which allows the shared information among different tasks to be explored to improve the re-identification accuracy. The MTL-LORAE framework integrates low-level features with mid-level attributes as the descriptions for persons. To improve the accuracy of such description, we introduce the low-rank attribute embedding, which maps original binary attributes into a continuous space utilizing the correlative relationship between each pair of attributes. In this way, inaccurate attributes are rectified and missing attributes are recovered. The resulting objective function is constructed with an attribute embedding error and a quadratic loss concerning class labels. It is solved by an alternating optimization strategy. The proposed MTL-LORAE is tested on four datasets and is validated to outperform the existing methods with significant margins.

Optimizing Earth Data Search Ranking using Deep Learning and Real-time User Behaviour

NASA Astrophysics Data System (ADS)

Jiang, Y.; Yang, C. P.; Armstrong, E. M.; Huang, T.; Moroni, D. F.; McGibbney, L. J.; Greguska, F. R., III

2017-12-01

Finding Earth science data has been a challenging problem given both the quantity of data available and the heterogeneity of the data across a wide variety of domains. Current search engines in most geospatial data portals tend to induce end users to focus on one single data characteristic dimension (e.g., term frequency-inverse document frequency (TF-IDF) score, popularity, release date, etc.). This approach largely fails to take account of users' multidimensional preferences for geospatial data, and hence may likely result in a less than optimal user experience in discovering the most applicable dataset out of a vast range of available datasets. With users interacting with search engines, sufficient information is already hidden in the log files. Compared with explicit feedback data, information that can be derived/extracted from log files is virtually free and substantially more timely. In this dissertation, I propose an online deep learning framework that can quickly update the learning function based on real-time user clickstream data. The contributions of this framework include 1) a log processor that can ingest, process and create training data from web logs in a real-time manner; 2) a query understanding module to better interpret users' search intent using web log processing results and metadata; 3) a feature extractor that identifies ranking features representing users' multidimensional interests of geospatial data; and 4) a deep learning based ranking algorithm that can be trained incrementally using user behavior data. The search ranking results will be evaluated using precision at K and normalized discounted cumulative gain (NDCG).

[Cognitive enrichment in farm animals--the impact of social rank and social environment on learning behaviour of dwarf goats].

PubMed

Baymann, Ulrike; Langbein, Jan; Siebert, Katrin; Nürnberg, Gerd; Manteuffel, Gerhard; Mohr, Elmar

2007-01-01

The influence of social rank and social environment on visual discrimination learning of small groups of Nigerian dwarf goats (Capra hircus, n = 79) was studied using a computer-controlled learning device integrated in the animals' home pen. The experiment was divided into three sections (LE1, LE1 u, LE2; each 14d). In LE1 the goats learned a discrimination task in a socially stable environment. In LE1u animals were mixed and relocated to another pen and given the same task as in LE1. In LE2 the animals were mixed and relocated again and given a new discrimination task. We used drinking water as a primary reinforcer. The rank category of the goats were analysed as alpha, omega or middle ranking for each section of the experiment. The rank category had an influence on daily learning success (percentage of successful trials per day) only in LE1 u. Daily learning success decreased after mixing and relocation of the animals in LE1 u and LE2 compared to LE1. That resulted in an undersupply of drinking water on the first day of both these tasks. We discuss social stress induced by agonistic interactions after mixing as a reason for that decline. The absolute learning performance (trials to reach the learning criterion) of the omega animals was lower in LE2 compared to the other rank categories. Furthermore, their absolute learning performance was lower in LE2 compared to LE1. For future application of similar automated learning devices in animal husbandry, we recommend against the combination of management routines like mixing and relocation with changes in the learning task because of the negative effects on learning performance, particularly of the omega animals.

Ranking Highlights in Personal Videos by Analyzing Edited Videos.

PubMed

Sun, Min; Farhadi, Ali; Chen, Tseng-Hung; Seitz, Steve

2016-11-01

We present a fully automatic system for ranking domain-specific highlights in unconstrained personal videos by analyzing online edited videos. A novel latent linear ranking model is proposed to handle noisy training data harvested online. Specifically, given a targeted domain such as "surfing," our system mines the YouTube database to find pairs of raw and their corresponding edited videos. Leveraging the assumption that an edited video is more likely to contain highlights than the trimmed parts of the raw video, we obtain pair-wise ranking constraints to train our model. The learning task is challenging due to the amount of noise and variation in the mined data. Hence, a latent loss function is incorporated to mitigate the issues caused by the noise. We efficiently learn the latent model on a large number of videos (about 870 min in total) using a novel EM-like procedure. Our latent ranking model outperforms its classification counterpart and is fairly competitive compared with a fully supervised ranking system that requires labels from Amazon Mechanical Turk. We further show that a state-of-the-art audio feature mel-frequency cepstral coefficients is inferior to a state-of-the-art visual feature. By combining both audio-visual features, we obtain the best performance in dog activity, surfing, skating, and viral video domains. Finally, we show that impressive highlights can be detected without additional human supervision for seven domains (i.e., skating, surfing, skiing, gymnastics, parkour, dog activity, and viral video) in unconstrained personal videos.

Advancing the Relationship between Business School Ranking and Student Learning

ERIC Educational Resources Information Center

Elbeck, Matt

2009-01-01

This commentary advances a positive relationship between a business school's ranking in the popular press and student learning by advocating market-oriented measures of student learning. A framework for student learning is based on the Assurance of Learning mandated by the Association to Advance Collegiate Schools of Business International,…

Candidate gene prioritization by network analysis of differential expression using machine learning approaches

PubMed Central

2010-01-01

Background Discovering novel disease genes is still challenging for diseases for which no prior knowledge - such as known disease genes or disease-related pathways - is available. Performing genetic studies frequently results in large lists of candidate genes of which only few can be followed up for further investigation. We have recently developed a computational method for constitutional genetic disorders that identifies the most promising candidate genes by replacing prior knowledge by experimental data of differential gene expression between affected and healthy individuals. To improve the performance of our prioritization strategy, we have extended our previous work by applying different machine learning approaches that identify promising candidate genes by determining whether a gene is surrounded by highly differentially expressed genes in a functional association or protein-protein interaction network. Results We have proposed three strategies scoring disease candidate genes relying on network-based machine learning approaches, such as kernel ridge regression, heat kernel, and Arnoldi kernel approximation. For comparison purposes, a local measure based on the expression of the direct neighbors is also computed. We have benchmarked these strategies on 40 publicly available knockout experiments in mice, and performance was assessed against results obtained using a standard procedure in genetics that ranks candidate genes based solely on their differential expression levels (Simple Expression Ranking). Our results showed that our four strategies could outperform this standard procedure and that the best results were obtained using the Heat Kernel Diffusion Ranking leading to an average ranking position of 8 out of 100 genes, an AUC value of 92.3% and an error reduction of 52.8% relative to the standard procedure approach which ranked the knockout gene on average at position 17 with an AUC value of 83.7%. Conclusion In this study we could identify promising candidate genes using network based machine learning approaches even if no knowledge is available about the disease or phenotype. PMID:20840752

Group social rank is associated with performance on a spatial learning task.

PubMed

Langley, Ellis J G; van Horik, Jayden O; Whiteside, Mark A; Madden, Joah R

2018-02-01

Dominant individuals differ from subordinates in their performances on cognitive tasks across a suite of taxa. Previous studies often only consider dyadic relationships, rather than the more ecologically relevant social hierarchies or networks, hence failing to account for how dyadic relationships may be adjusted within larger social groups. We used a novel statistical method: randomized Elo-ratings, to infer the social hierarchy of 18 male pheasants, Phasianus colchicus , while in a captive, mixed-sex group with a linear hierarchy. We assayed individual learning performance of these males on a binary spatial discrimination task to investigate whether inter-individual variation in performance is associated with group social rank. Task performance improved with increasing trial number and was positively related to social rank, with higher ranking males showing greater levels of success. Motivation to participate in the task was not related to social rank or task performance, thus indicating that these rank-related differences are not a consequence of differences in motivation to complete the task. Our results provide important information about how variation in cognitive performance relates to an individual's social rank within a group. Whether the social environment causes differences in learning performance or instead, inherent differences in learning ability predetermine rank remains to be tested.

"Earthquake!"--A Cooperative Learning Experience.

ERIC Educational Resources Information Center

Hodder, A. Peter W.

2001-01-01

Presents an exercise designed as a team building experience for managers that can be used to demonstrate to science students the potential benefit of group decision-making. Involves the ranking of options for surviving a large earthquake. Yields quantitative measures of individual student knowledge and how well the groups function. (Author/YDS)

Online Pairwise Learning Algorithms.

PubMed

Ying, Yiming; Zhou, Ding-Xuan

2016-04-01

Pairwise learning usually refers to a learning task that involves a loss function depending on pairs of examples, among which the most notable ones are bipartite ranking, metric learning, and AUC maximization. In this letter we study an online algorithm for pairwise learning with a least-square loss function in an unconstrained setting of a reproducing kernel Hilbert space (RKHS) that we refer to as the Online Pairwise lEaRning Algorithm (OPERA). In contrast to existing works (Kar, Sriperumbudur, Jain, & Karnick, 2013 ; Wang, Khardon, Pechyony, & Jones, 2012 ), which require that the iterates are restricted to a bounded domain or the loss function is strongly convex, OPERA is associated with a non-strongly convex objective function and learns the target function in an unconstrained RKHS. Specifically, we establish a general theorem that guarantees the almost sure convergence for the last iterate of OPERA without any assumptions on the underlying distribution. Explicit convergence rates are derived under the condition of polynomially decaying step sizes. We also establish an interesting property for a family of widely used kernels in the setting of pairwise learning and illustrate the convergence results using such kernels. Our methodology mainly depends on the characterization of RKHSs using its associated integral operators and probability inequalities for random variables with values in a Hilbert space.

Using Trained Pixel Classifiers to Select Images of Interest

NASA Technical Reports Server (NTRS)

Mazzoni, D.; Wagstaff, K.; Castano, R.

2004-01-01

We present a machine-learning-based approach to ranking images based on learned priorities. Unlike previous methods for image evaluation, which typically assess the value of each image based on the presence of predetermined specific features, this method involves using two levels of machine-learning classifiers: one level is used to classify each pixel as belonging to one of a group of rather generic classes, and another level is used to rank the images based on these pixel classifications, given some example rankings from a scientist as a guide. Initial results indicate that the technique works well, producing new rankings that match the scientist's rankings significantly better than would be expected by chance. The method is demonstrated for a set of images collected by a Mars field-test rover.

Machine learning in computational docking.

PubMed

Khamis, Mohamed A; Gomaa, Walid; Ahmed, Walaa F

2015-03-01

The objective of this paper is to highlight the state-of-the-art machine learning (ML) techniques in computational docking. The use of smart computational methods in the life cycle of drug design is relatively a recent development that has gained much popularity and interest over the last few years. Central to this methodology is the notion of computational docking which is the process of predicting the best pose (orientation + conformation) of a small molecule (drug candidate) when bound to a target larger receptor molecule (protein) in order to form a stable complex molecule. In computational docking, a large number of binding poses are evaluated and ranked using a scoring function. The scoring function is a mathematical predictive model that produces a score that represents the binding free energy, and hence the stability, of the resulting complex molecule. Generally, such a function should produce a set of plausible ligands ranked according to their binding stability along with their binding poses. In more practical terms, an effective scoring function should produce promising drug candidates which can then be synthesized and physically screened using high throughput screening process. Therefore, the key to computer-aided drug design is the design of an efficient highly accurate scoring function (using ML techniques). The methods presented in this paper are specifically based on ML techniques. Despite many traditional techniques have been proposed, the performance was generally poor. Only in the last few years started the application of the ML technology in the design of scoring functions; and the results have been very promising. The ML-based techniques are based on various molecular features extracted from the abundance of protein-ligand information in the public molecular databases, e.g., protein data bank bind (PDBbind). In this paper, we present this paradigm shift elaborating on the main constituent elements of the ML approach to molecular docking along with the state-of-the-art research in this area. For instance, the best random forest (RF)-based scoring function on PDBbind v2007 achieves a Pearson correlation coefficient between the predicted and experimentally determined binding affinities of 0.803 while the best conventional scoring function achieves 0.644. The best RF-based ranking power ranks the ligands correctly based on their experimentally determined binding affinities with accuracy 62.5% and identifies the top binding ligand with accuracy 78.1%. We conclude with open questions and potential future research directions that can be pursued in smart computational docking; using molecular features of different nature (geometrical, energy terms, pharmacophore), advanced ML techniques (e.g., deep learning), combining more than one ML models. Copyright © 2015 Elsevier B.V. All rights reserved.

Adaptive low-rank subspace learning with online optimization for robust visual tracking.

PubMed

Liu, Risheng; Wang, Di; Han, Yuzhuo; Fan, Xin; Luo, Zhongxuan

2017-04-01

In recent years, sparse and low-rank models have been widely used to formulate appearance subspace for visual tracking. However, most existing methods only consider the sparsity or low-rankness of the coefficients, which is not sufficient enough for appearance subspace learning on complex video sequences. Moreover, as both the low-rank and the column sparse measures are tightly related to all the samples in the sequences, it is challenging to incrementally solve optimization problems with both nuclear norm and column sparse norm on sequentially obtained video data. To address above limitations, this paper develops a novel low-rank subspace learning with adaptive penalization (LSAP) framework for subspace based robust visual tracking. Different from previous work, which often simply decomposes observations as low-rank features and sparse errors, LSAP simultaneously learns the subspace basis, low-rank coefficients and column sparse errors to formulate appearance subspace. Within LSAP framework, we introduce a Hadamard production based regularization to incorporate rich generative/discriminative structure constraints to adaptively penalize the coefficients for subspace learning. It is shown that such adaptive penalization can significantly improve the robustness of LSAP on severely corrupted dataset. To utilize LSAP for online visual tracking, we also develop an efficient incremental optimization scheme for nuclear norm and column sparse norm minimizations. Experiments on 50 challenging video sequences demonstrate that our tracker outperforms other state-of-the-art methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Generalization Performance of Regularized Ranking With Multiscale Kernels.

PubMed

Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin

2016-05-01

The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.

Implementation of Chaotic Gaussian Particle Swarm Optimization for Optimize Learning-to-Rank Software Defect Prediction Model Construction

NASA Astrophysics Data System (ADS)

Buchari, M. A.; Mardiyanto, S.; Hendradjaya, B.

2018-03-01

Finding the existence of software defect as early as possible is the purpose of research about software defect prediction. Software defect prediction activity is required to not only state the existence of defects, but also to be able to give a list of priorities which modules require a more intensive test. Therefore, the allocation of test resources can be managed efficiently. Learning to rank is one of the approach that can provide defect module ranking data for the purposes of software testing. In this study, we propose a meta-heuristic chaotic Gaussian particle swarm optimization to improve the accuracy of learning to rank software defect prediction approach. We have used 11 public benchmark data sets as experimental data. Our overall results has demonstrated that the prediction models construct using Chaotic Gaussian Particle Swarm Optimization gets better accuracy on 5 data sets, ties in 5 data sets and gets worse in 1 data sets. Thus, we conclude that the application of Chaotic Gaussian Particle Swarm Optimization in Learning-to-Rank approach can improve the accuracy of the defect module ranking in data sets that have high-dimensional features.

Learning to rank-based gene summary extraction.

PubMed

Shang, Yue; Hao, Huihui; Wu, Jiajin; Lin, Hongfei

2014-01-01

In recent years, the biomedical literature has been growing rapidly. These articles provide a large amount of information about proteins, genes and their interactions. Reading such a huge amount of literature is a tedious task for researchers to gain knowledge about a gene. As a result, it is significant for biomedical researchers to have a quick understanding of the query concept by integrating its relevant resources. In the task of gene summary generation, we regard automatic summary as a ranking problem and apply the method of learning to rank to automatically solve this problem. This paper uses three features as a basis for sentence selection: gene ontology relevance, topic relevance and TextRank. From there, we obtain the feature weight vector using the learning to rank algorithm and predict the scores of candidate summary sentences and obtain top sentences to generate the summary. ROUGE (a toolkit for summarization of automatic evaluation) was used to evaluate the summarization result and the experimental results showed that our method outperforms the baseline techniques. According to the experimental result, the combination of three features can improve the performance of summary. The application of learning to rank can facilitate the further expansion of features for measuring the significance of sentences.

Web Image Search Re-ranking with Click-based Similarity and Typicality.

PubMed

Yang, Xiaopeng; Mei, Tao; Zhang, Yong Dong; Liu, Jie; Satoh, Shin'ichi

2016-07-20

In image search re-ranking, besides the well known semantic gap, intent gap, which is the gap between the representation of users' query/demand and the real intent of the users, is becoming a major problem restricting the development of image retrieval. To reduce human effects, in this paper, we use image click-through data, which can be viewed as the "implicit feedback" from users, to help overcome the intention gap, and further improve the image search performance. Generally, the hypothesis visually similar images should be close in a ranking list and the strategy images with higher relevance should be ranked higher than others are widely accepted. To obtain satisfying search results, thus, image similarity and the level of relevance typicality are determinate factors correspondingly. However, when measuring image similarity and typicality, conventional re-ranking approaches only consider visual information and initial ranks of images, while overlooking the influence of click-through data. This paper presents a novel re-ranking approach, named spectral clustering re-ranking with click-based similarity and typicality (SCCST). First, to learn an appropriate similarity measurement, we propose click-based multi-feature similarity learning algorithm (CMSL), which conducts metric learning based on clickbased triplets selection, and integrates multiple features into a unified similarity space via multiple kernel learning. Then based on the learnt click-based image similarity measure, we conduct spectral clustering to group visually and semantically similar images into same clusters, and get the final re-rank list by calculating click-based clusters typicality and withinclusters click-based image typicality in descending order. Our experiments conducted on two real-world query-image datasets with diverse representative queries show that our proposed reranking approach can significantly improve initial search results, and outperform several existing re-ranking approaches.

Improve Biomedical Information Retrieval using Modified Learning to Rank Methods.

PubMed

Xu, Bo; Lin, Hongfei; Lin, Yuan; Ma, Yunlong; Yang, Liang; Wang, Jian; Yang, Zhihao

2016-06-14

In these years, the number of biomedical articles has increased exponentially, which becomes a problem for biologists to capture all the needed information manually. Information retrieval technologies, as the core of search engines, can deal with the problem automatically, providing users with the needed information. However, it is a great challenge to apply these technologies directly for biomedical retrieval, because of the abundance of domain specific terminologies. To enhance biomedical retrieval, we propose a novel framework based on learning to rank. Learning to rank is a series of state-of-the-art information retrieval techniques, and has been proved effective in many information retrieval tasks. In the proposed framework, we attempt to tackle the problem of the abundance of terminologies by constructing ranking models, which focus on not only retrieving the most relevant documents, but also diversifying the searching results to increase the completeness of the resulting list for a given query. In the model training, we propose two novel document labeling strategies, and combine several traditional retrieval models as learning features. Besides, we also investigate the usefulness of different learning to rank approaches in our framework. Experimental results on TREC Genomics datasets demonstrate the effectiveness of our framework for biomedical information retrieval.

Learning User Preferences for Sets of Objects

NASA Technical Reports Server (NTRS)

desJardins, Marie; Eaton, Eric; Wagstaff, Kiri L.

2006-01-01

Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of items. Our learning method takes as input a collection of positive examples--that is, one or more sets that have been identified by a user as desirable. Kernel density estimation is used to estimate the value function for individual items, and the desired set diversity is estimated from the average set diversity observed in the collection. Since this is a new learning problem, we introduce a new evaluation methodology and evaluate the learning method on two data collections: synthetic blocks-world data and a new real-world music data collection that we have gathered.

Assessing Students' Learning of Internal Controls: Closing the Loop

ERIC Educational Resources Information Center

Amer, T. S.; Mohrweis, Lawrence C.

2009-01-01

This study describes the multifaceted components of an assessment process. The paper explains a novel approach in which an advisory council participated in a "fun," hands-on activity to rank-order learning outcomes. The top ranked learning competency, as identified by the advisory council, was the need for students to gain a better…

Weighted Discriminative Dictionary Learning based on Low-rank Representation

NASA Astrophysics Data System (ADS)

Chang, Heyou; Zheng, Hao

2017-01-01

Low-rank representation has been widely used in the field of pattern classification, especially when both training and testing images are corrupted with large noise. Dictionary plays an important role in low-rank representation. With respect to the semantic dictionary, the optimal representation matrix should be block-diagonal. However, traditional low-rank representation based dictionary learning methods cannot effectively exploit the discriminative information between data and dictionary. To address this problem, this paper proposed weighted discriminative dictionary learning based on low-rank representation, where a weighted representation regularization term is constructed. The regularization associates label information of both training samples and dictionary atoms, and encourages to generate a discriminative representation with class-wise block-diagonal structure, which can further improve the classification performance where both training and testing images are corrupted with large noise. Experimental results demonstrate advantages of the proposed method over the state-of-the-art methods.

A Novel Image Recuperation Approach for Diagnosing and Ranking Retinopathy Disease Level Using Diabetic Fundus Image

PubMed Central

2015-01-01

Retinal fundus images are widely used in diagnosing and providing treatment for several eye diseases. Prior works using retinal fundus images detected the presence of exudation with the aid of publicly available dataset using extensive segmentation process. Though it was proved to be computationally efficient, it failed to create a diabetic retinopathy feature selection system for transparently diagnosing the disease state. Also the diagnosis of diseases did not employ machine learning methods to categorize candidate fundus images into true positive and true negative ratio. Several candidate fundus images did not include more detailed feature selection technique for diabetic retinopathy. To apply machine learning methods and classify the candidate fundus images on the basis of sliding window a method called, Diabetic Fundus Image Recuperation (DFIR) is designed in this paper. The initial phase of DFIR method select the feature of optic cup in digital retinal fundus images based on Sliding Window Approach. With this, the disease state for diabetic retinopathy is assessed. The feature selection in DFIR method uses collection of sliding windows to obtain the features based on the histogram value. The histogram based feature selection with the aid of Group Sparsity Non-overlapping function provides more detailed information of features. Using Support Vector Model in the second phase, the DFIR method based on Spiral Basis Function effectively ranks the diabetic retinopathy diseases. The ranking of disease level for each candidate set provides a much promising result for developing practically automated diabetic retinopathy diagnosis system. Experimental work on digital fundus images using the DFIR method performs research on the factors such as sensitivity, specificity rate, ranking efficiency and feature selection time. PMID:25974230

Self-Taught Low-Rank Coding for Visual Learning.

PubMed

Li, Sheng; Li, Kang; Fu, Yun

2018-03-01

The lack of labeled data presents a common challenge in many computer vision and machine learning tasks. Semisupervised learning and transfer learning methods have been developed to tackle this challenge by utilizing auxiliary samples from the same domain or from a different domain, respectively. Self-taught learning, which is a special type of transfer learning, has fewer restrictions on the choice of auxiliary data. It has shown promising performance in visual learning. However, existing self-taught learning methods usually ignore the structure information in data. In this paper, we focus on building a self-taught coding framework, which can effectively utilize the rich low-level pattern information abstracted from the auxiliary domain, in order to characterize the high-level structural information in the target domain. By leveraging a high quality dictionary learned across auxiliary and target domains, the proposed approach learns expressive codings for the samples in the target domain. Since many types of visual data have been proven to contain subspace structures, a low-rank constraint is introduced into the coding objective to better characterize the structure of the given target set. The proposed representation learning framework is called self-taught low-rank (S-Low) coding, which can be formulated as a nonconvex rank-minimization and dictionary learning problem. We devise an efficient majorization-minimization augmented Lagrange multiplier algorithm to solve it. Based on the proposed S-Low coding mechanism, both unsupervised and supervised visual learning algorithms are derived. Extensive experiments on five benchmark data sets demonstrate the effectiveness of our approach.

Sparsity-Based Representation for Classification Algorithms and Comparison Results for Transient Acoustic Signals

DTIC Science & Technology

2016-05-01

large but correlated noise and signal interference (i.e., low -rank interference). Another contribution is the implementation of deep learning...representation, low rank, deep learning 52 Tung-Duong Tran-Luu 301-394-3082Unclassified Unclassified Unclassified UU ii Approved for public release; distribution...Classification of Acoustic Transients 6 3.2 Joint Sparse Representation with Low -Rank Interference 7 3.3 Simultaneous Group-and-Joint Sparse Representation

Similarity preserving low-rank representation for enhanced data representation and effective subspace learning.

PubMed

Zhang, Zhao; Yan, Shuicheng; Zhao, Mingbo

2014-05-01

Latent Low-Rank Representation (LatLRR) delivers robust and promising results for subspace recovery and feature extraction through mining the so-called hidden effects, but the locality of both similar principal and salient features cannot be preserved in the optimizations. To solve this issue for achieving enhanced performance, a boosted version of LatLRR, referred to as Regularized Low-Rank Representation (rLRR), is proposed through explicitly including an appropriate Laplacian regularization that can maximally preserve the similarity among local features. Resembling LatLRR, rLRR decomposes given data matrix from two directions by seeking a pair of low-rank matrices. But the similarities of principal and salient features can be effectively preserved by rLRR. As a result, the correlated features are well grouped and the robustness of representations is also enhanced. Based on the outputted bi-directional low-rank codes by rLRR, an unsupervised subspace learning framework termed Low-rank Similarity Preserving Projections (LSPP) is also derived for feature learning. The supervised extension of LSPP is also discussed for discriminant subspace learning. The validity of rLRR is examined by robust representation and decomposition of real images. Results demonstrated the superiority of our rLRR and LSPP in comparison to other related state-of-the-art algorithms. Copyright © 2014 Elsevier Ltd. All rights reserved.

Testing the encoding elaboration hypothesis: The effects of exemplar ranking on recognition and recall.

PubMed

Schnur, P

1977-11-01

Two experiments investigated the effects of exemplar ranking on retention. High-ranking exemplars are words judged to be prototypical of a given category; low-ranking exemplars are words judged to be atypical of a given category. In Experiment 1, an incidental learning paradigm was used to measure reaction time to answer an encoding question as well as subsequent recognition. It was found that low-ranking exemplars were classified more slowly but recognized better than high-ranking exemplars. Other comparisons of the effects of category encoding, rhyme encoding, and typescript encoding on response latency and recognition replicated the results of Craik and Tulving (1975). In Experiment 2, unanticipated free recall of live previously learned paired associate lists revealed that a list composed of low-ranking exemplars was better recalled than a comparable list composed of high-ranking exemplars. Moreover, this was true only when the lists were studied in the context of appropriate category cues. These findings are discussed in terms of the encoding elaboration hypothesis.

Optimizing Estimated Loss Reduction for Active Sampling in Rank Learning

DTIC Science & Technology

2008-01-01

active learning framework for SVM-based and boosting-based rank learning. Our approach suggests sampling based on maximizing the estimated loss differential over unlabeled data. Experimental results on two benchmark corpora show that the proposed model substantially reduces the labeling effort, and achieves superior performance rapidly with as much as 30% relative improvement over the margin-based sampling

Class Rank Weighs Down True Learning

ERIC Educational Resources Information Center

Guskey, Thomas R.

2014-01-01

The process of determining class rank does not help students achieve more or reach higher levels of proficiency. Evidence indicates ranking students may diminish students' motivation. High school educators argue that they are compelled to rank-order graduating students because selective colleges and universities require information about…

Deep Multimodal Distance Metric Learning Using Click Constraints for Image Ranking.

PubMed

Yu, Jun; Yang, Xiaokang; Gao, Fei; Tao, Dacheng

2017-12-01

How do we retrieve images accurately? Also, how do we rank a group of images precisely and efficiently for specific queries? These problems are critical for researchers and engineers to generate a novel image searching engine. First, it is important to obtain an appropriate description that effectively represent the images. In this paper, multimodal features are considered for describing images. The images unique properties are reflected by visual features, which are correlated to each other. However, semantic gaps always exist between images visual features and semantics. Therefore, we utilize click feature to reduce the semantic gap. The second key issue is learning an appropriate distance metric to combine these multimodal features. This paper develops a novel deep multimodal distance metric learning (Deep-MDML) method. A structured ranking model is adopted to utilize both visual and click features in distance metric learning (DML). Specifically, images and their related ranking results are first collected to form the training set. Multimodal features, including click and visual features, are collected with these images. Next, a group of autoencoders is applied to obtain initially a distance metric in different visual spaces, and an MDML method is used to assign optimal weights for different modalities. Next, we conduct alternating optimization to train the ranking model, which is used for the ranking of new queries with click features. Compared with existing image ranking methods, the proposed method adopts a new ranking model to use multimodal features, including click features and visual features in DML. We operated experiments to analyze the proposed Deep-MDML in two benchmark data sets, and the results validate the effects of the method.

DrugE-Rank: improving drug–target interaction prediction of new candidate drugs or targets by ensemble learning to rank

PubMed Central

Yuan, Qingjun; Gao, Junning; Wu, Dongliang; Zhang, Shihua; Mamitsuka, Hiroshi; Zhu, Shanfeng

2016-01-01

Motivation: Identifying drug–target interactions is an important task in drug discovery. To reduce heavy time and financial cost in experimental way, many computational approaches have been proposed. Although these approaches have used many different principles, their performance is far from satisfactory, especially in predicting drug–target interactions of new candidate drugs or targets. Methods: Approaches based on machine learning for this problem can be divided into two types: feature-based and similarity-based methods. Learning to rank is the most powerful technique in the feature-based methods. Similarity-based methods are well accepted, due to their idea of connecting the chemical and genomic spaces, represented by drug and target similarities, respectively. We propose a new method, DrugE-Rank, to improve the prediction performance by nicely combining the advantages of the two different types of methods. That is, DrugE-Rank uses LTR, for which multiple well-known similarity-based methods can be used as components of ensemble learning. Results: The performance of DrugE-Rank is thoroughly examined by three main experiments using data from DrugBank: (i) cross-validation on FDA (US Food and Drug Administration) approved drugs before March 2014; (ii) independent test on FDA approved drugs after March 2014; and (iii) independent test on FDA experimental drugs. Experimental results show that DrugE-Rank outperforms competing methods significantly, especially achieving more than 30% improvement in Area under Prediction Recall curve for FDA approved new drugs and FDA experimental drugs. Availability: http://datamining-iip.fudan.edu.cn/service/DrugE-Rank Contact: zhusf@fudan.edu.cn Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27307615

DrugE-Rank: improving drug-target interaction prediction of new candidate drugs or targets by ensemble learning to rank.

PubMed

Yuan, Qingjun; Gao, Junning; Wu, Dongliang; Zhang, Shihua; Mamitsuka, Hiroshi; Zhu, Shanfeng

2016-06-15

Identifying drug-target interactions is an important task in drug discovery. To reduce heavy time and financial cost in experimental way, many computational approaches have been proposed. Although these approaches have used many different principles, their performance is far from satisfactory, especially in predicting drug-target interactions of new candidate drugs or targets. Approaches based on machine learning for this problem can be divided into two types: feature-based and similarity-based methods. Learning to rank is the most powerful technique in the feature-based methods. Similarity-based methods are well accepted, due to their idea of connecting the chemical and genomic spaces, represented by drug and target similarities, respectively. We propose a new method, DrugE-Rank, to improve the prediction performance by nicely combining the advantages of the two different types of methods. That is, DrugE-Rank uses LTR, for which multiple well-known similarity-based methods can be used as components of ensemble learning. The performance of DrugE-Rank is thoroughly examined by three main experiments using data from DrugBank: (i) cross-validation on FDA (US Food and Drug Administration) approved drugs before March 2014; (ii) independent test on FDA approved drugs after March 2014; and (iii) independent test on FDA experimental drugs. Experimental results show that DrugE-Rank outperforms competing methods significantly, especially achieving more than 30% improvement in Area under Prediction Recall curve for FDA approved new drugs and FDA experimental drugs. http://datamining-iip.fudan.edu.cn/service/DrugE-Rank zhusf@fudan.edu.cn Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

How Does the Low-Rank Matrix Decomposition Help Internal and External Learnings for Super-Resolution.

PubMed

Wang, Shuang; Yue, Bo; Liang, Xuefeng; Jiao, Licheng

2018-03-01

Wisely utilizing the internal and external learning methods is a new challenge in super-resolution problem. To address this issue, we analyze the attributes of two methodologies and find two observations of their recovered details: 1) they are complementary in both feature space and image plane and 2) they distribute sparsely in the spatial space. These inspire us to propose a low-rank solution which effectively integrates two learning methods and then achieves a superior result. To fit this solution, the internal learning method and the external learning method are tailored to produce multiple preliminary results. Our theoretical analysis and experiment prove that the proposed low-rank solution does not require massive inputs to guarantee the performance, and thereby simplifying the design of two learning methods for the solution. Intensive experiments show the proposed solution improves the single learning method in both qualitative and quantitative assessments. Surprisingly, it shows more superior capability on noisy images and outperforms state-of-the-art methods.

Escape the Black Hole of Lecturing: Put Collaborative Ranking Tasks on Your Event Horizon

NASA Astrophysics Data System (ADS)

Hudgins, D. W.; Prather, E. E.; Grayson, D. J.

2005-05-01

At the University of Arizona, we have been developing and testing a new type of introductory astronomy curriculum material called Ranking Tasks. Ranking Tasks are a form of conceptual exercise that presents students with four to six physical situations, usually by pictures or diagrams, and asks students to rank order the situations based on some resulting effect. Our study developed design guidelines for Ranking Tasks based on learning theory and classroom pilot studies. Our research questions were: Do in-class collaborative Ranking Task exercises result in student conceptual gains when used in conjunction with traditional lecture-based instruction? And are these gains sufficient to justify implementing them into the astronomy classroom? We conducted a single-group repeated measures experiment across eight core introductory astronomy topics with 250 students at the University of Arizona in the Fall of 2004. The study found that traditional lecture-based instruction alone produced statistically significant gains - raising test scores to 61% post-lecture from 32% on the pretest. While significant, we find these gains to be unsatisfactory from a teaching and learning perspective. The study data shows that adding a collaborative learning component to the class structured around Ranking Task exercises helped students achieve statistically significant gains - with post-Ranking Task scores over the eight astronomy topic rising to 77%. Interestingly, we found that the normalized gain from the Ranking Tasks was equal to the entire previous gain from traditional instruction. Further analysis of the data revealed that Ranking Tasks equally benefited both genders; they also equally benefited both high and low-scoring median groups based on their pretest scores. Based on these results, we conclude that adding collaborative Ranking Task exercises to traditional lecture-based instruction can significantly improve student conceptual understanding of core topics in astronomy.

Learning to rank image tags with limited training examples.

PubMed

Songhe Feng; Zheyun Feng; Rong Jin

2015-04-01

With an increasing number of images that are available in social media, image annotation has emerged as an important research topic due to its application in image matching and retrieval. Most studies cast image annotation into a multilabel classification problem. The main shortcoming of this approach is that it requires a large number of training images with clean and complete annotations in order to learn a reliable model for tag prediction. We address this limitation by developing a novel approach that combines the strength of tag ranking with the power of matrix recovery. Instead of having to make a binary decision for each tag, our approach ranks tags in the descending order of their relevance to the given image, significantly simplifying the problem. In addition, the proposed method aggregates the prediction models for different tags into a matrix, and casts tag ranking into a matrix recovery problem. It introduces the matrix trace norm to explicitly control the model complexity, so that a reliable prediction model can be learned for tag ranking even when the tag space is large and the number of training images is limited. Experiments on multiple well-known image data sets demonstrate the effectiveness of the proposed framework for tag ranking compared with the state-of-the-art approaches for image annotation and tag ranking.

Scalable Nonparametric Low-Rank Kernel Learning Using Block Coordinate Descent.

PubMed

Hu, En-Liang; Kwok, James T

2015-09-01

Nonparametric kernel learning (NPKL) is a flexible approach to learn the kernel matrix directly without assuming any parametric form. It can be naturally formulated as a semidefinite program (SDP), which, however, is not very scalable. To address this problem, we propose the combined use of low-rank approximation and block coordinate descent (BCD). Low-rank approximation avoids the expensive positive semidefinite constraint in the SDP by replacing the kernel matrix variable with V(T)V, where V is a low-rank matrix. The resultant nonlinear optimization problem is then solved by BCD, which optimizes each column of V sequentially. It can be shown that the proposed algorithm has nice convergence properties and low computational complexities. Experiments on a number of real-world data sets show that the proposed algorithm outperforms state-of-the-art NPKL solvers.

A multimedia retrieval framework based on semi-supervised ranking and relevance feedback.

PubMed

Yang, Yi; Nie, Feiping; Xu, Dong; Luo, Jiebo; Zhuang, Yueting; Pan, Yunhe

2012-04-01

We present a new framework for multimedia content analysis and retrieval which consists of two independent algorithms. First, we propose a new semi-supervised algorithm called ranking with Local Regression and Global Alignment (LRGA) to learn a robust Laplacian matrix for data ranking. In LRGA, for each data point, a local linear regression model is used to predict the ranking scores of its neighboring points. A unified objective function is then proposed to globally align the local models from all the data points so that an optimal ranking score can be assigned to each data point. Second, we propose a semi-supervised long-term Relevance Feedback (RF) algorithm to refine the multimedia data representation. The proposed long-term RF algorithm utilizes both the multimedia data distribution in multimedia feature space and the history RF information provided by users. A trace ratio optimization problem is then formulated and solved by an efficient algorithm. The algorithms have been applied to several content-based multimedia retrieval applications, including cross-media retrieval, image retrieval, and 3D motion/pose data retrieval. Comprehensive experiments on four data sets have demonstrated its advantages in precision, robustness, scalability, and computational efficiency.

Probabilistic Low-Rank Multitask Learning.

PubMed

Kong, Yu; Shao, Ming; Li, Kang; Fu, Yun

2018-03-01

In this paper, we consider the problem of learning multiple related tasks simultaneously with the goal of improving the generalization performance of individual tasks. The key challenge is to effectively exploit the shared information across multiple tasks as well as preserve the discriminative information for each individual task. To address this, we propose a novel probabilistic model for multitask learning (MTL) that can automatically balance between low-rank and sparsity constraints. The former assumes a low-rank structure of the underlying predictive hypothesis space to explicitly capture the relationship of different tasks and the latter learns the incoherent sparse patterns private to each task. We derive and perform inference via variational Bayesian methods. Experimental results on both regression and classification tasks on real-world applications demonstrate the effectiveness of the proposed method in dealing with the MTL problems.

76 FR 18513 - Announcement of Grant Application Deadlines and Funding Levels

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-04

... Federal statute.) Distance learning means a telecommunications link to an end user through the use of.... Applicants are strongly encouraged to emphasize distance learning and/or telemedicine projects in their.... Applications will be ranked and grants awarded in rank order until all grant funds are expended. 3. Regardless...

Efficiently Ranking Hyphotheses in Machine Learning

NASA Technical Reports Server (NTRS)

Chien, Steve

1997-01-01

This paper considers the problem of learning the ranking of a set of alternatives based upon incomplete information (e.g. a limited number of observations). At each decision cycle, the system can output a complete ordering on the hypotheses or decide to gather additional information (e.g. observation) at some cost.

A Hybrid Method for Opinion Finding Task (KUNLP at TREC 2008 Blog Track)

DTIC Science & Technology

2008-11-01

retrieve relevant documents. For the Opinion Retrieval subtask, we propose a hybrid model of lexicon-based approach and machine learning approach for...estimating and ranking the opinionated documents. For the Polarized Opinion Retrieval subtask, we employ machine learning for predicting the polarity...and linear combination technique for ranking polar documents. The hybrid model which utilize both lexicon-based approach and machine learning approach

Web document ranking via active learning and kernel principal component analysis

NASA Astrophysics Data System (ADS)

Cai, Fei; Chen, Honghui; Shu, Zhen

2015-09-01

Web document ranking arises in many information retrieval (IR) applications, such as the search engine, recommendation system and online advertising. A challenging issue is how to select the representative query-document pairs and informative features as well for better learning and exploring new ranking models to produce an acceptable ranking list of candidate documents of each query. In this study, we propose an active sampling (AS) plus kernel principal component analysis (KPCA) based ranking model, viz. AS-KPCA Regression, to study the document ranking for a retrieval system, i.e. how to choose the representative query-document pairs and features for learning. More precisely, we fill those documents gradually into the training set by AS such that each of which will incur the highest expected DCG loss if unselected. Then, the KPCA is performed via projecting the selected query-document pairs onto p-principal components in the feature space to complete the regression. Hence, we can cut down the computational overhead and depress the impact incurred by noise simultaneously. To the best of our knowledge, we are the first to perform the document ranking via dimension reductions in two dimensions, namely, the number of documents and features simultaneously. Our experiments demonstrate that the performance of our approach is better than that of the baseline methods on the public LETOR 4.0 datasets. Our approach brings an improvement against RankBoost as well as other baselines near 20% in terms of MAP metric and less improvements using P@K and NDCG@K, respectively. Moreover, our approach is particularly suitable for document ranking on the noisy dataset in practice.

Discriminative Dictionary Learning With Two-Level Low Rank and Group Sparse Decomposition for Image Classification.

PubMed

Wen, Zaidao; Hou, Zaidao; Jiao, Licheng

2017-11-01

Discriminative dictionary learning (DDL) framework has been widely used in image classification which aims to learn some class-specific feature vectors as well as a representative dictionary according to a set of labeled training samples. However, interclass similarities and intraclass variances among input samples and learned features will generally weaken the representability of dictionary and the discrimination of feature vectors so as to degrade the classification performance. Therefore, how to explicitly represent them becomes an important issue. In this paper, we present a novel DDL framework with two-level low rank and group sparse decomposition model. In the first level, we learn a class-shared and several class-specific dictionaries, where a low rank and a group sparse regularization are, respectively, imposed on the corresponding feature matrices. In the second level, the class-specific feature matrix will be further decomposed into a low rank and a sparse matrix so that intraclass variances can be separated to concentrate the corresponding feature vectors. Extensive experimental results demonstrate the effectiveness of our model. Compared with the other state-of-the-arts on several popular image databases, our model can achieve a competitive or better performance in terms of the classification accuracy.

Dominance-based ranking functions for interval-valued intuitionistic fuzzy sets.

PubMed

Chen, Liang-Hsuan; Tu, Chien-Cheng

2014-08-01

The ranking of interval-valued intuitionistic fuzzy sets (IvIFSs) is difficult since they include the interval values of membership and nonmembership. This paper proposes ranking functions for IvIFSs based on the dominance concept. The proposed ranking functions consider the degree to which an IvIFS dominates and is not dominated by other IvIFSs. Based on the bivariate framework and the dominance concept, the functions incorporate not only the boundary values of membership and nonmembership, but also the relative relations among IvIFSs in comparisons. The dominance-based ranking functions include bipolar evaluations with a parameter that allows the decision-maker to reflect his actual attitude in allocating the various kinds of dominance. The relationship for two IvIFSs that satisfy the dual couple is defined based on four proposed ranking functions. Importantly, the proposed ranking functions can achieve a full ranking for all IvIFSs. Two examples are used to demonstrate the applicability and distinctiveness of the proposed ranking functions.

Learning Low-Rank Decomposition for Pan-Sharpening With Spatial-Spectral Offsets.

PubMed

Yang, Shuyuan; Zhang, Kai; Wang, Min

2017-08-25

Finding accurate injection components is the key issue in pan-sharpening methods. In this paper, a low-rank pan-sharpening (LRP) model is developed from a new perspective of offset learning. Two offsets are defined to represent the spatial and spectral differences between low-resolution multispectral and high-resolution multispectral (HRMS) images, respectively. In order to reduce spatial and spectral distortions, spatial equalization and spectral proportion constraints are designed and cast on the offsets, to develop a spatial and spectral constrained stable low-rank decomposition algorithm via augmented Lagrange multiplier. By fine modeling and heuristic learning, our method can simultaneously reduce spatial and spectral distortions in the fused HRMS images. Moreover, our method can efficiently deal with noises and outliers in source images, for exploring low-rank and sparse characteristics of data. Extensive experiments are taken on several image data sets, and the results demonstrate the efficiency of the proposed LRP.

Integrated Low-Rank-Based Discriminative Feature Learning for Recognition.

PubMed

Zhou, Pan; Lin, Zhouchen; Zhang, Chao

2016-05-01

Feature learning plays a central role in pattern recognition. In recent years, many representation-based feature learning methods have been proposed and have achieved great success in many applications. However, these methods perform feature learning and subsequent classification in two separate steps, which may not be optimal for recognition tasks. In this paper, we present a supervised low-rank-based approach for learning discriminative features. By integrating latent low-rank representation (LatLRR) with a ridge regression-based classifier, our approach combines feature learning with classification, so that the regulated classification error is minimized. In this way, the extracted features are more discriminative for the recognition tasks. Our approach benefits from a recent discovery on the closed-form solutions to noiseless LatLRR. When there is noise, a robust Principal Component Analysis (PCA)-based denoising step can be added as preprocessing. When the scale of a problem is large, we utilize a fast randomized algorithm to speed up the computation of robust PCA. Extensive experimental results demonstrate the effectiveness and robustness of our method.

Harassment of adults by immatures in bonobos (Pan paniscus): testing the Exploratory Aggression and Rank Improvement hypotheses.

PubMed

Boose, Klaree; White, Frances

2017-10-01

The immatures of many primate species frequently pester adult group members with aggressive behaviors referred to as a type of harassment. Although these behaviors are characteristic of immatures as they develop from infancy through adolescence, there have been few studies that specifically address the adaptive significance of harassment. Two functional hypotheses have been generated from observations of the behavior in chimpanzees. The Exploratory Aggression hypothesis describes harassment as a mechanism used by immatures to learn about the parameters of aggression and dominance behavior and to acquire information about novel, complex, or unpredictable relationships. The Rank Improvement hypothesis describes harassment as a mechanism of dominance acquisition used by immatures to outrank adults. This study investigated harassment of adults by immatures in a group of bonobos housed at the Columbus Zoo and compared the results to the predictions outlined by the Exploratory Aggression and Rank Improvement hypotheses. Although all immature bonobos in this group harassed adults, adolescents performed the behavior more frequently than did infants or juveniles and low-ranking adults were targeted more frequently than high-ranking. Targets responded more with agonistic behaviors than with neutral behaviors and the amount of harassment an individual received was significantly correlated with the amount of agonistic responses given. Furthermore, bouts of harassment were found to continue significantly more frequently when responses were agonistic than when they were neutral. Adolescents elicited mostly agonistic responses from targets whereas infants and juveniles received mostly neutral responses. These results support predictions from each hypothesis where harassment functions both as a mechanism of social exploration and as a tool to establish dominance rank.

Predicting intensity ranks of peptide fragment ions.

PubMed

Frank, Ari M

2009-05-01

Accurate modeling of peptide fragmentation is necessary for the development of robust scoring functions for peptide-spectrum matches, which are the cornerstone of MS/MS-based identification algorithms. Unfortunately, peptide fragmentation is a complex process that can involve several competing chemical pathways, which makes it difficult to develop generative probabilistic models that describe it accurately. However, the vast amounts of MS/MS data being generated now make it possible to use data-driven machine learning methods to develop discriminative ranking-based models that predict the intensity ranks of a peptide's fragment ions. We use simple sequence-based features that get combined by a boosting algorithm into models that make peak rank predictions with high accuracy. In an accompanying manuscript, we demonstrate how these prediction models are used to significantly improve the performance of peptide identification algorithms. The models can also be useful in the design of optimal multiple reaction monitoring (MRM) transitions, in cases where there is insufficient experimental data to guide the peak selection process. The prediction algorithm can also be run independently through PepNovo+, which is available for download from http://bix.ucsd.edu/Software/PepNovo.html.

Predicting Intensity Ranks of Peptide Fragment Ions

PubMed Central

Frank, Ari M.

2009-01-01

Accurate modeling of peptide fragmentation is necessary for the development of robust scoring functions for peptide-spectrum matches, which are the cornerstone of MS/MS-based identification algorithms. Unfortunately, peptide fragmentation is a complex process that can involve several competing chemical pathways, which makes it difficult to develop generative probabilistic models that describe it accurately. However, the vast amounts of MS/MS data being generated now make it possible to use data-driven machine learning methods to develop discriminative ranking-based models that predict the intensity ranks of a peptide's fragment ions. We use simple sequence-based features that get combined by a boosting algorithm in to models that make peak rank predictions with high accuracy. In an accompanying manuscript, we demonstrate how these prediction models are used to significantly improve the performance of peptide identification algorithms. The models can also be useful in the design of optimal MRM transitions, in cases where there is insufficient experimental data to guide the peak selection process. The prediction algorithm can also be run independently through PepNovo+, which is available for download from http://bix.ucsd.edu/Software/PepNovo.html. PMID:19256476

Learning Short Binary Codes for Large-scale Image Retrieval.

PubMed

Liu, Li; Yu, Mengyang; Shao, Ling

2017-03-01

Large-scale visual information retrieval has become an active research area in this big data era. Recently, hashing/binary coding algorithms prove to be effective for scalable retrieval applications. Most existing hashing methods require relatively long binary codes (i.e., over hundreds of bits, sometimes even thousands of bits) to achieve reasonable retrieval accuracies. However, for some realistic and unique applications, such as on wearable or mobile devices, only short binary codes can be used for efficient image retrieval due to the limitation of computational resources or bandwidth on these devices. In this paper, we propose a novel unsupervised hashing approach called min-cost ranking (MCR) specifically for learning powerful short binary codes (i.e., usually the code length shorter than 100 b) for scalable image retrieval tasks. By exploring the discriminative ability of each dimension of data, MCR can generate one bit binary code for each dimension and simultaneously rank the discriminative separability of each bit according to the proposed cost function. Only top-ranked bits with minimum cost-values are then selected and grouped together to compose the final salient binary codes. Extensive experimental results on large-scale retrieval demonstrate that MCR can achieve comparative performance as the state-of-the-art hashing algorithms but with significantly shorter codes, leading to much faster large-scale retrieval.

SpikeTemp: An Enhanced Rank-Order-Based Learning Approach for Spiking Neural Networks With Adaptive Structure.

PubMed

Wang, Jinling; Belatreche, Ammar; Maguire, Liam P; McGinnity, Thomas Martin

2017-01-01

This paper presents an enhanced rank-order-based learning algorithm, called SpikeTemp, for spiking neural networks (SNNs) with a dynamically adaptive structure. The trained feed-forward SNN consists of two layers of spiking neurons: 1) an encoding layer which temporally encodes real-valued features into spatio-temporal spike patterns and 2) an output layer of dynamically grown neurons which perform spatio-temporal classification. Both Gaussian receptive fields and square cosine population encoding schemes are employed to encode real-valued features into spatio-temporal spike patterns. Unlike the rank-order-based learning approach, SpikeTemp uses the precise times of the incoming spikes for adjusting the synaptic weights such that early spikes result in a large weight change and late spikes lead to a smaller weight change. This removes the need to rank all the incoming spikes and, thus, reduces the computational cost of SpikeTemp. The proposed SpikeTemp algorithm is demonstrated on several benchmark data sets and on an image recognition task. The results show that SpikeTemp can achieve better classification performance and is much faster than the existing rank-order-based learning approach. In addition, the number of output neurons is much smaller when the square cosine encoding scheme is employed. Furthermore, SpikeTemp is benchmarked against a selection of existing machine learning algorithms, and the results demonstrate the ability of SpikeTemp to classify different data sets after just one presentation of the training samples with comparable classification performance.

Ranking the Difficulty Level of the Knowledge Units Based on Learning Dependency

ERIC Educational Resources Information Center

Liu, Jun; Sha, Sha; Zheng, Qinghua; Zhang, Wei

2012-01-01

Assigning difficulty level indicators to the knowledge units helps the learners plan their learning activities more efficiently. This paper focuses on how to use the topology of a knowledge map to compute and rank the difficulty levels of knowledge units. Firstly, the authors present the hierarchical structure and properties of the knowledge map.…

Application of learning to rank to protein remote homology detection.

PubMed

Liu, Bin; Chen, Junjie; Wang, Xiaolong

2015-11-01

Protein remote homology detection is one of the fundamental problems in computational biology, aiming to find protein sequences in a database of known structures that are evolutionarily related to a given query protein. Some computational methods treat this problem as a ranking problem and achieve the state-of-the-art performance, such as PSI-BLAST, HHblits and ProtEmbed. This raises the possibility to combine these methods to improve the predictive performance. In this regard, we are to propose a new computational method called ProtDec-LTR for protein remote homology detection, which is able to combine various ranking methods in a supervised manner via using the Learning to Rank (LTR) algorithm derived from natural language processing. Experimental results on a widely used benchmark dataset showed that ProtDec-LTR can achieve an ROC1 score of 0.8442 and an ROC50 score of 0.9023 outperforming all the individual predictors and some state-of-the-art methods. These results indicate that it is correct to treat protein remote homology detection as a ranking problem, and predictive performance improvement can be achieved by combining different ranking approaches in a supervised manner via using LTR. For users' convenience, the software tools of three basic ranking predictors and Learning to Rank algorithm were provided at http://bioinformatics.hitsz.edu.cn/ProtDec-LTR/home/ bliu@insun.hit.edu.cn Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Higher Education Ranking and Leagues Tables: Lessons Learned from Benchmarking

ERIC Educational Resources Information Center

Proulx, Roland

2007-01-01

The paper intends to contribute to the debate on ranking and league tables by adopting a critical approach to ranking methodologies from the point of view of a university benchmarking exercise. The absence of a strict benchmarking exercise in the ranking process has been, in the opinion of the author, one of the major problems encountered in the…

Computational assessment of organic photovoltaic candidate compounds

NASA Astrophysics Data System (ADS)

Borunda, Mario; Dai, Shuo; Olivares-Amaya, Roberto; Amador-Bedolla, Carlos; Aspuru-Guzik, Alan

2015-03-01

Organic photovoltaic (OPV) cells are emerging as a possible renewable alternative to petroleum based resources and are needed to meet our growing demand for energy. Although not as efficient as silicon based cells, OPV cells have as an advantage that their manufacturing cost is potentially lower. The Harvard Clean Energy Project, using a cheminformatic approach of pattern recognition and machine learning strategies, has ranked a molecular library of more than 2.6 million candidate compounds based on their performance as possible OPV materials. Here, we present a ranking of the top 1000 molecules for use as photovoltaic materials based on their optical absorption properties obtained via time-dependent density functional theory. This computational search has revealed the molecular motifs shared by the set of most promising molecules.

GOLabeler: Improving Sequence-based Large-scale Protein Function Prediction by Learning to Rank.

PubMed

You, Ronghui; Zhang, Zihan; Xiong, Yi; Sun, Fengzhu; Mamitsuka, Hiroshi; Zhu, Shanfeng

2018-03-07

Gene Ontology (GO) has been widely used to annotate functions of proteins and understand their biological roles. Currently only <1% of more than 70 million proteins in UniProtKB have experimental GO annotations, implying the strong necessity of automated function prediction (AFP) of proteins, where AFP is a hard multilabel classification problem due to one protein with a diverse number of GO terms. Most of these proteins have only sequences as input information, indicating the importance of sequence-based AFP (SAFP: sequences are the only input). Furthermore homology-based SAFP tools are competitive in AFP competitions, while they do not necessarily work well for so-called difficult proteins, which have <60% sequence identity to proteins with annotations already. Thus the vital and challenging problem now is how to develop a method for SAFP, particularly for difficult proteins. The key of this method is to extract not only homology information but also diverse, deep- rooted information/evidence from sequence inputs and integrate them into a predictor in a both effective and efficient manner. We propose GOLabeler, which integrates five component classifiers, trained from different features, including GO term frequency, sequence alignment, amino acid trigram, domains and motifs, and biophysical properties, etc., in the framework of learning to rank (LTR), a paradigm of machine learning, especially powerful for multilabel classification. The empirical results obtained by examining GOLabeler extensively and thoroughly by using large-scale datasets revealed numerous favorable aspects of GOLabeler, including significant performance advantage over state-of-the-art AFP methods. http://datamining-iip.fudan.edu.cn/golabeler. zhusf@fudan.edu.cn. Supplementary data are available at Bioinformatics online.

A rank-based Prediction Algorithm of Learning User's Intention

NASA Astrophysics Data System (ADS)

Shen, Jie; Gao, Ying; Chen, Cang; Gong, HaiPing

Internet search has become an important part in people's daily life. People can find many types of information to meet different needs through search engines on the Internet. There are two issues for the current search engines: first, the users should predetermine the types of information they want and then change to the appropriate types of search engine interfaces. Second, most search engines can support multiple kinds of search functions, each function has its own separate search interface. While users need different types of information, they must switch between different interfaces. In practice, most queries are corresponding to various types of information results. These queries can search the relevant results in various search engines, such as query "Palace" contains the websites about the introduction of the National Palace Museum, blog, Wikipedia, some pictures and video information. This paper presents a new aggregative algorithm for all kinds of search results. It can filter and sort the search results by learning three aspects about the query words, search results and search history logs to achieve the purpose of detecting user's intention. Experiments demonstrate that this rank-based method for multi-types of search results is effective. It can meet the user's search needs well, enhance user's satisfaction, provide an effective and rational model for optimizing search engines and improve user's search experience.

Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning.

PubMed

Peng, Yong; Lu, Bao-Liang; Wang, Suhang

2015-05-01

Constructing an informative and discriminative graph plays an important role in various pattern recognition tasks such as clustering and classification. Among the existing graph-based learning models, low-rank representation (LRR) is a very competitive one, which has been extensively employed in spectral clustering and semi-supervised learning (SSL). In SSL, the graph is composed of both labeled and unlabeled samples, where the edge weights are calculated based on the LRR coefficients. However, most of existing LRR related approaches fail to consider the geometrical structure of data, which has been shown beneficial for discriminative tasks. In this paper, we propose an enhanced LRR via sparse manifold adaption, termed manifold low-rank representation (MLRR), to learn low-rank data representation. MLRR can explicitly take the data local manifold structure into consideration, which can be identified by the geometric sparsity idea; specifically, the local tangent space of each data point was sought by solving a sparse representation objective. Therefore, the graph to depict the relationship of data points can be built once the manifold information is obtained. We incorporate a regularizer into LRR to make the learned coefficients preserve the geometric constraints revealed in the data space. As a result, MLRR combines both the global information emphasized by low-rank property and the local information emphasized by the identified manifold structure. Extensive experimental results on semi-supervised classification tasks demonstrate that MLRR is an excellent method in comparison with several state-of-the-art graph construction approaches. Copyright © 2015 Elsevier Ltd. All rights reserved.

Learning to rank figures within a biomedical article.

PubMed

Liu, Feifan; Yu, Hong

2014-01-01

Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the "bag of figures" assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as "figure ranking". Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1) First Author, (2) Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3) Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or out-domain-experts for an article, we conclude that BioFigRank represents an artificial intelligence system that offers expert-level intelligence to help biomedical researchers to navigate increasingly proliferated big data efficiently.

AptRank: an adaptive PageRank model for protein function prediction on   bi-relational graphs.

PubMed

Jiang, Biaobin; Kloster, Kyle; Gleich, David F; Gribskov, Michael

2017-06-15

Diffusion-based network models are widely used for protein function prediction using protein network data and have been shown to outperform neighborhood-based and module-based methods. Recent studies have shown that integrating the hierarchical structure of the Gene Ontology (GO) data dramatically improves prediction accuracy. However, previous methods usually either used the GO hierarchy to refine the prediction results of multiple classifiers, or flattened the hierarchy into a function-function similarity kernel. No study has taken the GO hierarchy into account together with the protein network as a two-layer network model. We first construct a Bi-relational graph (Birg) model comprised of both protein-protein association and function-function hierarchical networks. We then propose two diffusion-based methods, BirgRank and AptRank, both of which use PageRank to diffuse information on this two-layer graph model. BirgRank is a direct application of traditional PageRank with fixed decay parameters. In contrast, AptRank utilizes an adaptive diffusion mechanism to improve the performance of BirgRank. We evaluate the ability of both methods to predict protein function on yeast, fly and human protein datasets, and compare with four previous methods: GeneMANIA, TMC, ProteinRank and clusDCA. We design four different validation strategies: missing function prediction, de novo function prediction, guided function prediction and newly discovered function prediction to comprehensively evaluate predictability of all six methods. We find that both BirgRank and AptRank outperform the previous methods, especially in missing function prediction when using only 10% of the data for training. The MATLAB code is available at https://github.rcac.purdue.edu/mgribsko/aptrank . gribskov@purdue.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

MRM-Lasso: A Sparse Multiview Feature Selection Method via Low-Rank Analysis.

PubMed

Yang, Wanqi; Gao, Yang; Shi, Yinghuan; Cao, Longbing

2015-11-01

Learning about multiview data involves many applications, such as video understanding, image classification, and social media. However, when the data dimension increases dramatically, it is important but very challenging to remove redundant features in multiview feature selection. In this paper, we propose a novel feature selection algorithm, multiview rank minimization-based Lasso (MRM-Lasso), which jointly utilizes Lasso for sparse feature selection and rank minimization for learning relevant patterns across views. Instead of simply integrating multiple Lasso from view level, we focus on the performance of sample-level (sample significance) and introduce pattern-specific weights into MRM-Lasso. The weights are utilized to measure the contribution of each sample to the labels in the current view. In addition, the latent correlation across different views is successfully captured by learning a low-rank matrix consisting of pattern-specific weights. The alternating direction method of multipliers is applied to optimize the proposed MRM-Lasso. Experiments on four real-life data sets show that features selected by MRM-Lasso have better multiview classification performance than the baselines. Moreover, pattern-specific weights are demonstrated to be significant for learning about multiview data, compared with view-specific weights.

Beyond Zipf's Law: The Lavalette Rank Function and Its Properties.

PubMed

Fontanelli, Oscar; Miramontes, Pedro; Yang, Yaning; Cocho, Germinal; Li, Wentian

Although Zipf's law is widespread in natural and social data, one often encounters situations where one or both ends of the ranked data deviate from the power-law function. Previously we proposed the Beta rank function to improve the fitting of data which does not follow a perfect Zipf's law. Here we show that when the two parameters in the Beta rank function have the same value, the Lavalette rank function, the probability density function can be derived analytically. We also show both computationally and analytically that Lavalette distribution is approximately equal, though not identical, to the lognormal distribution. We illustrate the utility of Lavalette rank function in several datasets. We also address three analysis issues on the statistical testing of Lavalette fitting function, comparison between Zipf's law and lognormal distribution through Lavalette function, and comparison between lognormal distribution and Lavalette distribution.

Learning multiple relative attributes with humans in the loop.

PubMed

Qian, Buyue; Wang, Xiang; Cao, Nan; Jiang, Yu-Gang; Davidson, Ian

2014-12-01

Semantic attributes have been recognized as a more spontaneous manner to describe and annotate image content. It is widely accepted that image annotation using semantic attributes is a significant improvement to the traditional binary or multiclass annotation due to its naturally continuous and relative properties. Though useful, existing approaches rely on an abundant supervision and high-quality training data, which limit their applicability. Two standard methods to overcome small amounts of guidance and low-quality training data are transfer and active learning. In the context of relative attributes, this would entail learning multiple relative attributes simultaneously and actively querying a human for additional information. This paper addresses the two main limitations in existing work: 1) it actively adds humans to the learning loop so that minimal additional guidance can be given and 2) it learns multiple relative attributes simultaneously and thereby leverages dependence amongst them. In this paper, we formulate a joint active learning to rank framework with pairwise supervision to achieve these two aims, which also has other benefits such as the ability to be kernelized. The proposed framework optimizes over a set of ranking functions (measuring the strength of the presence of attributes) simultaneously and dependently on each other. The proposed pairwise queries take the form of which one of these two pictures is more natural? These queries can be easily answered by humans. Extensive empirical study on real image data sets shows that our proposed method, compared with several state-of-the-art methods, achieves superior retrieval performance while requires significantly less human inputs.

Learning style preferences of surgical residency applicants.

PubMed

Kim, Roger H; Gilbert, Timothy

2015-09-01

The learning style preferences of general surgery residents have been previously reported; there is evidence that residents who prefer read/write learning styles perform better on the American Board of Surgery In-Training Examination (ABSITE). However, little is known regarding the learning style preferences of applicants to general surgery residency and their impact on educational outcomes. In this study, the preferred learning styles of surgical residency applicants were determined. We hypothesized that applicant rank data are associated with specific learning style preferences. The Fleming VARK learning styles inventory was offered to all general surgery residency applicants that were interviewed at a university hospital-based program. The VARK model categorizes learners as visual (V), aural (A), read/write (R), kinesthetic (K), or multimodal (MM). Responses on the inventory were scored to determine the preferred learning style for each applicant. Applicant data, including United States Medical Licensing Examination (USMLE) scores, class rank, interview score, and overall final applicant ranking, were examined for association with preferred learning styles. Sixty-seven applicants were interviewed. Five applicants were excluded due to not completing the VARK inventory or having incomplete applicant data. The remaining 62 applicants (92%) were included for analysis. Most applicants (57%) had a multimodal preference. Sixty-nine percent of all applicants had some degree of preference for kinesthetic learning. There were statistically significant differences between applicants of different learning styles in terms of USMLE step 1 scores (P = 0.001) and USMLE step 2 clinical knowledge scores (P = 0.01), but not for class ranks (P = 0.27), interview scores (P = 0.20), or final ranks (P = 0.14). Multiple comparison analysis demonstrated that applicants with aural preferences had higher USMLE 1 scores (233.2) than those with kinesthetic (211.8, P = 0.005) or multimodal (214.5, P = 0.008) preferences, whereas applicants with visual preferences had higher USMLE 1 scores (230.0) than those with kinesthetic preferences (P = 0.047). Applicants with aural preferences also had higher USMLE 2 scores (249.6) than those with kinesthetic (227.6, P = 0.006) or multimodal (230.1, P = 0.008) preferences. Most applicants to general surgery residency have a multimodal learning style preference. Learning style preferences are associated with higher USMLE step 1 and step 2 scores, in particular for applicants with aural preferences. Students who performed well in lecture-dominated medical school environments because of their aural preferences could be at a disadvantage in the more independent, reading-focused learning environments of surgical residency. Copyright © 2015 Elsevier Inc. All rights reserved.

The Use and Ranking of Different English Language Learning Strategies by English Major Iranian Female University Level Learners

ERIC Educational Resources Information Center

Fazeli, Seyed Hossein

2012-01-01

This study aims to rank types of English language learning strategies that are used by Iranian female university level learners of English language as a university major. The results show that except for the Metacognitive Strategies category, the mean score for each of the five categories fell in the range of medium strategy use.

Kernelized rank learning for personalized drug recommendation.

PubMed

He, Xiao; Folkman, Lukas; Borgwardt, Karsten

2018-03-08

Large-scale screenings of cancer cell lines with detailed molecular profiles against libraries of pharmacological compounds are currently being performed in order to gain a better understanding of the genetic component of drug response and to enhance our ability to recommend therapies given a patient's molecular profile. These comprehensive screens differ from the clinical setting in which (1) medical records only contain the response of a patient to very few drugs, (2) drugs are recommended by doctors based on their expert judgment, and (3) selecting the most promising therapy is often more important than accurately predicting the sensitivity to all potential drugs. Current regression models for drug sensitivity prediction fail to account for these three properties. We present a machine learning approach, named Kernelized Rank Learning (KRL), that ranks drugs based on their predicted effect per cell line (patient), circumventing the difficult problem of precisely predicting the sensitivity to the given drug. Our approach outperforms several state-of-the-art predictors in drug recommendation, particularly if the training dataset is sparse, and generalizes to patient data. Our work phrases personalized drug recommendation as a new type of machine learning problem with translational potential to the clinic. The Python implementation of KRL and scripts for running our experiments are available at https://github.com/BorgwardtLab/Kernelized-Rank-Learning. xiao.he@bsse.ethz.ch, lukas.folkman@bsse.ethz.ch. Supplementary data are available at Bioinformatics online.

Low-Rank Discriminant Embedding for Multiview Learning.

PubMed

Li, Jingjing; Wu, Yue; Zhao, Jidong; Lu, Ke

2017-11-01

This paper focuses on the specific problem of multiview learning where samples have the same feature set but different probability distributions, e.g., different viewpoints or different modalities. Since samples lying in different distributions cannot be compared directly, this paper aims to learn a latent subspace shared by multiple views assuming that the input views are generated from this latent subspace. Previous approaches usually learn the common subspace by either maximizing the empirical likelihood, or preserving the geometric structure. However, considering the complementarity between the two objectives, this paper proposes a novel approach, named low-rank discriminant embedding (LRDE), for multiview learning by taking full advantage of both sides. By further considering the duality between data points and features of multiview scene, i.e., data points can be grouped based on their distribution on features, while features can be grouped based on their distribution on the data points, LRDE not only deploys low-rank constraints on both sample level and feature level to dig out the shared factors across different views, but also preserves geometric information in both the ambient sample space and the embedding feature space by designing a novel graph structure under the framework of graph embedding. Finally, LRDE jointly optimizes low-rank representation and graph embedding in a unified framework. Comprehensive experiments in both multiview manner and pairwise manner demonstrate that LRDE performs much better than previous approaches proposed in recent literatures.

Learning to Rank Figures within a Biomedical Article

PubMed Central

Liu, Feifan; Yu, Hong

2014-01-01

Hundreds of millions of figures are available in biomedical literature, representing important biomedical experimental evidence. This ever-increasing sheer volume has made it difficult for scientists to effectively and accurately access figures of their interest, the process of which is crucial for validating research facts and for formulating or testing novel research hypotheses. Current figure search applications can't fully meet this challenge as the “bag of figures” assumption doesn't take into account the relationship among figures. In our previous study, hundreds of biomedical researchers have annotated articles in which they serve as corresponding authors. They ranked each figure in their paper based on a figure's importance at their discretion, referred to as “figure ranking”. Using this collection of annotated data, we investigated computational approaches to automatically rank figures. We exploited and extended the state-of-the-art listwise learning-to-rank algorithms and developed a new supervised-learning model BioFigRank. The cross-validation results show that BioFigRank yielded the best performance compared with other state-of-the-art computational models, and the greedy feature selection can further boost the ranking performance significantly. Furthermore, we carry out the evaluation by comparing BioFigRank with three-level competitive domain-specific human experts: (1) First Author, (2) Non-Author-In-Domain-Expert who is not the author nor co-author of an article but who works in the same field of the corresponding author of the article, and (3) Non-Author-Out-Domain-Expert who is not the author nor co-author of an article and who may or may not work in the same field of the corresponding author of an article. Our results show that BioFigRank outperforms Non-Author-Out-Domain-Expert and performs as well as Non-Author-In-Domain-Expert. Although BioFigRank underperforms First Author, since most biomedical researchers are either in- or out-domain-experts for an article, we conclude that BioFigRank represents an artificial intelligence system that offers expert-level intelligence to help biomedical researchers to navigate increasingly proliferated big data efficiently. PMID:24625719

5 CFR 2635.808 - Fundraising activities.

Code of Federal Regulations, 2011 CFR

2011-01-01

... Washington, DC area to raise funds for recreational programs for learning disabled children. The organization... address, such “The Honorable,” or a rank, such as a military or ambassadorial rank, may use or permit the use of that term of address or rank for such purposes; or (3) Engage in any action that would...

5 CFR 2635.808 - Fundraising activities.

Code of Federal Regulations, 2012 CFR

2012-01-01

... Washington, DC area to raise funds for recreational programs for learning disabled children. The organization... address, such “The Honorable,” or a rank, such as a military or ambassadorial rank, may use or permit the use of that term of address or rank for such purposes; or (3) Engage in any action that would...

5 CFR 2635.808 - Fundraising activities.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Washington, DC area to raise funds for recreational programs for learning disabled children. The organization... address, such “The Honorable,” or a rank, such as a military or ambassadorial rank, may use or permit the use of that term of address or rank for such purposes; or (3) Engage in any action that would...

Network-based ranking methods for prediction of novel disease associated microRNAs.

PubMed

Le, Duc-Hau

2015-10-01

Many studies have shown roles of microRNAs on human disease and a number of computational methods have been proposed to predict such associations by ranking candidate microRNAs according to their relevance to a disease. Among them, machine learning-based methods usually have a limitation in specifying non-disease microRNAs as negative training samples. Meanwhile, network-based methods are becoming dominant since they well exploit a "disease module" principle in microRNA functional similarity networks. Of which, random walk with restart (RWR) algorithm-based method is currently state-of-the-art. The use of this algorithm was inspired from its success in predicting disease gene because the "disease module" principle also exists in protein interaction networks. Besides, many algorithms designed for webpage ranking have been successfully applied in ranking disease candidate genes because web networks share topological properties with protein interaction networks. However, these algorithms have not yet been utilized for disease microRNA prediction. We constructed microRNA functional similarity networks based on shared targets of microRNAs, and then we integrated them with a microRNA functional synergistic network, which was recently identified. After analyzing topological properties of these networks, in addition to RWR, we assessed the performance of (i) PRINCE (PRIoritizatioN and Complex Elucidation), which was proposed for disease gene prediction; (ii) PageRank with Priors (PRP) and K-Step Markov (KSM), which were used for studying web networks; and (iii) a neighborhood-based algorithm. Analyses on topological properties showed that all microRNA functional similarity networks are small-worldness and scale-free. The performance of each algorithm was assessed based on average AUC values on 35 disease phenotypes and average rankings of newly discovered disease microRNAs. As a result, the performance on the integrated network was better than that on individual ones. In addition, the performance of PRINCE, PRP and KSM was comparable with that of RWR, whereas it was worst for the neighborhood-based algorithm. Moreover, all the algorithms were stable with the change of parameters. Final, using the integrated network, we predicted six novel miRNAs (i.e., hsa-miR-101, hsa-miR-181d, hsa-miR-192, hsa-miR-423-3p, hsa-miR-484 and hsa-miR-98) associated with breast cancer. Network-based ranking algorithms, which were successfully applied for either disease gene prediction or for studying social/web networks, can be also used effectively for disease microRNA prediction. Copyright © 2015 Elsevier Ltd. All rights reserved.

Interval-Valued Rank in Finite Ordered Sets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff; Pogel, Alex; Purvine, Emilie

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data objects like the semantic hierarchies of ontolog- ical databases. These rarely satisfy the strong property of gradedness, which is required for traditional rank functions to exist. Representing such semantic hierarchies as finite, bounded posets, we recognize the duality of ordered structures to motivate rank functions which respect verticality both from the bottom and from the top. Our rank functions are thus interval-valued, and alwaysmore » exist, even for non-graded posets, providing order homomorphisms to an interval order on the interval-valued ranks. The concept of rank width arises naturally, allowing us to identify the poset region with point-valued width as its longest graded portion (which we call the “spindle”). A standard interval rank function is naturally motivated both in terms of its extremality and on pragmatic grounds. Its properties are examined, including the relation- ship to traditional grading and rank functions, and methods to assess comparisons of standard interval-valued ranks.« less

RRCRank: a fusion method using rank strategy for residue-residue contact prediction.

PubMed

Jing, Xiaoyang; Dong, Qiwen; Lu, Ruqian

2017-09-02

In structural biology area, protein residue-residue contacts play a crucial role in protein structure prediction. Some researchers have found that the predicted residue-residue contacts could effectively constrain the conformational search space, which is significant for de novo protein structure prediction. In the last few decades, related researchers have developed various methods to predict residue-residue contacts, especially, significant performance has been achieved by using fusion methods in recent years. In this work, a novel fusion method based on rank strategy has been proposed to predict contacts. Unlike the traditional regression or classification strategies, the contact prediction task is regarded as a ranking task. First, two kinds of features are extracted from correlated mutations methods and ensemble machine-learning classifiers, and then the proposed method uses the learning-to-rank algorithm to predict contact probability of each residue pair. First, we perform two benchmark tests for the proposed fusion method (RRCRank) on CASP11 dataset and CASP12 dataset respectively. The test results show that the RRCRank method outperforms other well-developed methods, especially for medium and short range contacts. Second, in order to verify the superiority of ranking strategy, we predict contacts by using the traditional regression and classification strategies based on the same features as ranking strategy. Compared with these two traditional strategies, the proposed ranking strategy shows better performance for three contact types, in particular for long range contacts. Third, the proposed RRCRank has been compared with several state-of-the-art methods in CASP11 and CASP12. The results show that the RRCRank could achieve comparable prediction precisions and is better than three methods in most assessment metrics. The learning-to-rank algorithm is introduced to develop a novel rank-based method for the residue-residue contact prediction of proteins, which achieves state-of-the-art performance based on the extensive assessment.

Quantum annealing versus classical machine learning applied to a simplified computational biology problem

NASA Astrophysics Data System (ADS)

Li, Richard Y.; Di Felice, Rosa; Rohs, Remo; Lidar, Daniel A.

2018-03-01

Transcription factors regulate gene expression, but how these proteins recognize and specifically bind to their DNA targets is still debated. Machine learning models are effective means to reveal interaction mechanisms. Here we studied the ability of a quantum machine learning approach to classify and rank binding affinities. Using simplified data sets of a small number of DNA sequences derived from actual binding affinity experiments, we trained a commercially available quantum annealer to classify and rank transcription factor binding. The results were compared to state-of-the-art classical approaches for the same simplified data sets, including simulated annealing, simulated quantum annealing, multiple linear regression, LASSO, and extreme gradient boosting. Despite technological limitations, we find a slight advantage in classification performance and nearly equal ranking performance using the quantum annealer for these fairly small training data sets. Thus, we propose that quantum annealing might be an effective method to implement machine learning for certain computational biology problems.

Parts and 'holes': gaps in rational number sense among children with vs. without mathematical learning disabilities.

PubMed

Mazzocco, Michèle M M; Devlin, Kathleen T

2008-09-01

Many middle-school students struggle with decimals and fractions, even if they do not have a mathematical learning disability (MLD). In the present longitudinal study, we examined whether children with MLD have weaker rational number knowledge than children whose difficulty with rational numbers occurs in the absence of MLD. We found that children with MLD failed to accurately name decimals, to correctly rank order decimals and/or fractions, and to identify equivalent ratios (e.g. 0.5 = 1/2); they also 'identified' incorrect equivalents (e.g. 0.05 = 0.50). Children with low math achievement but no MLD accurately named decimals and identified equivalent pairs, but failed to correctly rank order decimals and fractions. Thus failure to accurately name decimals was an indicator of MLD; but accurate naming was no guarantee of rational number knowledge - most children who failed to correctly rank order fractions and decimals tests passed the naming task. Most children who failed the ranking tests at 6th grade also failed at 8th grade. Our findings suggest that a simple task involving naming and rank ordering fractions and decimals may be a useful addition to in-class assessments used to determine children's learning of rational numbers.

Online probabilistic learning with an ensemble of forecasts

NASA Astrophysics Data System (ADS)

Thorey, Jean; Mallet, Vivien; Chaussin, Christophe

2016-04-01

Our objective is to produce a calibrated weighted ensemble to forecast a univariate time series. In addition to a meteorological ensemble of forecasts, we rely on observations or analyses of the target variable. The celebrated Continuous Ranked Probability Score (CRPS) is used to evaluate the probabilistic forecasts. However applying the CRPS on weighted empirical distribution functions (deriving from the weighted ensemble) may introduce a bias because of which minimizing the CRPS does not produce the optimal weights. Thus we propose an unbiased version of the CRPS which relies on clusters of members and is strictly proper. We adapt online learning methods for the minimization of the CRPS. These methods generate the weights associated to the members in the forecasted empirical distribution function. The weights are updated before each forecast step using only past observations and forecasts. Our learning algorithms provide the theoretical guarantee that, in the long run, the CRPS of the weighted forecasts is at least as good as the CRPS of any weighted ensemble with weights constant in time. In particular, the performance of our forecast is better than that of any subset ensemble with uniform weights. A noteworthy advantage of our algorithm is that it does not require any assumption on the distributions of the observations and forecasts, both for the application and for the theoretical guarantee to hold. As application example on meteorological forecasts for photovoltaic production integration, we show that our algorithm generates a calibrated probabilistic forecast, with significant performance improvements on probabilistic diagnostic tools (the CRPS, the reliability diagram and the rank histogram).

Large-scale linear rankSVM.

PubMed

Lee, Ching-Pei; Lin, Chih-Jen

2014-04-01

Linear rankSVM is one of the widely used methods for learning to rank. Although its performance may be inferior to nonlinear methods such as kernel rankSVM and gradient boosting decision trees, linear rankSVM is useful to quickly produce a baseline model. Furthermore, following its recent development for classification, linear rankSVM may give competitive performance for large and sparse data. A great deal of works have studied linear rankSVM. The focus is on the computational efficiency when the number of preference pairs is large. In this letter, we systematically study existing works, discuss their advantages and disadvantages, and propose an efficient algorithm. We discuss different implementation issues and extensions with detailed experiments. Finally, we develop a robust linear rankSVM tool for public use.

Society for College Science Teachers: Revisiting the Cone of Learning--Is it a Reliable Way to Link Instruction Method with Knowledge Recall?

ERIC Educational Resources Information Center

Lord, Thomas

2007-01-01

In his article, Dale had constructed a tiered triangle to rank students' ability to recall information that had been taught six weeks earlier (Dale 1969). Dale had found that only 5% of the knowledge gained through lecture was remembered by students several weeks after it was heard. Dale's original tool for ranking student learning has evolved…

Learning to Select Supplier Portfolios for Service Supply Chain

PubMed Central

Zhang, Rui; Li, Jingfei; Wu, Shaoyu; Meng, Dabin

2016-01-01

The research on service supply chain has attracted more and more focus from both academia and industrial community. In a service supply chain, the selection of supplier portfolio is an important and difficult problem due to the fact that a supplier portfolio may include multiple suppliers from a variety of fields. To address this problem, we propose a novel supplier portfolio selection method based on a well known machine learning approach, i.e., Ranking Neural Network (RankNet). In the proposed method, we regard the problem of supplier portfolio selection as a ranking problem, which integrates a large scale of decision making features into a ranking neural network. Extensive simulation experiments are conducted, which demonstrate the feasibility and effectiveness of the proposed method. The proposed supplier portfolio selection model can be applied in a real corporation easily in the future. PMID:27195756

Online Low-Rank Representation Learning for Joint Multi-subspace Recovery and Clustering.

PubMed

Li, Bo; Liu, Risheng; Cao, Junjie; Zhang, Jie; Lai, Yu-Kun; Liua, Xiuping

2017-10-06

Benefiting from global rank constraints, the lowrank representation (LRR) method has been shown to be an effective solution to subspace learning. However, the global mechanism also means that the LRR model is not suitable for handling large-scale data or dynamic data. For large-scale data, the LRR method suffers from high time complexity, and for dynamic data, it has to recompute a complex rank minimization for the entire data set whenever new samples are dynamically added, making it prohibitively expensive. Existing attempts to online LRR either take a stochastic approach or build the representation purely based on a small sample set and treat new input as out-of-sample data. The former often requires multiple runs for good performance and thus takes longer time to run, and the latter formulates online LRR as an out-ofsample classification problem and is less robust to noise. In this paper, a novel online low-rank representation subspace learning method is proposed for both large-scale and dynamic data. The proposed algorithm is composed of two stages: static learning and dynamic updating. In the first stage, the subspace structure is learned from a small number of data samples. In the second stage, the intrinsic principal components of the entire data set are computed incrementally by utilizing the learned subspace structure, and the low-rank representation matrix can also be incrementally solved by an efficient online singular value decomposition (SVD) algorithm. The time complexity is reduced dramatically for large-scale data, and repeated computation is avoided for dynamic problems. We further perform theoretical analysis comparing the proposed online algorithm with the batch LRR method. Finally, experimental results on typical tasks of subspace recovery and subspace clustering show that the proposed algorithm performs comparably or better than batch methods including the batch LRR, and significantly outperforms state-of-the-art online methods.

Reflections on a Decade of Global Rankings: What We've Learned and Outstanding Issues

ERIC Educational Resources Information Center

Hazelkorn, Ellen

2014-01-01

Ten years after the first global rankings appeared, it is clear that they have had an extraordinary impact on higher education. While there are fundamental questions about whether rankings measure either quality or what's meaningful, they have succeeded in exposing higher education to international comparison. More so, because of the…

A scalable kernel-based semisupervised metric learning algorithm with out-of-sample generalization ability.

PubMed

Yeung, Dit-Yan; Chang, Hong; Dai, Guang

2008-11-01

In recent years, metric learning in the semisupervised setting has aroused a lot of research interest. One type of semisupervised metric learning utilizes supervisory information in the form of pairwise similarity or dissimilarity constraints. However, most methods proposed so far are either limited to linear metric learning or unable to scale well with the data set size. In this letter, we propose a nonlinear metric learning method based on the kernel approach. By applying low-rank approximation to the kernel matrix, our method can handle significantly larger data sets. Moreover, our low-rank approximation scheme can naturally lead to out-of-sample generalization. Experiments performed on both artificial and real-world data show very promising results.

The influence of teachers' conceptions on their students' learning: children's understanding of sheet music.

PubMed

López-Íñiguez, Guadalupe; Pozo, Juan Ignacio

2014-06-01

Despite increasing interest in teachers' and students' conceptions of learning and teaching, and how they influence their practice, there are few studies testing the influence of teachers' conceptions on their students' learning. This study tests how teaching conception (TC; with a distinction between direct and constructive) influences students' representations regarding sheet music. Sixty students (8-12 years old) from music conservatories: 30 of them took lessons with teachers with a constructive TC and another 30 with teachers shown to have a direct TC. Children were given a musical comprehension task in which they were asked to select and rank the contents they needed to learn. These contents had different levels of processing and complexity: symbolic, analytical, and referential. Three factorial ANOVAs, two-one-way ANOVAs, and four 2 × 3 repeated-measures ANOVAs were used to analyse the effects of and the interaction between the independent variables TC and class, both for/on total cards selected, their ranking, and each sub-category (the three processing levels). ANOVAs on the selection and ranking of these contents showed that teachers' conceptions seem to mediate significantly in the way the students understand the music. Students from constructive teachers have more complex and deep understanding of music. They select more elements for learning scores than those from traditional teachers. Teaching conception also influences the way in which children rank those elements. No difference exists between the way 8- and 12-year-olds learn scores. Children's understanding of the scores is more complex than assumed in other studies. © 2013 The British Psychological Society.

Persistent homology of time-dependent functional networks constructed from coupled time series

NASA Astrophysics Data System (ADS)

Stolz, Bernadette J.; Harrington, Heather A.; Porter, Mason A.

2017-04-01

We use topological data analysis to study "functional networks" that we construct from time-series data from both experimental and synthetic sources. We use persistent homology with a weight rank clique filtration to gain insights into these functional networks, and we use persistence landscapes to interpret our results. Our first example uses time-series output from networks of coupled Kuramoto oscillators. Our second example consists of biological data in the form of functional magnetic resonance imaging data that were acquired from human subjects during a simple motor-learning task in which subjects were monitored for three days during a five-day period. With these examples, we demonstrate that (1) using persistent homology to study functional networks provides fascinating insights into their properties and (2) the position of the features in a filtration can sometimes play a more vital role than persistence in the interpretation of topological features, even though conventionally the latter is used to distinguish between signal and noise. We find that persistent homology can detect differences in synchronization patterns in our data sets over time, giving insight both on changes in community structure in the networks and on increased synchronization between brain regions that form loops in a functional network during motor learning. For the motor-learning data, persistence landscapes also reveal that on average the majority of changes in the network loops take place on the second of the three days of the learning process.

Machine learning for the New York City power grid.

PubMed

Rudin, Cynthia; Waltz, David; Anderson, Roger N; Boulanger, Albert; Salleb-Aouissi, Ansaf; Chow, Maggie; Dutta, Haimonti; Gross, Philip N; Huang, Bert; Ierome, Steve; Isaac, Delfina F; Kressner, Arthur; Passonneau, Rebecca J; Radeva, Axinia; Wu, Leon

2012-02-01

Power companies can benefit from the use of knowledge discovery methods and statistical machine learning for preventive maintenance. We introduce a general process for transforming historical electrical grid data into models that aim to predict the risk of failures for components and systems. These models can be used directly by power companies to assist with prioritization of maintenance and repair work. Specialized versions of this process are used to produce 1) feeder failure rankings, 2) cable, joint, terminator, and transformer rankings, 3) feeder Mean Time Between Failure (MTBF) estimates, and 4) manhole events vulnerability rankings. The process in its most general form can handle diverse, noisy, sources that are historical (static), semi-real-time, or realtime, incorporates state-of-the-art machine learning algorithms for prioritization (supervised ranking or MTBF), and includes an evaluation of results via cross-validation and blind test. Above and beyond the ranked lists and MTBF estimates are business management interfaces that allow the prediction capability to be integrated directly into corporate planning and decision support; such interfaces rely on several important properties of our general modeling approach: that machine learning features are meaningful to domain experts, that the processing of data is transparent, and that prediction results are accurate enough to support sound decision making. We discuss the challenges in working with historical electrical grid data that were not designed for predictive purposes. The “rawness” of these data contrasts with the accuracy of the statistical models that can be obtained from the process; these models are sufficiently accurate to assist in maintaining New York City’s electrical grid.

Increasing resident recruitment into family medicine: effect of a unique curriculum in integrative medicine.

PubMed

Lebensohn, Patricia; Dodds, Sally; Brooks, Audrey J; Cook, Paula; Guerrera, Mary; Sierpina, Victor; Teets, Raymond; Woytowicz, John; Maizes, Victoria

2014-01-01

Healthcare reform is highlighting the need for more family practice and other primary care physicians. The Integrative Medicine in Residency (IMR) curriculum project helped family medicine residencies pilot a new, online curriculum promoting prevention, patient-centered care competencies, use of complementary and alternative medicine along with conventional medicine for management of chronic illness. A major potential benefit of the IMR program is enhanced recruitment into participating residencies, which is reported here. Using an online questionnaire, accepted applicants to the eight IMR pilot programs (n = 152) and four control programs (n = 50) were asked about their interests in learning integrative medicine (IM) and in the pilot sites how the presence of the IMR curriculum affected their ranking decisions. Of residents at the IMR sites, 46.7% reported that the presence of the IMR was very important or important in their ranking decision. The IMR also ranked fourth overall in importance of ranking after geography, quality of faculty, and academic reputation of the residency. The majority of IMR residents (87.5%) had high to moderate interest in learning IM during their residency; control residents also had a high interest in learning IM (61.2%). The presence of the IMR curriculum was seen as a strong positive by applicants in ranking residencies. Increasing the adoption of innovative IM curricula, such as the IMR, by residency programs may be helpful in increasing applications of competitive medical students into primary care residencies as well as in responding to the expressed interest in learning the IM approach to patient care. Copyright © 2014. Published by Elsevier Inc.

A unified framework of image latent feature learning on Sina microblog

NASA Astrophysics Data System (ADS)

Wei, Jinjin; Jin, Zhigang; Zhou, Yuan; Zhang, Rui

2015-10-01

Large-scale user-contributed images with texts are rapidly increasing on the social media websites, such as Sina microblog. However, the noise and incomplete correspondence between the images and the texts give rise to the difficulty in precise image retrieval and ranking. In this paper, a hypergraph-based learning framework is proposed for image ranking, which simultaneously utilizes visual feature, textual content and social link information to estimate the relevance between images. Representing each image as a vertex in the hypergraph, complex relationship between images can be reflected exactly. Then updating the weight of hyperedges throughout the hypergraph learning process, the effect of different edges can be adaptively modulated in the constructed hypergraph. Furthermore, the popularity degree of the image is employed to re-rank the retrieval results. Comparative experiments on a large-scale Sina microblog data-set demonstrate the effectiveness of the proposed approach.

Dual Low-Rank Pursuit: Learning Salient Features for Saliency Detection.

PubMed

Lang, Congyan; Feng, Jiashi; Feng, Songhe; Wang, Jingdong; Yan, Shuicheng

2016-06-01

Saliency detection is an important procedure for machines to understand visual world as humans do. In this paper, we consider a specific saliency detection problem of predicting human eye fixations when they freely view natural images, and propose a novel dual low-rank pursuit (DLRP) method. DLRP learns saliency-aware feature transformations by utilizing available supervision information and constructs discriminative bases for effectively detecting human fixation points under the popular low-rank and sparsity-pursuit framework. Benefiting from the embedded high-level information in the supervised learning process, DLRP is able to predict fixations accurately without performing the expensive object segmentation as in the previous works. Comprehensive experiments clearly show the superiority of the proposed DLRP method over the established state-of-the-art methods. We also empirically demonstrate that DLRP provides stronger generalization performance across different data sets and inherits the advantages of both the bottom-up- and top-down-based saliency detection methods.

Fully Decentralized Semi-supervised Learning via Privacy-preserving Matrix Completion.

PubMed

Fierimonte, Roberto; Scardapane, Simone; Uncini, Aurelio; Panella, Massimo

2016-08-26

Distributed learning refers to the problem of inferring a function when the training data are distributed among different nodes. While significant work has been done in the contexts of supervised and unsupervised learning, the intermediate case of Semi-supervised learning in the distributed setting has received less attention. In this paper, we propose an algorithm for this class of problems, by extending the framework of manifold regularization. The main component of the proposed algorithm consists of a fully distributed computation of the adjacency matrix of the training patterns. To this end, we propose a novel algorithm for low-rank distributed matrix completion, based on the framework of diffusion adaptation. Overall, the distributed Semi-supervised algorithm is efficient and scalable, and it can preserve privacy by the inclusion of flexible privacy-preserving mechanisms for similarity computation. The experimental results and comparison on a wide range of standard Semi-supervised benchmarks validate our proposal.

Identification of the Learning Styles and "On-the-Job" Learning Methods Implemented by Nurses for Promoting Their Professional Knowledge and Skills.

PubMed

Rassin, Michal; Kurzweil, Yaffa; Maoz, Yael

2015-05-09

The aim of this study was to identify the learning styles and methods used by nurses to promote their professional knowledge and skills. 928 nurses from 11 hospitals across Israel completed 2 questionnaires, (1) Kolb's Learning Style Inventory, Version 3.1. and (2) the On-The-Job Learning Styles Questionnaire for the Nursing Profession. The most common learning style was the convergent style. The other learning styles were rated in the following descending order: accommodation, assimilation, and divergence. The on-the-job learning style consistently ranked highest was experience of relevant situations. On the other hand, seeking knowledge from books, journals, television, or the Internet was ranked lowest on all the indicators examined. With respect to general and on-the-job learning styles, statistically significant differences were found between groups of nurses by: country of birth, gender, department, age, education, and role. Nurses required to take more personal responsibility for their own professional development by deepening their self-learning skills.

Comparison of different eigensolvers for calculating vibrational spectra using low-rank, sum-of-product basis functions

NASA Astrophysics Data System (ADS)

Leclerc, Arnaud; Thomas, Phillip S.; Carrington, Tucker

2017-08-01

Vibrational spectra and wavefunctions of polyatomic molecules can be calculated at low memory cost using low-rank sum-of-product (SOP) decompositions to represent basis functions generated using an iterative eigensolver. Using a SOP tensor format does not determine the iterative eigensolver. The choice of the interative eigensolver is limited by the need to restrict the rank of the SOP basis functions at every stage of the calculation. We have adapted, implemented and compared different reduced-rank algorithms based on standard iterative methods (block-Davidson algorithm, Chebyshev iteration) to calculate vibrational energy levels and wavefunctions of the 12-dimensional acetonitrile molecule. The effect of using low-rank SOP basis functions on the different methods is analysed and the numerical results are compared with those obtained with the reduced rank block power method. Relative merits of the different algorithms are presented, showing that the advantage of using a more sophisticated method, although mitigated by the use of reduced-rank SOP functions, is noticeable in terms of CPU time.

Synergies Between Quantum Mechanics and Machine Learning in Reaction Prediction.

PubMed

Sadowski, Peter; Fooshee, David; Subrahmanya, Niranjan; Baldi, Pierre

2016-11-28

Machine learning (ML) and quantum mechanical (QM) methods can be used in two-way synergy to build chemical reaction expert systems. The proposed ML approach identifies electron sources and sinks among reactants and then ranks all source-sink pairs. This addresses a bottleneck of QM calculations by providing a prioritized list of mechanistic reaction steps. QM modeling can then be used to compute the transition states and activation energies of the top-ranked reactions, providing additional or improved examples of ranked source-sink pairs. Retraining the ML model closes the loop, producing more accurate predictions from a larger training set. The approach is demonstrated in detail using a small set of organic radical reactions.

Local Approximation and Hierarchical Methods for Stochastic Optimization

NASA Astrophysics Data System (ADS)

Cheng, Bolong

In this thesis, we present local and hierarchical approximation methods for two classes of stochastic optimization problems: optimal learning and Markov decision processes. For the optimal learning problem class, we introduce a locally linear model with radial basis function for estimating the posterior mean of the unknown objective function. The method uses a compact representation of the function which avoids storing the entire history, as is typically required by nonparametric methods. We derive a knowledge gradient policy with the locally parametric model, which maximizes the expected value of information. We show the policy is asymptotically optimal in theory, and experimental works suggests that the method can reliably find the optimal solution on a range of test functions. For the Markov decision processes problem class, we are motivated by an application where we want to co-optimize a battery for multiple revenue, in particular energy arbitrage and frequency regulation. The nature of this problem requires the battery to make charging and discharging decisions at different time scales while accounting for the stochastic information such as load demand, electricity prices, and regulation signals. Computing the exact optimal policy becomes intractable due to the large state space and the number of time steps. We propose two methods to circumvent the computation bottleneck. First, we propose a nested MDP model that structure the co-optimization problem into smaller sub-problems with reduced state space. This new model allows us to understand how the battery behaves down to the two-second dynamics (that of the frequency regulation market). Second, we introduce a low-rank value function approximation for backward dynamic programming. This new method only requires computing the exact value function for a small subset of the state space and approximate the entire value function via low-rank matrix completion. We test these methods on historical price data from the PJM Interconnect and show that it outperforms the baseline approach used in the industry.

Ranking docking poses by graph matching of protein-ligand interactions: lessons learned from the D3R Grand Challenge 2

NASA Astrophysics Data System (ADS)

da Silva Figueiredo Celestino Gomes, Priscila; Da Silva, Franck; Bret, Guillaume; Rognan, Didier

2018-01-01

A novel docking challenge has been set by the Drug Design Data Resource (D3R) in order to predict the pose and affinity ranking of a set of Farnesoid X receptor (FXR) agonists, prior to the public release of their bound X-ray structures and potencies. In a first phase, 36 agonists were docked to 26 Protein Data Bank (PDB) structures of the FXR receptor, and next rescored using the in-house developed GRIM method. GRIM aligns protein-ligand interaction patterns of docked poses to those of available PDB templates for the target protein, and rescore poses by a graph matching method. In agreement with results obtained during the previous 2015 docking challenge, we clearly show that GRIM rescoring improves the overall quality of top-ranked poses by prioritizing interaction patterns already visited in the PDB. Importantly, this challenge enables us to refine the applicability domain of the method by better defining the conditions of its success. We notably show that rescoring apolar ligands in hydrophobic pockets leads to frequent GRIM failures. In the second phase, 102 FXR agonists were ranked by decreasing affinity according to the Gibbs free energy of the corresponding GRIM-selected poses, computed by the HYDE scoring function. Interestingly, this fast and simple rescoring scheme provided the third most accurate ranking method among 57 contributions. Although the obtained ranking is still unsuitable for hit to lead optimization, the GRIM-HYDE scoring scheme is accurate and fast enough to post-process virtual screening data.

Yager’s ranking method for solving the trapezoidal fuzzy number linear programming

NASA Astrophysics Data System (ADS)

Karyati; Wutsqa, D. U.; Insani, N.

2018-03-01

In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.

Blind compressive sensing dynamic MRI

PubMed Central

Lingala, Sajan Goud; Jacob, Mathews

2013-01-01

We propose a novel blind compressive sensing (BCS) frame work to recover dynamic magnetic resonance images from undersampled measurements. This scheme models the dynamic signal as a sparse linear combination of temporal basis functions, chosen from a large dictionary. In contrast to classical compressed sensing, the BCS scheme simultaneously estimates the dictionary and the sparse coefficients from the undersampled measurements. Apart from the sparsity of the coefficients, the key difference of the BCS scheme with current low rank methods is the non-orthogonal nature of the dictionary basis functions. Since the number of degrees of freedom of the BCS model is smaller than that of the low-rank methods, it provides improved reconstructions at high acceleration rates. We formulate the reconstruction as a constrained optimization problem; the objective function is the linear combination of a data consistency term and sparsity promoting ℓ1 prior of the coefficients. The Frobenius norm dictionary constraint is used to avoid scale ambiguity. We introduce a simple and efficient majorize-minimize algorithm, which decouples the original criterion into three simpler sub problems. An alternating minimization strategy is used, where we cycle through the minimization of three simpler problems. This algorithm is seen to be considerably faster than approaches that alternates between sparse coding and dictionary estimation, as well as the extension of K-SVD dictionary learning scheme. The use of the ℓ1 penalty and Frobenius norm dictionary constraint enables the attenuation of insignificant basis functions compared to the ℓ0 norm and column norm constraint assumed in most dictionary learning algorithms; this is especially important since the number of basis functions that can be reliably estimated is restricted by the available measurements. We also observe that the proposed scheme is more robust to local minima compared to K-SVD method, which relies on greedy sparse coding. Our phase transition experiments demonstrate that the BCS scheme provides much better recovery rates than classical Fourier-based CS schemes, while being only marginally worse than the dictionary aware setting. Since the overhead in additionally estimating the dictionary is low, this method can be very useful in dynamic MRI applications, where the signal is not sparse in known dictionaries. We demonstrate the utility of the BCS scheme in accelerating contrast enhanced dynamic data. We observe superior reconstruction performance with the BCS scheme in comparison to existing low rank and compressed sensing schemes. PMID:23542951

76 FR 1606 - Privacy Act of 1974; System of Records

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-11

... Number (SSN), rank, gender, birth date, medical appointment scheduling information, employment... manage the entire learning environment for all soldiers. Training managers at separate companies..., unit number, rank, military occupational specialty, skill level, and signature. In addition, the...

Ranking Medical Terms to Support Expansion of Lay Language Resources for Patient Comprehension of Electronic Health Record Notes: Adapted Distant Supervision Approach

PubMed Central

Jagannatha, Abhyuday N; Fodeh, Samah J; Yu, Hong

2017-01-01

Background Medical terms are a major obstacle for patients to comprehend their electronic health record (EHR) notes. Clinical natural language processing (NLP) systems that link EHR terms to lay terms or definitions allow patients to easily access helpful information when reading through their EHR notes, and have shown to improve patient EHR comprehension. However, high-quality lay language resources for EHR terms are very limited in the public domain. Because expanding and curating such a resource is a costly process, it is beneficial and even necessary to identify terms important for patient EHR comprehension first. Objective We aimed to develop an NLP system, called adapted distant supervision (ADS), to rank candidate terms mined from EHR corpora. We will give EHR terms ranked as high by ADS a higher priority for lay language annotation—that is, creating lay definitions for these terms. Methods Adapted distant supervision uses distant supervision from consumer health vocabulary and transfer learning to adapt itself to solve the problem of ranking EHR terms in the target domain. We investigated 2 state-of-the-art transfer learning algorithms (ie, feature space augmentation and supervised distant supervision) and designed 5 types of learning features, including distributed word representations learned from large EHR data for ADS. For evaluating ADS, we asked domain experts to annotate 6038 candidate terms as important or nonimportant for EHR comprehension. We then randomly divided these data into the target-domain training data (1000 examples) and the evaluation data (5038 examples). We compared ADS with 2 strong baselines, including standard supervised learning, on the evaluation data. Results The ADS system using feature space augmentation achieved the best average precision, 0.850, on the evaluation set when using 1000 target-domain training examples. The ADS system using supervised distant supervision achieved the best average precision, 0.819, on the evaluation set when using only 100 target-domain training examples. The 2 ADS systems both performed significantly better than the baseline systems (P<.001 for all measures and all conditions). Using a rich set of learning features contributed to ADS’s performance substantially. Conclusions ADS can effectively rank terms mined from EHRs. Transfer learning improved ADS’s performance even with a small number of target-domain training examples. EHR terms prioritized by ADS were used to expand a lay language resource that supports patient EHR comprehension. The top 10,000 EHR terms ranked by ADS are available upon request. PMID:29089288

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

NASA Astrophysics Data System (ADS)

Alias, Christophe; Darte, Alain; Feautrier, Paul; Gonnord, Laure

Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a well-founded set, which strictly decreases at each program step. A standard method to automatically generate such a function is to compute invariants for each program point and to search for a ranking in a restricted class of functions that can be handled with linear programming techniques. Previous algorithms based on affine rankings either are applicable only to simple loops (i.e., single-node flowcharts) and rely on enumeration, or are not complete in the sense that they are not guaranteed to find a ranking in the class of functions they consider, if one exists. Our first contribution is to propose an efficient algorithm to compute ranking functions: It can handle flowcharts of arbitrary structure, the class of candidate rankings it explores is larger, and our method, although greedy, is provably complete. Our second contribution is to show how to use the ranking functions we generate to get upper bounds for the computational complexity (number of transitions) of the source program. This estimate is a polynomial, which means that we can handle programs with more than linear complexity. We applied the method on a collection of test cases from the literature. We also show the links and differences with previous techniques based on the insertion of counters.

Thalamo-Sensorimotor Functional Connectivity Correlates with World Ranking of Olympic, Elite, and High Performance Athletes.

PubMed

Huang, Zirui; Davis, Henry Hap; Wolff, Annemarie; Northoff, Georg

2017-01-01

Brain plasticity studies have shown functional reorganization in participants with outstanding motor expertise. Little is known about neural plasticity associated with exceptionally long motor training or of its predictive value for motor performance excellence. The present study utilised resting-state functional magnetic resonance imaging (rs-fMRI) in a unique sample of world-class athletes: Olympic, elite, and internationally ranked swimmers ( n = 30). Their world ranking ranged from 1st to 250th: each had prepared for participation in the Olympic Games. Combining rs-fMRI graph-theoretical and seed-based functional connectivity analyses, it was discovered that the thalamus has its strongest connections with the sensorimotor network in elite swimmers with the highest world rankings (career best rank: 1-35). Strikingly, thalamo-sensorimotor functional connections were highly correlated with the swimmers' motor performance excellence, that is, accounting for 41% of the individual variance in best world ranking. Our findings shed light on neural correlates of long-term athletic performance involving thalamo-sensorimotor functional circuits.

Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.

PubMed

Jia, Zhilong; Zhang, Xiang; Guan, Naiyang; Bo, Xiaochen; Barnes, Michael R; Luo, Zhigang

2015-01-01

RNA-sequencing is rapidly becoming the method of choice for studying the full complexity of transcriptomes, however with increasing dimensionality, accurate gene ranking is becoming increasingly challenging. This paper proposes an accurate and sensitive gene ranking method that implements discriminant non-negative matrix factorization (DNMF) for RNA-seq data. To the best of our knowledge, this is the first work to explore the utility of DNMF for gene ranking. When incorporating Fisher's discriminant criteria and setting the reduced dimension as two, DNMF learns two factors to approximate the original gene expression data, abstracting the up-regulated or down-regulated metagene by using the sample label information. The first factor denotes all the genes' weights of two metagenes as the additive combination of all genes, while the second learned factor represents the expression values of two metagenes. In the gene ranking stage, all the genes are ranked as a descending sequence according to the differential values of the metagene weights. Leveraging the nature of NMF and Fisher's criterion, DNMF can robustly boost the gene ranking performance. The Area Under the Curve analysis of differential expression analysis on two benchmarking tests of four RNA-seq data sets with similar phenotypes showed that our proposed DNMF-based gene ranking method outperforms other widely used methods. Moreover, the Gene Set Enrichment Analysis also showed DNMF outweighs others. DNMF is also computationally efficient, substantially outperforming all other benchmarked methods. Consequently, we suggest DNMF is an effective method for the analysis of differential gene expression and gene ranking for RNA-seq data.

Student and faculty perceptions of problem-based learning on a family medicine clerkship.

PubMed

McGrew, M C; Skipper, B; Palley, T; Kaufman, A

1999-03-01

The value of problem-based learning (PBL) in the preclinical years of medical school has been described widely in the literature. This study evaluates student and faculty perceptions of PBL during the clinical years of medical school, on a family medicine clerkship. Students used a 4-point scale to rate clerkship educational components on how well learning was facilitated. Faculty narratives of their perceptions of PBL were reviewed. Educational components that involved active learning by students--clinical activity, independent learning, and PBL tutorials--were ranked highest by students. Faculty perceived that PBL on the clerkship simulated "real-life" learning, included more behavioral and population issues, and provided substantial blocks of student contact time for improved student evaluation. Students and faculty in a family medicine clerkship ranked PBL sessions higher than any other nonclinical component of the clerkship. In addition to providing students with opportunities for self-directed learning, the PBL sessions provide faculty with more contact time with students, thereby enhancing the assessment of students' learning and progress.

An extensive analysis of disease-gene associations using network integration and fast kernel-based gene prioritization methods.

PubMed

Valentini, Giorgio; Paccanaro, Alberto; Caniza, Horacio; Romero, Alfonso E; Re, Matteo

2014-06-01

In the context of "network medicine", gene prioritization methods represent one of the main tools to discover candidate disease genes by exploiting the large amount of data covering different types of functional relationships between genes. Several works proposed to integrate multiple sources of data to improve disease gene prioritization, but to our knowledge no systematic studies focused on the quantitative evaluation of the impact of network integration on gene prioritization. In this paper, we aim at providing an extensive analysis of gene-disease associations not limited to genetic disorders, and a systematic comparison of different network integration methods for gene prioritization. We collected nine different functional networks representing different functional relationships between genes, and we combined them through both unweighted and weighted network integration methods. We then prioritized genes with respect to each of the considered 708 medical subject headings (MeSH) diseases by applying classical guilt-by-association, random walk and random walk with restart algorithms, and the recently proposed kernelized score functions. The results obtained with classical random walk algorithms and the best single network achieved an average area under the curve (AUC) across the 708 MeSH diseases of about 0.82, while kernelized score functions and network integration boosted the average AUC to about 0.89. Weighted integration, by exploiting the different "informativeness" embedded in different functional networks, outperforms unweighted integration at 0.01 significance level, according to the Wilcoxon signed rank sum test. For each MeSH disease we provide the top-ranked unannotated candidate genes, available for further bio-medical investigation. Network integration is necessary to boost the performances of gene prioritization methods. Moreover the methods based on kernelized score functions can further enhance disease gene ranking results, by adopting both local and global learning strategies, able to exploit the overall topology of the network. Copyright © 2014 The Authors. Published by Elsevier B.V. All rights reserved.

Mapping genomic features to functional traits through microbial whole genome sequences.

PubMed

Zhang, Wei; Zeng, Erliang; Liu, Dan; Jones, Stuart E; Emrich, Scott

2014-01-01

Recently, the utility of trait-based approaches for microbial communities has been identified. Increasing availability of whole genome sequences provide the opportunity to explore the genetic foundations of a variety of functional traits. We proposed a machine learning framework to quantitatively link the genomic features with functional traits. Genes from bacteria genomes belonging to different functional traits were grouped to Cluster of Orthologs (COGs), and were used as features. Then, TF-IDF technique from the text mining domain was applied to transform the data to accommodate the abundance and importance of each COG. After TF-IDF processing, COGs were ranked using feature selection methods to identify their relevance to the functional trait of interest. Extensive experimental results demonstrated that functional trait related genes can be detected using our method. Further, the method has the potential to provide novel biological insights.

Language Learning in Virtual Reality Environments: Past, Present, and Future

ERIC Educational Resources Information Center

Lin, Tsun-Ju; Lan, Yu-Ju

2015-01-01

This study investigated the research trends in language learning in a virtual reality environment by conducting a content analysis of findings published in the literature from 2004 to 2013 in four top ranked computer-assisted language learning journals: "Language Learning & Technology," "CALICO Journal," "Computer…

Temporal Restricted Visual Tracking Via Reverse-Low-Rank Sparse Learning.

PubMed

Yang, Yehui; Hu, Wenrui; Xie, Yuan; Zhang, Wensheng; Zhang, Tianzhu

2017-02-01

An effective representation model, which aims to mine the most meaningful information in the data, plays an important role in visual tracking. Some recent particle-filter-based trackers achieve promising results by introducing the low-rank assumption into the representation model. However, their assumed low-rank structure of candidates limits the robustness when facing severe challenges such as abrupt motion. To avoid the above limitation, we propose a temporal restricted reverse-low-rank learning algorithm for visual tracking with the following advantages: 1) the reverse-low-rank model jointly represents target and background templates via candidates, which exploits the low-rank structure among consecutive target observations and enforces the temporal consistency of target in a global level; 2) the appearance consistency may be broken when target suffers from sudden changes. To overcome this issue, we propose a local constraint via l 1,2 mixed-norm, which can not only ensures the local consistency of target appearance, but also tolerates the sudden changes between two adjacent frames; and 3) to alleviate the inference of unreasonable representation values due to outlier candidates, an adaptive weighted scheme is designed to improve the robustness of the tracker. By evaluating on 26 challenge video sequences, the experiments show the effectiveness and favorable performance of the proposed algorithm against 12 state-of-the-art visual trackers.

Complete hazard ranking to analyze right-censored data: An ALS survival study.

PubMed

Huang, Zhengnan; Zhang, Hongjiu; Boss, Jonathan; Goutman, Stephen A; Mukherjee, Bhramar; Dinov, Ivo D; Guan, Yuanfang

2017-12-01

Survival analysis represents an important outcome measure in clinical research and clinical trials; further, survival ranking may offer additional advantages in clinical trials. In this study, we developed GuanRank, a non-parametric ranking-based technique to transform patients' survival data into a linear space of hazard ranks. The transformation enables the utilization of machine learning base-learners including Gaussian process regression, Lasso, and random forest on survival data. The method was submitted to the DREAM Amyotrophic Lateral Sclerosis (ALS) Stratification Challenge. Ranked first place, the model gave more accurate ranking predictions on the PRO-ACT ALS dataset in comparison to Cox proportional hazard model. By utilizing right-censored data in its training process, the method demonstrated its state-of-the-art predictive power in ALS survival ranking. Its feature selection identified multiple important factors, some of which conflicts with previous studies.

Prediction of plant lncRNA by ensemble machine learning classifiers.

PubMed

Simopoulos, Caitlin M A; Weretilnyk, Elizabeth A; Golding, G Brian

2018-05-02

In plants, long non-protein coding RNAs are believed to have essential roles in development and stress responses. However, relative to advances on discerning biological roles for long non-protein coding RNAs in animal systems, this RNA class in plants is largely understudied. With comparatively few validated plant long non-coding RNAs, research on this potentially critical class of RNA is hindered by a lack of appropriate prediction tools and databases. Supervised learning models trained on data sets of mostly non-validated, non-coding transcripts have been previously used to identify this enigmatic RNA class with applications largely focused on animal systems. Our approach uses a training set comprised only of empirically validated long non-protein coding RNAs from plant, animal, and viral sources to predict and rank candidate long non-protein coding gene products for future functional validation. Individual stochastic gradient boosting and random forest classifiers trained on only empirically validated long non-protein coding RNAs were constructed. In order to use the strengths of multiple classifiers, we combined multiple models into a single stacking meta-learner. This ensemble approach benefits from the diversity of several learners to effectively identify putative plant long non-coding RNAs from transcript sequence features. When the predicted genes identified by the ensemble classifier were compared to those listed in GreeNC, an established plant long non-coding RNA database, overlap for predicted genes from Arabidopsis thaliana, Oryza sativa and Eutrema salsugineum ranged from 51 to 83% with the highest agreement in Eutrema salsugineum. Most of the highest ranking predictions from Arabidopsis thaliana were annotated as potential natural antisense genes, pseudogenes, transposable elements, or simply computationally predicted hypothetical protein. Due to the nature of this tool, the model can be updated as new long non-protein coding transcripts are identified and functionally verified. This ensemble classifier is an accurate tool that can be used to rank long non-protein coding RNA predictions for use in conjunction with gene expression studies. Selection of plant transcripts with a high potential for regulatory roles as long non-protein coding RNAs will advance research in the elucidation of long non-protein coding RNA function.

Extreme learning machines: a new approach for modeling dissolved oxygen (DO) concentration with and without water quality variables as predictors.

PubMed

Heddam, Salim; Kisi, Ozgur

2017-07-01

In this paper, several extreme learning machine (ELM) models, including standard extreme learning machine with sigmoid activation function (S-ELM), extreme learning machine with radial basis activation function (R-ELM), online sequential extreme learning machine (OS-ELM), and optimally pruned extreme learning machine (OP-ELM), are newly applied for predicting dissolved oxygen concentration with and without water quality variables as predictors. Firstly, using data from eight United States Geological Survey (USGS) stations located in different rivers basins, USA, the S-ELM, R-ELM, OS-ELM, and OP-ELM were compared against the measured dissolved oxygen (DO) using four water quality variables, water temperature, specific conductance, turbidity, and pH, as predictors. For each station, we used data measured at an hourly time step for a period of 4 years. The dataset was divided into a training set (70%) and a validation set (30%). We selected several combinations of the water quality variables as inputs for each ELM model and six different scenarios were compared. Secondly, an attempt was made to predict DO concentration without water quality variables. To achieve this goal, we used the year numbers, 2008, 2009, etc., month numbers from (1) to (12), day numbers from (1) to (31) and hour numbers from (00:00) to (24:00) as predictors. Thirdly, the best ELM models were trained using validation dataset and tested with the training dataset. The performances of the four ELM models were evaluated using four statistical indices: the coefficient of correlation (R), the Nash-Sutcliffe efficiency (NSE), the root mean squared error (RMSE), and the mean absolute error (MAE). Results obtained from the eight stations indicated that: (i) the best results were obtained by the S-ELM, R-ELM, OS-ELM, and OP-ELM models having four water quality variables as predictors; (ii) out of eight stations, the OP-ELM performed better than the other three ELM models at seven stations while the R-ELM performed the best at one station. The OS-ELM models performed the worst and provided the lowest accuracy; (iii) for predicting DO without water quality variables, the R-ELM performed the best at seven stations followed by the S-ELM in the second place and the OP-ELM performed the worst with low accuracy; (iv) for the final application where training ELM models with validation dataset and testing with training dataset, the OP-ELM provided the best accuracy using water quality variables and the R-ELM performed the best at all eight stations without water quality variables. Fourthly, and finally, we compared the results obtained from different ELM models with those obtained using multiple linear regression (MLR) and multilayer perceptron neural network (MLPNN). Results obtained using MLPNN and MLR models reveal that: (i) using water quality variables as predictors, the MLR performed the worst and provided the lowest accuracy in all stations; (ii) MLPNN was ranked in the second place at two stations, in the third place at four stations, and finally, in the fourth place at two stations, (iii) for predicting DO without water quality variables, MLPNN is ranked in the second place at five stations, and ranked in the third, fourth, and fifth places in the remaining three stations, while MLR was ranked in the last place with very low accuracy at all stations. Overall, the results suggest that the ELM is more effective than the MLPNN and MLR for modelling DO concentration in river ecosystems.

A Kernel-Based Low-Rank (KLR) Model for Low-Dimensional Manifold Recovery in Highly Accelerated Dynamic MRI.

PubMed

Nakarmi, Ukash; Wang, Yanhua; Lyu, Jingyuan; Liang, Dong; Ying, Leslie

2017-11-01

While many low rank and sparsity-based approaches have been developed for accelerated dynamic magnetic resonance imaging (dMRI), they all use low rankness or sparsity in input space, overlooking the intrinsic nonlinear correlation in most dMRI data. In this paper, we propose a kernel-based framework to allow nonlinear manifold models in reconstruction from sub-Nyquist data. Within this framework, many existing algorithms can be extended to kernel framework with nonlinear models. In particular, we have developed a novel algorithm with a kernel-based low-rank model generalizing the conventional low rank formulation. The algorithm consists of manifold learning using kernel, low rank enforcement in feature space, and preimaging with data consistency. Extensive simulation and experiment results show that the proposed method surpasses the conventional low-rank-modeled approaches for dMRI.

Ranking Workplace Competencies: Student and Graduate Perceptions.

ERIC Educational Resources Information Center

Rainsbury, Elizabeth; Hodges, Dave; Burchell, Noel; Lay, Mark

2002-01-01

New Zealand business students and graduates made similar rankings of the five most important workplace competencies: computer literacy, customer service orientation, teamwork and cooperation, self-confidence, and willingness to learn. Graduates placed greater importance on most of the 24 competencies, resulting in a statistically significant…

Efficient Multiple Kernel Learning Algorithms Using Low-Rank Representation.

PubMed

Niu, Wenjia; Xia, Kewen; Zu, Baokai; Bai, Jianchuan

2017-01-01

Unlike Support Vector Machine (SVM), Multiple Kernel Learning (MKL) allows datasets to be free to choose the useful kernels based on their distribution characteristics rather than a precise one. It has been shown in the literature that MKL holds superior recognition accuracy compared with SVM, however, at the expense of time consuming computations. This creates analytical and computational difficulties in solving MKL algorithms. To overcome this issue, we first develop a novel kernel approximation approach for MKL and then propose an efficient Low-Rank MKL (LR-MKL) algorithm by using the Low-Rank Representation (LRR). It is well-acknowledged that LRR can reduce dimension while retaining the data features under a global low-rank constraint. Furthermore, we redesign the binary-class MKL as the multiclass MKL based on pairwise strategy. Finally, the recognition effect and efficiency of LR-MKL are verified on the datasets Yale, ORL, LSVT, and Digit. Experimental results show that the proposed LR-MKL algorithm is an efficient kernel weights allocation method in MKL and boosts the performance of MKL largely.

Learning to Rank the Severity of Unrepaired Cleft Lip Nasal Deformity on 3D Mesh Data.

PubMed

Wu, Jia; Tse, Raymond; Shapiro, Linda G

2014-08-01

Cleft lip is a birth defect that results in deformity of the upper lip and nose. Its severity is widely variable and the results of treatment are influenced by the initial deformity. Objective assessment of severity would help to guide prognosis and treatment. However, most assessments are subjective. The purpose of this study is to develop and test quantitative computer-based methods of measuring cleft lip severity. In this paper, a grid-patch based measurement of symmetry is introduced, with which a computer program learns to rank the severity of cleft lip on 3D meshes of human infant faces. Three computer-based methods to define the midfacial reference plane were compared to two manual methods. Four different symmetry features were calculated based upon these reference planes, and evaluated. The result shows that the rankings predicted by the proposed features were highly correlated with the ranking orders provided by experts that were used as the ground truth.

Label Information Guided Graph Construction for Semi-Supervised Learning.

PubMed

Zhuang, Liansheng; Zhou, Zihan; Gao, Shenghua; Yin, Jingwen; Lin, Zhouchen; Ma, Yi

2017-09-01

In the literature, most existing graph-based semi-supervised learning methods only use the label information of observed samples in the label propagation stage, while ignoring such valuable information when learning the graph. In this paper, we argue that it is beneficial to consider the label information in the graph learning stage. Specifically, by enforcing the weight of edges between labeled samples of different classes to be zero, we explicitly incorporate the label information into the state-of-the-art graph learning methods, such as the low-rank representation (LRR), and propose a novel semi-supervised graph learning method called semi-supervised low-rank representation. This results in a convex optimization problem with linear constraints, which can be solved by the linearized alternating direction method. Though we take LRR as an example, our proposed method is in fact very general and can be applied to any self-representation graph learning methods. Experiment results on both synthetic and real data sets demonstrate that the proposed graph learning method can better capture the global geometric structure of the data, and therefore is more effective for semi-supervised learning tasks.

Establishment of a 12-gene expression signature to predict colon cancer prognosis

PubMed Central

Zhao, Guangxi; Dong, Pingping; Wu, Bingrui

2018-01-01

A robust and accurate gene expression signature is essential to assist oncologists to determine which subset of patients at similar Tumor-Lymph Node-Metastasis (TNM) stage has high recurrence risk and could benefit from adjuvant therapies. Here we applied a two-step supervised machine-learning method and established a 12-gene expression signature to precisely predict colon adenocarcinoma (COAD) prognosis by using COAD RNA-seq transcriptome data from The Cancer Genome Atlas (TCGA). The predictive performance of the 12-gene signature was validated with two independent gene expression microarray datasets: GSE39582 includes 566 COAD cases for the development of six molecular subtypes with distinct clinical, molecular and survival characteristics; GSE17538 is a dataset containing 232 colon cancer patients for the generation of a metastasis gene expression profile to predict recurrence and death in COAD patients. The signature could effectively separate the poor prognosis patients from good prognosis group (disease specific survival (DSS): Kaplan Meier (KM) Log Rank p = 0.0034; overall survival (OS): KM Log Rank p = 0.0336) in GSE17538. For patients with proficient mismatch repair system (pMMR) in GSE39582, the signature could also effectively distinguish high risk group from low risk group (OS: KM Log Rank p = 0.005; Relapse free survival (RFS): KM Log Rank p = 0.022). Interestingly, advanced stage patients were significantly enriched in high 12-gene score group (Fisher’s exact test p = 0.0003). After stage stratification, the signature could still distinguish poor prognosis patients in GSE17538 from good prognosis within stage II (Log Rank p = 0.01) and stage II & III (Log Rank p = 0.017) in the outcome of DFS. Within stage III or II/III pMMR patients treated with Adjuvant Chemotherapies (ACT) and patients with higher 12-gene score showed poorer prognosis (III, OS: KM Log Rank p = 0.046; III & II, OS: KM Log Rank p = 0.041). Among stage II/III pMMR patients with lower 12-gene scores in GSE39582, the subgroup receiving ACT showed significantly longer OS time compared with those who received no ACT (Log Rank p = 0.021), while there is no obvious difference between counterparts among patients with higher 12-gene scores (Log Rank p = 0.12). Besides COAD, our 12-gene signature is multifunctional in several other cancer types including kidney cancer, lung cancer, uveal and skin melanoma, brain cancer, and pancreatic cancer. Functional classification showed that seven of the twelve genes are involved in immune system function and regulation, so our 12-gene signature could potentially be used to guide decisions about adjuvant therapy for patients with stage II/III and pMMR COAD.

A ranking method for the concurrent learning of compounds with various activity profiles.

PubMed

Dörr, Alexander; Rosenbaum, Lars; Zell, Andreas

2015-01-01

In this study, we present a SVM-based ranking algorithm for the concurrent learning of compounds with different activity profiles and their varying prioritization. To this end, a specific labeling of each compound was elaborated in order to infer virtual screening models against multiple targets. We compared the method with several state-of-the-art SVM classification techniques that are capable of inferring multi-target screening models on three chemical data sets (cytochrome P450s, dehydrogenases, and a trypsin-like protease data set) containing three different biological targets each. The experiments show that ranking-based algorithms show an increased performance for single- and multi-target virtual screening. Moreover, compounds that do not completely fulfill the desired activity profile are still ranked higher than decoys or compounds with an entirely undesired profile, compared to other multi-target SVM methods. SVM-based ranking methods constitute a valuable approach for virtual screening in multi-target drug design. The utilization of such methods is most helpful when dealing with compounds with various activity profiles and the finding of many ligands with an already perfectly matching activity profile is not to be expected.

Low-rank regularization for learning gene expression programs.

PubMed

Ye, Guibo; Tang, Mengfan; Cai, Jian-Feng; Nie, Qing; Xie, Xiaohui

2013-01-01

Learning gene expression programs directly from a set of observations is challenging due to the complexity of gene regulation, high noise of experimental measurements, and insufficient number of experimental measurements. Imposing additional constraints with strong and biologically motivated regularizations is critical in developing reliable and effective algorithms for inferring gene expression programs. Here we propose a new form of regulation that constrains the number of independent connectivity patterns between regulators and targets, motivated by the modular design of gene regulatory programs and the belief that the total number of independent regulatory modules should be small. We formulate a multi-target linear regression framework to incorporate this type of regulation, in which the number of independent connectivity patterns is expressed as the rank of the connectivity matrix between regulators and targets. We then generalize the linear framework to nonlinear cases, and prove that the generalized low-rank regularization model is still convex. Efficient algorithms are derived to solve both the linear and nonlinear low-rank regularized problems. Finally, we test the algorithms on three gene expression datasets, and show that the low-rank regularization improves the accuracy of gene expression prediction in these three datasets.

Ranking Medical Terms to Support Expansion of Lay Language Resources for Patient Comprehension of Electronic Health Record Notes: Adapted Distant Supervision Approach.

PubMed

Chen, Jinying; Jagannatha, Abhyuday N; Fodeh, Samah J; Yu, Hong

2017-10-31

Medical terms are a major obstacle for patients to comprehend their electronic health record (EHR) notes. Clinical natural language processing (NLP) systems that link EHR terms to lay terms or definitions allow patients to easily access helpful information when reading through their EHR notes, and have shown to improve patient EHR comprehension. However, high-quality lay language resources for EHR terms are very limited in the public domain. Because expanding and curating such a resource is a costly process, it is beneficial and even necessary to identify terms important for patient EHR comprehension first. We aimed to develop an NLP system, called adapted distant supervision (ADS), to rank candidate terms mined from EHR corpora. We will give EHR terms ranked as high by ADS a higher priority for lay language annotation-that is, creating lay definitions for these terms. Adapted distant supervision uses distant supervision from consumer health vocabulary and transfer learning to adapt itself to solve the problem of ranking EHR terms in the target domain. We investigated 2 state-of-the-art transfer learning algorithms (ie, feature space augmentation and supervised distant supervision) and designed 5 types of learning features, including distributed word representations learned from large EHR data for ADS. For evaluating ADS, we asked domain experts to annotate 6038 candidate terms as important or nonimportant for EHR comprehension. We then randomly divided these data into the target-domain training data (1000 examples) and the evaluation data (5038 examples). We compared ADS with 2 strong baselines, including standard supervised learning, on the evaluation data. The ADS system using feature space augmentation achieved the best average precision, 0.850, on the evaluation set when using 1000 target-domain training examples. The ADS system using supervised distant supervision achieved the best average precision, 0.819, on the evaluation set when using only 100 target-domain training examples. The 2 ADS systems both performed significantly better than the baseline systems (P<.001 for all measures and all conditions). Using a rich set of learning features contributed to ADS's performance substantially. ADS can effectively rank terms mined from EHRs. Transfer learning improved ADS's performance even with a small number of target-domain training examples. EHR terms prioritized by ADS were used to expand a lay language resource that supports patient EHR comprehension. The top 10,000 EHR terms ranked by ADS are available upon request. ©Jinying Chen, Abhyuday N Jagannatha, Samah J Fodeh, Hong Yu. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 31.10.2017.

76 FR 26714 - Privacy Act of 1974; System of Records

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-09

... with ``Course and training data to include name, grade/rank/series, Social Security Number (SSN... in the system: Course and training data to include name, grade/rank/series, Social Security Number... amended. Purpose(s): The Army Career Tracker will receive training, education, experiential learning...

Beyond performance metrics: Examining a decrease in students' physics self-efficacy through a social networks lens

NASA Astrophysics Data System (ADS)

Dou, Remy; Brewe, Eric; Zwolak, Justyna P.; Potvin, Geoff; Williams, Eric A.; Kramer, Laird H.

2016-12-01

The Modeling Instruction (MI) approach to introductory physics manifests significant increases in student conceptual understanding and attitudes toward physics. In light of these findings, we investigated changes in student self-efficacy while considering the construct's contribution to the career-decision making process. Students in the Fall 2014 and 2015 MI courses at Florida International University exhibited a decrease on each of the sources of self-efficacy and overall self-efficacy (N =147 ) as measured by the Sources of Self-Efficacy in Science Courses-Physics (SOSESC-P) survey. This held true regardless of student gender or ethnic group. Given the highly interactive nature of the MI course and the drops observed on the SOSESC-P, we chose to further explore students' changes in self-efficacy as a function of three centrality measures (i.e., relational positions in the classroom social network): inDegree, outDegree, and PageRank. We collected social network data by periodically asking students to list the names of peers with whom they had meaningful interactions. While controlling for PRE scores on the SOSESC-P, bootstrapped linear regressions revealed post-self-efficacy scores to be predicted by PageRank centrality. When disaggregated by the sources of self-efficacy, PageRank centrality was shown to be directly related to students' sense of mastery experiences. InDegree was associated with verbal persuasion experiences, and outDegree with both verbal persuasion and vicarious learning experiences. We posit that analysis of social networks in active learning classrooms helps to reveal nuances in self-efficacy development.

Physiotherapy students' perceptions of learning in clinical practice in Sweden and India.

PubMed

Gard, Gunvor; Dagis, Daina

2016-01-01

It is reasonable to assume that conditions for learning differ between universities and countries. Increased understanding of similarities and differences of student's perceptions of learning environment can be useful in the development of the physiotherapy education as well as of the profession as such. Through international comparisons the benefits and challenges of educational programmes can be made transparent and serve as base for improvement. The objective of this study is to describe and compare physiotherapy students' perceptions of their learning environment in clinical practice in India and Sweden. A questionnaire study was performed, covering physiotherapy students' perceptions of their clinical learning environment, the physiotherapy supervisor within the clinical context, their supervisory relationship and the role of the clinical supervisor at two Universities, Luleå in Sweden and Amity in New Delhi, India. Undergraduate students at two physiotherapy programmes, in New Delhi, India and in Luleå, Sweden participated in the questionnaire study. In general, both groups had high rankings of their perceptions of the clinical learning environment. The Swedish students ranked individual supervision, participation in meetings, the supervisor as a resource, being a part of the team and giving them valuable feedback higher than the Indian group. The supervisory relationship was equally satisfying in groups, providing valuable feedback and acknowledging equality and mutuality in the relationship. The Indian group ranked the supervisor as a colleague, as a support in learning, and that he/she made them feel comfortable in meetings higher than the Swedish group. Both groups had high ratings of the supervisor and the clinical learning context Participation at meetings was higher rated in the Swedish and the supervisor as a support in learning higher rated of the Indian students. Copyright © 2015 Elsevier Ltd. All rights reserved.

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

DOE Office of Scientific and Technical Information (OSTI.GOV)

Naftchi-Ardebili, Kasra; Hau, Nathania W.; Mazziotti, David A.

2011-11-15

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associatedmore » with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N{sub 2} improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.« less

Learning Needs and Activity Limitations of Elderly Japanese with Physical Disabilities.

ERIC Educational Resources Information Center

Hori, Shigeo; Fujiwara, Mizuho

2003-01-01

A survey of 364 Japanese adults over 60 with physical disabilities found that 87% have learning needs in the areas of health care, communication, and leisure activities. Instrumental/social learning ranked higher among those with serious activity limitations. Expressive/communicative learning was more important for those with moderate limitations.…

Organisational Learning and Employees' Intrinsic Motivation

ERIC Educational Resources Information Center

Remedios, Richard; Boreham, Nick

2004-01-01

This study examined the effects of organisational learning initiatives on employee motivation. Four initiatives consistent with theories of organisational learning were a priori ranked in terms of concepts that underpin intrinsic-motivation theory. Eighteen employees in a UK petrochemical company were interviewed to ascertain their experiences of…

Attitudes of student nurses enrolled in e-learning course towards academic dishonesty: a descriptive-exploratory study.

PubMed

Tayaben, Jude L

2014-01-01

The author investigated attitudes of nursing students enrolled in e-Learning towards academic dishonesty. The descriptive-exploratory design was used in the conduct of the study. Respondents were randomly selected 36 junior and senior nursing students. It revealed that nursing students perceived as neutral (mean = 2.77, mean = 3.17) in taking responsibility for promoting academic integrity in e-learning. The paraphrasing a sentence from internet source without referencing it (38.89%) got the most form of cheating. Female and level four (4) nursing students revealed as the most cheaters. The reasons not to cheat, nursing students considered punishment, and education or learning (91.67%) got the highest in ranks, and simply wrong (75%) got the lowest rank. Hence, there is a need to look on how to maintain academic honesty among nursing students in and out of the university with respect to e-learning as a means of teaching-learning method.

The impact of instructional design in a case-based, computer-assisted instruction module on learning liver pathology in a medical school pathology course

NASA Astrophysics Data System (ADS)

Latham, Patricia S.

The purpose of this quantitative experimental study was to test the impact of three learning interventions on student learning and satisfaction when the interventions were embedded in the instructional design of case-based, Computer-Assisted Instruction (CAI) modules for learning liver pathology in an in-class, self-study, laboratory exercise during a Year-2 medical school Pathology course. The hypothesis was that inclusion of the learning interventions would enhance student satisfaction in using the CAI and improve subsequent CAI-directed exam performance. Three learning interventions were studied, including the use of microscopic virtual slides instead of only static images, the use of interactive image annotations instead of only still annotations, and the use of guiding questions before presenting new information. Students were randomly assigned to with one of eight CAI learning modules configured to control for each of the three learning interventions. Effectiveness of the CAI for student learning was assessed by student performance on questions included in subsequent CAI-directed exams in a pretest and on posttests immediately after the lab exercise, at two weeks and two months. Student satisfaction and perceived learning was assessed by a student survey. Results showed that the learning interventions did not improve subsequent student exam performance, although satisfaction and perceived learning with use of the CAI learning modules was enhanced. Student class rank was evaluated to determine if the learning interventions might have a differential effect based on class rank, but there were no significant differences. Class rank at the time of the lab exercise was itself the strongest predictor of exam performance. The findings suggest that the addition of virtual slides, interactive annotations and guiding questions as learning interventions in self-study, case-based CAI for learning liver pathology in a medical class room setting are not likely to increase performance on subsequent MCQ-based exams, but student satisfaction with use of the CAI can be enhanced, which could provide to be an incentive for students to use similar CAI learning modules for future self-directed learning.

Support Vector Hazards Machine: A Counting Process Framework for Learning Risk Scores for Censored Outcomes.

PubMed

Wang, Yuanjia; Chen, Tianle; Zeng, Donglin

2016-01-01

Learning risk scores to predict dichotomous or continuous outcomes using machine learning approaches has been studied extensively. However, how to learn risk scores for time-to-event outcomes subject to right censoring has received little attention until recently. Existing approaches rely on inverse probability weighting or rank-based regression, which may be inefficient. In this paper, we develop a new support vector hazards machine (SVHM) approach to predict censored outcomes. Our method is based on predicting the counting process associated with the time-to-event outcomes among subjects at risk via a series of support vector machines. Introducing counting processes to represent time-to-event data leads to a connection between support vector machines in supervised learning and hazards regression in standard survival analysis. To account for different at risk populations at observed event times, a time-varying offset is used in estimating risk scores. The resulting optimization is a convex quadratic programming problem that can easily incorporate non-linearity using kernel trick. We demonstrate an interesting link from the profiled empirical risk function of SVHM to the Cox partial likelihood. We then formally show that SVHM is optimal in discriminating covariate-specific hazard function from population average hazard function, and establish the consistency and learning rate of the predicted risk using the estimated risk scores. Simulation studies show improved prediction accuracy of the event times using SVHM compared to existing machine learning methods and standard conventional approaches. Finally, we analyze two real world biomedical study data where we use clinical markers and neuroimaging biomarkers to predict age-at-onset of a disease, and demonstrate superiority of SVHM in distinguishing high risk versus low risk subjects.

Comparison of Deep Learning With Multiple Machine Learning Methods and Metrics Using Diverse Drug Discovery Data Sets.

PubMed

Korotcov, Alexandru; Tkachenko, Valery; Russo, Daniel P; Ekins, Sean

2017-12-04

Machine learning methods have been applied to many data sets in pharmaceutical research for several decades. The relative ease and availability of fingerprint type molecular descriptors paired with Bayesian methods resulted in the widespread use of this approach for a diverse array of end points relevant to drug discovery. Deep learning is the latest machine learning algorithm attracting attention for many of pharmaceutical applications from docking to virtual screening. Deep learning is based on an artificial neural network with multiple hidden layers and has found considerable traction for many artificial intelligence applications. We have previously suggested the need for a comparison of different machine learning methods with deep learning across an array of varying data sets that is applicable to pharmaceutical research. End points relevant to pharmaceutical research include absorption, distribution, metabolism, excretion, and toxicity (ADME/Tox) properties, as well as activity against pathogens and drug discovery data sets. In this study, we have used data sets for solubility, probe-likeness, hERG, KCNQ1, bubonic plague, Chagas, tuberculosis, and malaria to compare different machine learning methods using FCFP6 fingerprints. These data sets represent whole cell screens, individual proteins, physicochemical properties as well as a data set with a complex end point. Our aim was to assess whether deep learning offered any improvement in testing when assessed using an array of metrics including AUC, F1 score, Cohen's kappa, Matthews correlation coefficient and others. Based on ranked normalized scores for the metrics or data sets Deep Neural Networks (DNN) ranked higher than SVM, which in turn was ranked higher than all the other machine learning methods. Visualizing these properties for training and test sets using radar type plots indicates when models are inferior or perhaps over trained. These results also suggest the need for assessing deep learning further using multiple metrics with much larger scale comparisons, prospective testing as well as assessment of different fingerprints and DNN architectures beyond those used.

Comprehensive modeling of microRNA targets predicts functional non-conserved and non-canonical sites.

PubMed

Betel, Doron; Koppal, Anjali; Agius, Phaedra; Sander, Chris; Leslie, Christina

2010-01-01

mirSVR is a new machine learning method for ranking microRNA target sites by a down-regulation score. The algorithm trains a regression model on sequence and contextual features extracted from miRanda-predicted target sites. In a large-scale evaluation, miRanda-mirSVR is competitive with other target prediction methods in identifying target genes and predicting the extent of their downregulation at the mRNA or protein levels. Importantly, the method identifies a significant number of experimentally determined non-canonical and non-conserved sites.

Interactive Inverse Groundwater Modeling - Addressing User Fatigue

NASA Astrophysics Data System (ADS)

Singh, A.; Minsker, B. S.

2006-12-01

This paper builds on ongoing research on developing an interactive and multi-objective framework to solve the groundwater inverse problem. In this work we solve the classic groundwater inverse problem of estimating a spatially continuous conductivity field, given field measurements of hydraulic heads. The proposed framework is based on an interactive multi-objective genetic algorithm (IMOGA) that not only considers quantitative measures such as calibration error and degree of regularization, but also takes into account expert knowledge about the structure of the underlying conductivity field expressed as subjective rankings of potential conductivity fields by the expert. The IMOGA converges to the optimal Pareto front representing the best trade- off among the qualitative as well as quantitative objectives. However, since the IMOGA is a population-based iterative search it requires the user to evaluate hundreds of solutions. This leads to the problem of 'user fatigue'. We propose a two step methodology to combat user fatigue in such interactive systems. The first step is choosing only a few highly representative solutions to be shown to the expert for ranking. Spatial clustering is used to group the search space based on the similarity of the conductivity fields. Sampling is then carried out from different clusters to improve the diversity of solutions shown to the user. Once the expert has ranked representative solutions from each cluster a machine learning model is used to 'learn user preference' and extrapolate these for the solutions not ranked by the expert. We investigate different machine learning models such as Decision Trees, Bayesian learning model, and instance based weighting to model user preference. In addition, we also investigate ways to improve the performance of these models by providing information about the spatial structure of the conductivity fields (which is what the expert bases his or her rank on). Results are shown for each of these machine learning models and the advantages and disadvantages for each approach are discussed. These results indicate that using the proposed two-step methodology leads to significant reduction in user-fatigue without deteriorating the solution quality of the IMOGA.

Super-Resolution Person Re-Identification With Semi-Coupled Low-Rank Discriminant Dictionary Learning.

PubMed

Jing, Xiao-Yuan; Zhu, Xiaoke; Wu, Fei; Hu, Ruimin; You, Xinge; Wang, Yunhong; Feng, Hui; Yang, Jing-Yu

2017-03-01

Person re-identification has been widely studied due to its importance in surveillance and forensics applications. In practice, gallery images are high resolution (HR), while probe images are usually low resolution (LR) in the identification scenarios with large variation of illumination, weather, or quality of cameras. Person re-identification in this kind of scenarios, which we call super-resolution (SR) person re-identification, has not been well studied. In this paper, we propose a semi-coupled low-rank discriminant dictionary learning (SLD 2 L) approach for SR person re-identification task. With the HR and LR dictionary pair and mapping matrices learned from the features of HR and LR training images, SLD 2 L can convert the features of the LR probe images into HR features. To ensure that the converted features have favorable discriminative capability and the learned dictionaries can well characterize intrinsic feature spaces of the HR and LR images, we design a discriminant term and a low-rank regularization term for SLD 2 L. Moreover, considering that low resolution results in different degrees of loss for different types of visual appearance features, we propose a multi-view SLD 2 L (MVSLD 2 L) approach, which can learn the type-specific dictionary pair and mappings for each type of feature. Experimental results on multiple publicly available data sets demonstrate the effectiveness of our proposed approaches for the SR person re-identification task.

The constraints satisfaction problem approach in the design of an architectural functional layout

NASA Astrophysics Data System (ADS)

Zawidzki, Machi; Tateyama, Kazuyoshi; Nishikawa, Ikuko

2011-09-01

A design support system with a new strategy for finding the optimal functional configurations of rooms for architectural layouts is presented. A set of configurations satisfying given constraints is generated and ranked according to multiple objectives. The method can be applied to problems in architectural practice, urban or graphic design-wherever allocation of related geometrical elements of known shape is optimized. Although the methodology is shown using simplified examples-a single story residential building with two apartments each having two rooms-the results resemble realistic functional layouts. One example of a practical size problem of a layout of three apartments with a total of 20 rooms is demonstrated, where the generated solution can be used as a base for a realistic architectural blueprint. The discretization of design space is discussed, followed by application of a backtrack search algorithm used for generating a set of potentially 'good' room configurations. Next the solutions are classified by a machine learning method (FFN) as 'proper' or 'improper' according to the internal communication criteria. Examples of interactive ranking of the 'proper' configurations according to multiple criteria and choosing 'the best' ones are presented. The proposed framework is general and universal-the criteria, parameters and weights can be individually defined by a user and the search algorithm can be adjusted to a specific problem.

Rank on emotional intelligence, unlearning and self-leadership.

PubMed

Kramer, Robert

2012-12-01

Propelled from the inner circle after publishing The Trauma of Birth (1924), Otto Rank jettisoned Freud's science of knowing because it denied the intelligence of the emotions. Transforming therapy from knowing to being-in-relationship, Rank invented modern object-relations theory, which advocates continual learning, unlearning and relearning: that is, cutting the chains that bind us to the past. Separating, no matter how anxiety-provoking, from outworn phases of life, including previously taken-for-granted ideologies and internalized others, is essential for self-leadership. In 1926, Rank coined the terms "here-and-now" and "pre-Oedipal." By 1926, Rank had formulated a model of "creative willing"-self-leadership infused with the intelligence of the emotions-as the optimal way of being-in-relationship with others.

Lung dynamic MRI deblurring using low-rank decomposition and dictionary learning.

PubMed

Gou, Shuiping; Wang, Yueyue; Wu, Jiaolong; Lee, Percy; Sheng, Ke

2015-04-01

Lung dynamic MRI (dMRI) has emerged to be an appealing tool to quantify lung motion for both planning and treatment guidance purposes. However, this modality can result in blurry images due to intrinsically low signal-to-noise ratio in the lung and spatial/temporal interpolation. The image blurring could adversely affect the image processing that depends on the availability of fine landmarks. The purpose of this study is to reduce dMRI blurring using image postprocessing. To enhance the image quality and exploit the spatiotemporal continuity of dMRI sequences, a low-rank decomposition and dictionary learning (LDDL) method was employed to deblur lung dMRI and enhance the conspicuity of lung blood vessels. Fifty frames of continuous 2D coronal dMRI frames using a steady state free precession sequence were obtained from five subjects including two healthy volunteer and three lung cancer patients. In LDDL, the lung dMRI was decomposed into sparse and low-rank components. Dictionary learning was employed to estimate the blurring kernel based on the whole image, low-rank or sparse component of the first image in the lung MRI sequence. Deblurring was performed on the whole image sequences using deconvolution based on the estimated blur kernel. The deblurring results were quantified using an automated blood vessel extraction method based on the classification of Hessian matrix filtered images. Accuracy of automated extraction was calculated using manual segmentation of the blood vessels as the ground truth. In the pilot study, LDDL based on the blurring kernel estimated from the sparse component led to performance superior to the other ways of kernel estimation. LDDL consistently improved image contrast and fine feature conspicuity of the original MRI without introducing artifacts. The accuracy of automated blood vessel extraction was on average increased by 16% using manual segmentation as the ground truth. Image blurring in dMRI images can be effectively reduced using a low-rank decomposition and dictionary learning method using kernels estimated by the sparse component.

Latent cardiac dysfunction as assessed by echocardiography in bed-bound patients following cerebrovascular accidents: comparison with nutritional status.

PubMed

Masugata, Hisashi; Senda, Shoichi; Goda, Fuminori; Yoshihara, Yumiko; Yoshikawa, Kay; Fujita, Norihiro; Himoto, Takashi; Okuyama, Hiroyuki; Taoka, Teruhisa; Imai, Masanobu; Kohno, Masakazu

2007-07-01

The aim of this study was to elucidate the cardiac function in bed-bound patients following cerebrovascular accidents. In accord with the criteria for activities of daily living (ADL) of the Japanese Ministry of Health, Labour and Welfare, 51 age-matched poststroke patients without heart disease were classified into 3 groups: rank A (house-bound) (n = 16, age, 85 +/- 6 years), rank B (chair-bound) (n = 16, age, 84 +/- 8 years), and rank C (bed-bound) (n = 19, age, 85 +/- 9 years). Using echocardiography, the left ventricular (LV) diastolic function was assessed by the ratio of early filling (E) and atrial contraction (A) transmitral flow velocities (E/A) of LV inflow. LV systolic function was assessed by LV ejection fraction (LVEF), and the Tei index was also measured to assess both LV systolic and diastolic function. No difference was observed in the E/A and LVEF among the 3 groups. The Tei index was higher in rank C (0.56 +/- 0.17) than in rank A (0.39 +/- 0.06) and rank B (0.48 +/- 0.17), and a statistically significant difference was observed between rank A and rank C (P < 0.05). Serum albumin and blood hemoglobin were significantly lower in rank C (3.1 +/- 0.4 and 10.6 +/- 1.8 g/dL) than in rank A (4.1 +/- 0.3 and 12.4 +/- 1.2 g/dL) (P < 0.001 and P < 0.05, respectively). These results indicate that latent cardiac dysfunction and poor nutritional status may exist in bed-bound patients (rank C) following cerebrovascular accidents. The Tei index may be a useful index of cardiac dysfunction in bed-bound patients because it is independent of the cardiac loading condition.

Jackknife Variance Estimator for Two Sample Linear Rank Statistics

DTIC Science & Technology

1988-11-01

Accesion For - - ,NTIS GPA&I "TIC TAB Unann c, nc .. [d Keywords: strong consistency; linear rank test’ influence function . i , at L By S- )Distribut...reverse if necessary and identify by block number) FIELD IGROUP SUB-GROUP Strong consistency; linear rank test; influence function . 19. ABSTRACT

Improving predicted protein loop structure ranking using a Pareto-optimality consensus method.

PubMed

Li, Yaohang; Rata, Ionel; Chiu, See-wing; Jakobsson, Eric

2010-07-20

Accurate protein loop structure models are important to understand functions of many proteins. Identifying the native or near-native models by distinguishing them from the misfolded ones is a critical step in protein loop structure prediction. We have developed a Pareto Optimal Consensus (POC) method, which is a consensus model ranking approach to integrate multiple knowledge- or physics-based scoring functions. The procedure of identifying the models of best quality in a model set includes: 1) identifying the models at the Pareto optimal front with respect to a set of scoring functions, and 2) ranking them based on the fuzzy dominance relationship to the rest of the models. We apply the POC method to a large number of decoy sets for loops of 4- to 12-residue in length using a functional space composed of several carefully-selected scoring functions: Rosetta, DOPE, DDFIRE, OPLS-AA, and a triplet backbone dihedral potential developed in our lab. Our computational results show that the sets of Pareto-optimal decoys, which are typically composed of approximately 20% or less of the overall decoys in a set, have a good coverage of the best or near-best decoys in more than 99% of the loop targets. Compared to the individual scoring function yielding best selection accuracy in the decoy sets, the POC method yields 23%, 37%, and 64% less false positives in distinguishing the native conformation, indentifying a near-native model (RMSD < 0.5A from the native) as top-ranked, and selecting at least one near-native model in the top-5-ranked models, respectively. Similar effectiveness of the POC method is also found in the decoy sets from membrane protein loops. Furthermore, the POC method outperforms the other popularly-used consensus strategies in model ranking, such as rank-by-number, rank-by-rank, rank-by-vote, and regression-based methods. By integrating multiple knowledge- and physics-based scoring functions based on Pareto optimality and fuzzy dominance, the POC method is effective in distinguishing the best loop models from the other ones within a loop model set.

Improving predicted protein loop structure ranking using a Pareto-optimality consensus method

PubMed Central

2010-01-01

Background Accurate protein loop structure models are important to understand functions of many proteins. Identifying the native or near-native models by distinguishing them from the misfolded ones is a critical step in protein loop structure prediction. Results We have developed a Pareto Optimal Consensus (POC) method, which is a consensus model ranking approach to integrate multiple knowledge- or physics-based scoring functions. The procedure of identifying the models of best quality in a model set includes: 1) identifying the models at the Pareto optimal front with respect to a set of scoring functions, and 2) ranking them based on the fuzzy dominance relationship to the rest of the models. We apply the POC method to a large number of decoy sets for loops of 4- to 12-residue in length using a functional space composed of several carefully-selected scoring functions: Rosetta, DOPE, DDFIRE, OPLS-AA, and a triplet backbone dihedral potential developed in our lab. Our computational results show that the sets of Pareto-optimal decoys, which are typically composed of ~20% or less of the overall decoys in a set, have a good coverage of the best or near-best decoys in more than 99% of the loop targets. Compared to the individual scoring function yielding best selection accuracy in the decoy sets, the POC method yields 23%, 37%, and 64% less false positives in distinguishing the native conformation, indentifying a near-native model (RMSD < 0.5A from the native) as top-ranked, and selecting at least one near-native model in the top-5-ranked models, respectively. Similar effectiveness of the POC method is also found in the decoy sets from membrane protein loops. Furthermore, the POC method outperforms the other popularly-used consensus strategies in model ranking, such as rank-by-number, rank-by-rank, rank-by-vote, and regression-based methods. Conclusions By integrating multiple knowledge- and physics-based scoring functions based on Pareto optimality and fuzzy dominance, the POC method is effective in distinguishing the best loop models from the other ones within a loop model set. PMID:20642859

Subspace Clustering via Learning an Adaptive Low-Rank Graph.

PubMed

Yin, Ming; Xie, Shengli; Wu, Zongze; Zhang, Yun; Gao, Junbin

2018-08-01

By using a sparse representation or low-rank representation of data, the graph-based subspace clustering has recently attracted considerable attention in computer vision, given its capability and efficiency in clustering data. However, the graph weights built using the representation coefficients are not the exact ones as the traditional definition is in a deterministic way. The two steps of representation and clustering are conducted in an independent manner, thus an overall optimal result cannot be guaranteed. Furthermore, it is unclear how the clustering performance will be affected by using this graph. For example, the graph parameters, i.e., the weights on edges, have to be artificially pre-specified while it is very difficult to choose the optimum. To this end, in this paper, a novel subspace clustering via learning an adaptive low-rank graph affinity matrix is proposed, where the affinity matrix and the representation coefficients are learned in a unified framework. As such, the pre-computed graph regularizer is effectively obviated and better performance can be achieved. Experimental results on several famous databases demonstrate that the proposed method performs better against the state-of-the-art approaches, in clustering.

Constrained dictionary learning and probabilistic hypergraph ranking for person re-identification

NASA Astrophysics Data System (ADS)

He, You; Wu, Song; Pu, Nan; Qian, Li; Xiao, Guoqiang

2018-04-01

Person re-identification is a fundamental and inevitable task in public security. In this paper, we propose a novel framework to improve the performance of this task. First, two different types of descriptors are extracted to represent a pedestrian: (1) appearance-based superpixel features, which are constituted mainly by conventional color features and extracted from the supepixel rather than a whole picture and (2) due to the limitation of discrimination of appearance features, the deep features extracted by feature fusion Network are also used. Second, a view invariant subspace is learned by dictionary learning constrained by the minimum negative sample (termed as DL-cMN) to reduce the noise in appearance-based superpixel feature domain. Then, we use deep features and sparse codes transformed by appearancebased features to establish the hyperedges respectively by k-nearest neighbor, rather than jointing different features simply. Finally, a final ranking is performed by probabilistic hypergraph ranking algorithm. Extensive experiments on three challenging datasets (VIPeR, PRID450S and CUHK01) demonstrate the advantages and effectiveness of our proposed algorithm.

Unsupervised Feature Learning With Winner-Takes-All Based STDP

PubMed Central

Ferré, Paul; Mamalet, Franck; Thorpe, Simon J.

2018-01-01

We present a novel strategy for unsupervised feature learning in image applications inspired by the Spike-Timing-Dependent-Plasticity (STDP) biological learning rule. We show equivalence between rank order coding Leaky-Integrate-and-Fire neurons and ReLU artificial neurons when applied to non-temporal data. We apply this to images using rank-order coding, which allows us to perform a full network simulation with a single feed-forward pass using GPU hardware. Next we introduce a binary STDP learning rule compatible with training on batches of images. Two mechanisms to stabilize the training are also presented : a Winner-Takes-All (WTA) framework which selects the most relevant patches to learn from along the spatial dimensions, and a simple feature-wise normalization as homeostatic process. This learning process allows us to train multi-layer architectures of convolutional sparse features. We apply our method to extract features from the MNIST, ETH80, CIFAR-10, and STL-10 datasets and show that these features are relevant for classification. We finally compare these results with several other state of the art unsupervised learning methods. PMID:29674961

Compressed Continuous Computation v. 12/20/2016

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gorodetsky, Alex

2017-02-17

A library for performing numerical computation with low-rank functions. The (C3) library enables performing continuous linear and multilinear algebra with multidimensional functions. Common tasks include taking "matrix" decompositions of vector- or matrix-valued functions, approximating multidimensional functions in low-rank format, adding or multiplying functions together, integrating multidimensional functions.

Pulmonary function outcomes for assessing cystic fibrosis care.

PubMed

Wagener, Jeffrey S; Elkin, Eric P; Pasta, David J; Schechter, Michael S; Konstan, Michael W; Morgan, Wayne J

2015-05-01

Assessing cystic fibrosis (CF) patient quality of care requires the choice of an appropriate outcome measure. We looked systematically and in detail at pulmonary function outcomes that potentially reflect clinical practice patterns. Epidemiologic Study of Cystic Fibrosis data were used to evaluate six potential outcome variables (2002 best FVC, FEV(1), and FEF(25-75) and rate of decline for each from 2000 to 2002). We ranked CF care sites by outcome measure and then assessed any association with practice patterns and follow-up pulmonary function. Sites ranked in the top quartile had more frequent monitoring, treatment of exacerbations, and use of chronic therapies and oral corticosteroids. The follow-up rate of pulmonary function decline was not predicted by site ranking. Different pulmonary function outcomes associate slightly differently with practice patterns, although annual FEV(1) is at least as good as any other measure. Current site ranking only moderately predicts future ranking. Copyright © 2014 European Cystic Fibrosis Society. Published by Elsevier B.V. All rights reserved.

The Principal's Role in Literacy

ERIC Educational Resources Information Center

Kinney, Patti

2009-01-01

"Breaking Ranks II" and "Breaking Ranks in the Middle" both call for students to master "academically rigorous essential learnings" that have been established by the school, and students need a strong foundation in reading and writing if this is to happen. There is no doubt that literacy instruction in the early grades is an essential beginning,…

Continuing Education Needs of the Office Oncology Nurse.

ERIC Educational Resources Information Center

Rogers, Miriam P.

1999-01-01

A study determined the learning needs of office oncology nurses (n=290)as a critical first step in planning education programs. Participants ranked cancer-care topics similarly, regardless of age, background, or experience. The highest-ranked needs were clustered in the areas of cancer nursing practice, major cancers, and cancer treatment.…

Examining Learning Rates in the Evaluation of Academic Interventions That Target Reading Fluency

ERIC Educational Resources Information Center

Solomon, Benjamin G.; Poncy, Brian C.; Caravello, Devin J.; Schweiger, Emily M.

2018-01-01

The purpose of the current study is to determine whether single-case intervention studies targeting reading fluency, ranked by traditional outcome metrics (i.e., effect sizes derived from phase differences), were discrepant with rankings based on instructional efficiency, including growth per session and minutes of instruction. Converging with…

Automatic Generation and Ranking of Questions for Critical Review

ERIC Educational Resources Information Center

Liu, Ming; Calvo, Rafael A.; Rus, Vasile

2014-01-01

Critical review skill is one important aspect of academic writing. Generic trigger questions have been widely used to support this activity. When students have a concrete topic in mind, trigger questions are less effective if they are too general. This article presents a learning-to-rank based system which automatically generates specific trigger…

Microcomputer Based Computer-Assisted Learning System: CASTLE.

ERIC Educational Resources Information Center

Garraway, R. W. T.

The purpose of this study was to investigate the extent to which a sophisticated computer assisted instruction (CAI) system could be implemented on the type of microcomputer system currently found in the schools. A method was devised for comparing CAI languages and was used to rank five common CAI languages. The highest ranked language, NATAL,…

Intrusion detection using rough set classification.

PubMed

Zhang, Lian-hua; Zhang, Guan-hua; Zhang, Jie; Bai, Ying-cai

2004-09-01

Recently machine learning-based intrusion detection approaches have been subjected to extensive researches because they can detect both misuse and anomaly. In this paper, rough set classification (RSC), a modern learning algorithm, is used to rank the features extracted for detecting intrusions and generate intrusion detection models. Feature ranking is a very critical step when building the model. RSC performs feature ranking before generating rules, and converts the feature ranking to minimal hitting set problem addressed by using genetic algorithm (GA). This is done in classical approaches using Support Vector Machine (SVM) by executing many iterations, each of which removes one useless feature. Compared with those methods, our method can avoid many iterations. In addition, a hybrid genetic algorithm is proposed to increase the convergence speed and decrease the training time of RSC. The models generated by RSC take the form of "IF-THEN" rules, which have the advantage of explication. Tests and comparison of RSC with SVM on DARPA benchmark data showed that for Probe and DoS attacks both RSC and SVM yielded highly accurate results (greater than 99% accuracy on testing set).

Active subspace: toward scalable low-rank learning.

PubMed

Liu, Guangcan; Yan, Shuicheng

2012-12-01

We address the scalability issues in low-rank matrix learning problems. Usually these problems resort to solving nuclear norm regularized optimization problems (NNROPs), which often suffer from high computational complexities if based on existing solvers, especially in large-scale settings. Based on the fact that the optimal solution matrix to an NNROP is often low rank, we revisit the classic mechanism of low-rank matrix factorization, based on which we present an active subspace algorithm for efficiently solving NNROPs by transforming large-scale NNROPs into small-scale problems. The transformation is achieved by factorizing the large solution matrix into the product of a small orthonormal matrix (active subspace) and another small matrix. Although such a transformation generally leads to nonconvex problems, we show that a suboptimal solution can be found by the augmented Lagrange alternating direction method. For the robust PCA (RPCA) (Candès, Li, Ma, & Wright, 2009 ) problem, a typical example of NNROPs, theoretical results verify the suboptimality of the solution produced by our algorithm. For the general NNROPs, we empirically show that our algorithm significantly reduces the computational complexity without loss of optimality.

Low-Rank Tensor Subspace Learning for RGB-D Action Recognition.

PubMed

Jia, Chengcheng; Fu, Yun

2016-07-09

Since RGB-D action data inherently equip with extra depth information compared with RGB data, recently many works employ RGB-D data in a third-order tensor representation containing spatio-temporal structure to find a subspace for action recognition. However, there are two main challenges of these methods. First, the dimension of subspace is usually fixed manually. Second, preserving local information by finding intraclass and inter-class neighbors from a manifold is highly timeconsuming. In this paper, we learn a tensor subspace, whose dimension is learned automatically by low-rank learning, for RGB-D action recognition. Particularly, the tensor samples are factorized to obtain three Projection Matrices (PMs) by Tucker Decomposition, where all the PMs are performed by nuclear norm in a close-form to obtain the tensor ranks which are used as tensor subspace dimension. Additionally, we extract the discriminant and local information from a manifold using a graph constraint. This graph preserves the local knowledge inherently, which is faster than the previous way by calculating both the intra-class and inter-class neighbors of each sample. We evaluate the proposed method on four widely used RGB-D action datasets including MSRDailyActivity3D, MSRActionPairs, MSRActionPairs skeleton and UTKinect-Action3D datasets, and the experimental results show higher accuracy and efficiency of the proposed method.

Quantum annealing versus classical machine learning applied to a simplified computational biology problem

PubMed Central

Li, Richard Y.; Di Felice, Rosa; Rohs, Remo; Lidar, Daniel A.

2018-01-01

Transcription factors regulate gene expression, but how these proteins recognize and specifically bind to their DNA targets is still debated. Machine learning models are effective means to reveal interaction mechanisms. Here we studied the ability of a quantum machine learning approach to predict binding specificity. Using simplified datasets of a small number of DNA sequences derived from actual binding affinity experiments, we trained a commercially available quantum annealer to classify and rank transcription factor binding. The results were compared to state-of-the-art classical approaches for the same simplified datasets, including simulated annealing, simulated quantum annealing, multiple linear regression, LASSO, and extreme gradient boosting. Despite technological limitations, we find a slight advantage in classification performance and nearly equal ranking performance using the quantum annealer for these fairly small training data sets. Thus, we propose that quantum annealing might be an effective method to implement machine learning for certain computational biology problems. PMID:29652405

FINDSITE-metal: Integrating evolutionary information and machine learning for structure-based metal binding site prediction at the proteome level

PubMed Central

Brylinski, Michal; Skolnick, Jeffrey

2010-01-01

The rapid accumulation of gene sequences, many of which are hypothetical proteins with unknown function, has stimulated the development of accurate computational tools for protein function prediction with evolution/structure-based approaches showing considerable promise. In this paper, we present FINDSITE-metal, a new threading-based method designed specifically to detect metal binding sites in modeled protein structures. Comprehensive benchmarks using different quality protein structures show that weakly homologous protein models provide sufficient structural information for quite accurate annotation by FINDSITE-metal. Combining structure/evolutionary information with machine learning results in highly accurate metal binding annotations; for protein models constructed by TASSER, whose average Cα RMSD from the native structure is 8.9 Å, 59.5% (71.9%) of the best of top five predicted metal locations are within 4 Å (8 Å) from a bound metal in the crystal structure. For most of the targets, multiple metal binding sites are detected with the best predicted binding site at rank 1 and within the top 2 ranks in 65.6% and 83.1% of the cases, respectively. Furthermore, for iron, copper, zinc, calcium and magnesium ions, the binding metal can be predicted with high, typically 70-90%, accuracy. FINDSITE-metal also provides a set of confidence indexes that help assess the reliability of predictions. Finally, we describe the proteome-wide application of FINDSITE-metal that quantifies the metal binding complement of the human proteome. FINDSITE-metal is freely available to the academic community at http://cssb.biology.gatech.edu/findsite-metal/. PMID:21287609

Computing Information Value from RDF Graph Properties

DOE Office of Scientific and Technical Information (OSTI.GOV)

al-Saffar, Sinan; Heileman, Gregory

2010-11-08

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We computemore » information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.« less

Model-Based Learning of Local Image Features for Unsupervised Texture Segmentation

NASA Astrophysics Data System (ADS)

Kiechle, Martin; Storath, Martin; Weinmann, Andreas; Kleinsteuber, Martin

2018-04-01

Features that capture well the textural patterns of a certain class of images are crucial for the performance of texture segmentation methods. The manual selection of features or designing new ones can be a tedious task. Therefore, it is desirable to automatically adapt the features to a certain image or class of images. Typically, this requires a large set of training images with similar textures and ground truth segmentation. In this work, we propose a framework to learn features for texture segmentation when no such training data is available. The cost function for our learning process is constructed to match a commonly used segmentation model, the piecewise constant Mumford-Shah model. This means that the features are learned such that they provide an approximately piecewise constant feature image with a small jump set. Based on this idea, we develop a two-stage algorithm which first learns suitable convolutional features and then performs a segmentation. We note that the features can be learned from a small set of images, from a single image, or even from image patches. The proposed method achieves a competitive rank in the Prague texture segmentation benchmark, and it is effective for segmenting histological images.

Selection and ranking of patient video cases in paediatric neurology in relation to learner levels.

PubMed

Balslev, Thomas; Muijtjens, Arno M M; Maarbjerg, Sabine Frølich; de Grave, Willem

2018-05-01

Teaching and learning with patient video cases may add authenticity, enhance diagnostic accuracy and improve chances of early diagnosis. The aim of this study is firstly to identify selection criteria for key Patient video cases (PVCs), secondly to identify trends in relevance of PVCs for learner levels and thirdly, to rank PVCs for learner levels. Based on a literature review, we identified criteria for key PVCs for use in paediatric neurology. We then performed a multi-round Delphi analysis to obtain agreement between 28 expert clinician teachers concerning key PVCs for four learner levels. We identified two major criteria: key PVCs should demonstrate key movements, and these movements should be subtle and/or difficult to note. The expert clinician teachers subsequently assessed a list of 14 topics for key PVCs. We found a clear, increasing trend in relevance scores, from medical students to young residents to experienced residents and specialists. For medical students and residents, epileptic spasms, Down syndrome, developmental delay, cerebral palsy and absence epilepsy were highly ranked. For specialists, conditions like chorea, focal seizures or eye movement disorders topped the ranking list, although ranking was less clear for this group of advanced learners. Key PVCs should demonstrate movements that are difficult to note for learners. Ranked lists of key PVCs for teaching and learning at different learner levels are now available and may help institutions build validated local libraries of PVCs. Copyright © 2017 European Paediatric Neurology Society. Published by Elsevier Ltd. All rights reserved.

Concurrent Validity Between a Shared Curriculum, the Internal Medicine In-Training Examination, and the American Board of Internal Medicine Certifying Examination.

PubMed

Sisson, Stephen D; Bertram, Amanda; Yeh, Hsin-Chieh

2015-03-01

A core objective of residency education is to facilitate learning, and programs need more curricula and assessment tools with demonstrated validity evidence. We sought to demonstrate concurrent validity between performance on a widely shared, ambulatory curriculum (the Johns Hopkins Internal Medicine Curriculum), the Internal Medicine In-Training Examination (IM-ITE), and the American Board of Internal Medicine Certifying Examination (ABIM-CE). A cohort study of 443 postgraduate year (PGY)-3 residents at 22 academic and community hospital internal medicine residency programs using the curriculum through the Johns Hopkins Internet Learning Center (ILC). Total and percentile rank scores on ILC didactic modules were compared with total and percentile rank scores on the IM-ITE and total scores on the ABIM-CE. The average score on didactic modules was 80.1%; the percentile rank was 53.8. The average IM-ITE score was 64.1% with a percentile rank of 54.8. The average score on the ABIM-CE was 464. Scores on the didactic modules, IM-ITE, and ABIM-CE correlated with each other (P < .05). Residents completing greater numbers of didactic modules, regardless of scores, had higher IM-ITE total and percentile rank scores (P < .05). Resident performance on modules covering back pain, hypertension, preoperative evaluation, and upper respiratory tract infection was associated with IM-ITE percentile rank. Performance on a widely shared ambulatory curriculum is associated with performance on the IM-ITE and the ABIM-CE.

Testing meta tagger

DTIC Science & Technology

2017-12-21

rank , and computer vision. Machine learning is closely related to (and often overlaps with) computational statistics, which also focuses on...Machine learning is a field of computer science that gives computers the ability to learn without being explicitly programmed.[1] Arthur Samuel...an American pioneer in the field of computer gaming and artificial intelligence, coined the term "Machine Learning " in 1959 while at IBM[2]. Evolved

Conditioned social dominance threat: observation of others' social dominance biases threat learning.

PubMed

Haaker, Jan; Molapour, Tanaz; Olsson, Andreas

2016-10-01

Social groups are organized along dominance hierarchies, which determine how we respond to threats posed by dominant and subordinate others. The persuasive impact of these dominance threats on mental and physical well-being has been well described but it is unknown how dominance rank of others bias our experience and learning in the first place. We introduce a model of conditioned social dominance threat in humans, where the presence of a dominant other is paired with an aversive event. Participants first learned about the dominance rank of others by observing their dyadic confrontations. During subsequent fear learning, the dominant and subordinate others were equally predictive of an aversive consequence (mild electric shock) to the participant. In three separate experiments, we show that participants' eye-blink startle responses and amygdala reactivity adaptively tracked dominance of others during observation of confrontation. Importantly, during fear learning dominant vs subordinate others elicited stronger and more persistent learned threat responses as measured by physiological arousal and amygdala activity. Our results characterize the neural basis of learning through observing conflicts between others, and how this affects subsequent learning through direct, personal experiences. © The Author (2016). Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Conditioned social dominance threat: observation of others’ social dominance biases threat learning

PubMed Central

Molapour, Tanaz; Olsson, Andreas

2016-01-01

Social groups are organized along dominance hierarchies, which determine how we respond to threats posed by dominant and subordinate others. The persuasive impact of these dominance threats on mental and physical well-being has been well described but it is unknown how dominance rank of others bias our experience and learning in the first place. We introduce a model of conditioned social dominance threat in humans, where the presence of a dominant other is paired with an aversive event. Participants first learned about the dominance rank of others by observing their dyadic confrontations. During subsequent fear learning, the dominant and subordinate others were equally predictive of an aversive consequence (mild electric shock) to the participant. In three separate experiments, we show that participants’ eye-blink startle responses and amygdala reactivity adaptively tracked dominance of others during observation of confrontation. Importantly, during fear learning dominant vs subordinate others elicited stronger and more persistent learned threat responses as measured by physiological arousal and amygdala activity. Our results characterize the neural basis of learning through observing conflicts between others, and how this affects subsequent learning through direct, personal experiences. PMID:27217107

Limited Rank Matrix Learning, discriminative dimension reduction and visualization.

PubMed

Bunte, Kerstin; Schneider, Petra; Hammer, Barbara; Schleif, Frank-Michael; Villmann, Thomas; Biehl, Michael

2012-02-01

We present an extension of the recently introduced Generalized Matrix Learning Vector Quantization algorithm. In the original scheme, adaptive square matrices of relevance factors parameterize a discriminative distance measure. We extend the scheme to matrices of limited rank corresponding to low-dimensional representations of the data. This allows to incorporate prior knowledge of the intrinsic dimension and to reduce the number of adaptive parameters efficiently. In particular, for very large dimensional data, the limitation of the rank can reduce computation time and memory requirements significantly. Furthermore, two- or three-dimensional representations constitute an efficient visualization method for labeled data sets. The identification of a suitable projection is not treated as a pre-processing step but as an integral part of the supervised training. Several real world data sets serve as an illustration and demonstrate the usefulness of the suggested method. Copyright © 2011 Elsevier Ltd. All rights reserved.

Consumer preference in ranking walking function utilizing the walking index for spinal cord injury II.

PubMed

Patrick, M; Ditunno, P; Ditunno, J F; Marino, R J; Scivoletto, G; Lam, T; Loffree, J; Tamburella, F; Leiby, B

2011-12-01

Blinded rank ordering. To determine consumer preference in walking function utilizing the walking Index for spinal cord injury II (WISCI II) in individuals with spinal cord injury (SCI)from the Canada, the Italy and the United States of America. In all, 42 consumers with incomplete SCI (25 cervical, 12 thoracic, 5 lumbar) from Canada (12/42), Italy (14/42) and the United States of America (16/42) ranked the 20 levels of the WISCI II scale by their individual preference for walking. Subjects were blinded to the original ranking of the WISCI II scale by clinical scientists. Photographs of each WISCI II level used in a previous pilot study were randomly shuffled and rank ordered. Percentile, conjoint/cluster and graphic analyses were performed. All three analyses illustrated consumer ranking followed a bimodal distribution. Ranking for two levels with physical assistance and two levels with a walker were bimodal with a difference of five to six ranks between consumer subgroups (quartile analysis). The larger cluster (N=20) showed preference for walking with assistance over the smaller cluster (N=12), whose preference was walking without assistance and more devices. In all, 64% (27/42) of consumers ranked WISCI II level with no devices or braces and 1 person assistance higher than multiple levels of the WISCI II requiring no assistance. These results were unexpected, as the hypothesis was that consumers would rank independent walking higher than walking with assistance. Consumer preference for walking function should be considered in addition to objective measures in designing SCI trials that use significant improvement in walking function as an outcome measure.

Medical student preferences for self-directed study resources in gross anatomy.

PubMed

Choi-Lundberg, Derek L; Low, Tze Feng; Patman, Phillip; Turner, Paul; Sinha, Sankar N

2016-01-01

Gross anatomy instruction in medical curricula involve a range of resources and activities including dissection, prosected specimens, anatomical models, radiological images, surface anatomy, textbooks, atlases, and computer-assisted learning (CAL). These resources and activities are underpinned by the expectation that students will actively engage in self-directed study (SDS) to enhance their knowledge and understanding of anatomy. To gain insight into preclinical versus clinical medical students' preferences for SDS resources for learning gross anatomy, and whether these vary on demographic characteristics and attitudes toward anatomy, students were surveyed at two Australian medical schools, one undergraduate-entry and the other graduate-entry. Lecture/tutorial/practical notes were ranked first by 33% of 156 respondents (mean rank ± SD, 2.48 ± 1.38), textbooks by 26% (2.62 ± 1.35), atlases 20% (2.80 ± 1.44), videos 10% (4.34 ± 1.68), software 5% (4.78 ± 1.50), and websites 4% (4.24 ± 1.34). Among CAL resources, Wikipedia was ranked highest. The most important factor in selecting CAL resources was cost (ranked first by 46%), followed by self-assessment, ease of use, alignment with curriculum, and excellent graphics (each 6-9%). Compared with preclinical students, clinical students ranked software and Acland's Video Atlas of Human Anatomy higher and felt radiological images were more important in selecting CAL resources. Along with other studies reporting on the quality, features, and impact on learning of CAL resources, the diversity of students' preferences and opinions on usefulness and ease of use reported here can help guide faculty in selecting and recommending a range of CAL and other resources to their students to support their self-directed study. © 2015 American Association of Anatomists.

A Corpus-Based Approach for Automatic Thai Unknown Word Recognition Using Boosting Techniques

NASA Astrophysics Data System (ADS)

Techo, Jakkrit; Nattee, Cholwich; Theeramunkong, Thanaruk

While classification techniques can be applied for automatic unknown word recognition in a language without word boundary, it faces with the problem of unbalanced datasets where the number of positive unknown word candidates is dominantly smaller than that of negative candidates. To solve this problem, this paper presents a corpus-based approach that introduces a so-called group-based ranking evaluation technique into ensemble learning in order to generate a sequence of classification models that later collaborate to select the most probable unknown word from multiple candidates. Given a classification model, the group-based ranking evaluation (GRE) is applied to construct a training dataset for learning the succeeding model, by weighing each of its candidates according to their ranks and correctness when the candidates of an unknown word are considered as one group. A number of experiments have been conducted on a large Thai medical text to evaluate performance of the proposed group-based ranking evaluation approach, namely V-GRE, compared to the conventional naïve Bayes classifier and our vanilla version without ensemble learning. As the result, the proposed method achieves an accuracy of 90.93±0.50% when the first rank is selected while it gains 97.26±0.26% when the top-ten candidates are considered, that is 8.45% and 6.79% improvement over the conventional record-based naïve Bayes classifier and the vanilla version. Another result on applying only best features show 93.93±0.22% and up to 98.85±0.15% accuracy for top-1 and top-10, respectively. They are 3.97% and 9.78% improvement over naive Bayes and the vanilla version. Finally, an error analysis is given.

dipIQ: Blind Image Quality Assessment by Learning-to-Rank Discriminable Image Pairs.

PubMed

Ma, Kede; Liu, Wentao; Liu, Tongliang; Wang, Zhou; Tao, Dacheng

2017-05-26

Objective assessment of image quality is fundamentally important in many image processing tasks. In this work, we focus on learning blind image quality assessment (BIQA) models which predict the quality of a digital image with no access to its original pristine-quality counterpart as reference. One of the biggest challenges in learning BIQA models is the conflict between the gigantic image space (which is in the dimension of the number of image pixels) and the extremely limited reliable ground truth data for training. Such data are typically collected via subjective testing, which is cumbersome, slow, and expensive. Here we first show that a vast amount of reliable training data in the form of quality-discriminable image pairs (DIP) can be obtained automatically at low cost by exploiting largescale databases with diverse image content. We then learn an opinion-unaware BIQA (OU-BIQA, meaning that no subjective opinions are used for training) model using RankNet, a pairwise learning-to-rank (L2R) algorithm, from millions of DIPs, each associated with a perceptual uncertainty level, leading to a DIP inferred quality (dipIQ) index. Extensive experiments on four benchmark IQA databases demonstrate that dipIQ outperforms state-of-the-art OU-BIQA models. The robustness of dipIQ is also significantly improved as confirmed by the group MAximum Differentiation (gMAD) competition method. Furthermore, we extend the proposed framework by learning models with ListNet (a listwise L2R algorithm) on quality-discriminable image lists (DIL). The resulting DIL Inferred Quality (dilIQ) index achieves an additional performance gain.

Does Assessment in Open Learning Support Students?

ERIC Educational Resources Information Center

Gibbs, Graham

2010-01-01

In England there is a national survey of all students just before they graduate from bachelor's programmes called the National Student Survey (NSS). This produces a very influential ranking of all universities and colleges in England in terms of how the education they provide is perceived by their students. Top of this ranking every year is the…

The Practice of Quality in Assuring Learning in Higher Education

ERIC Educational Resources Information Center

French, Erica; Summers, Jane; Kinash, Shelley; Lawson, Romy; Taylor, Tracy; Herbert, James; Fallshaw, Eveline; Hall, Cathy

2014-01-01

There remains a lack of published empirical data on the substantive outcomes of higher learning and the establishment of quality processes for determining them. Studies that do exist are nationally focused with available rankings of institutions reflecting neither the quality of teaching and learning nor the diversity of institutions. This article…

Producing Educational Learning Media Resources for Karen Children

ERIC Educational Resources Information Center

Chutataweesawas, Sirikoy; Tanchareon, Sumate; Wilang, Jeffrey Dawala

2018-01-01

To create appropriate educational learning media resources for the Karen community in Chiang Mai, Thailand, a project called 'The Research and Development Process of Multimedia Learning Resources' was initiated by a group of researchers from a top-ranked university in Bangkok. It consisted of picture books and an animation film derived from oral…

Studies Show Curricular Efficiency Can Be Attained.

ERIC Educational Resources Information Center

Walberg, Herbert J.

1987-01-01

Reviews the nine factors contributing to educational productivity, the effectiveness of instructional techniques (mastery learning ranks high and Skinnerian reinforcement has the largest overall effect), and the effects of psychological enviroments on learning. Includes references and a table. (MD)

78 FR 25787 - Community Connect Broadband Grant Program

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-03

... Learning and Telemedicine Grant Program) during its quarterly Tribal Consultation webinar and... accommodate distance learning, telework, e-government and telemedicine, rural America will see improving... through and beyond completion. 3. Scoring Simplification. The current program scores and ranks...

Reduction from cost-sensitive ordinal ranking to weighted binary classification.

PubMed

Lin, Hsuan-Tien; Li, Ling

2012-05-01

We present a reduction framework from ordinal ranking to binary classification. The framework consists of three steps: extracting extended examples from the original examples, learning a binary classifier on the extended examples with any binary classification algorithm, and constructing a ranker from the binary classifier. Based on the framework, we show that a weighted 0/1 loss of the binary classifier upper-bounds the mislabeling cost of the ranker, both error-wise and regret-wise. Our framework allows not only the design of good ordinal ranking algorithms based on well-tuned binary classification approaches, but also the derivation of new generalization bounds for ordinal ranking from known bounds for binary classification. In addition, our framework unifies many existing ordinal ranking algorithms, such as perceptron ranking and support vector ordinal regression. When compared empirically on benchmark data sets, some of our newly designed algorithms enjoy advantages in terms of both training speed and generalization performance over existing algorithms. In addition, the newly designed algorithms lead to better cost-sensitive ordinal ranking performance, as well as improved listwise ranking performance.

Systematic Differences in Signal Emitting and Receiving Revealed by PageRank Analysis of a Human Protein Interactome

PubMed Central

Li, Xiu-Qing

2012-01-01

Most protein PageRank studies do not use signal flow direction information in protein interactions because this information was not readily available in large protein databases until recently. Therefore, four questions have yet to be answered: A) What is the general difference between signal emitting and receiving in a protein interactome? B) Which proteins are among the top ranked in directional ranking? C) Are high ranked proteins more evolutionarily conserved than low ranked ones? D) Do proteins with similar ranking tend to have similar subcellular locations? In this study, we address these questions using the forward, reverse, and non-directional PageRank approaches to rank an information-directional network of human proteins and study their evolutionary conservation. The forward ranking gives credit to information receivers, reverse ranking to information emitters, and non-directional ranking mainly to the number of interactions. The protein lists generated by the forward and non-directional rankings are highly correlated, but those by the reverse and non-directional rankings are not. The results suggest that the signal emitting/receiving system is characterized by key-emittings and relatively even receivings in the human protein interactome. Signaling pathway proteins are frequent in top ranked ones. Eight proteins are both informational top emitters and top receivers. Top ranked proteins, except a few species-related novel-function ones, are evolutionarily well conserved. Protein-subunit ranking position reflects subunit function. These results demonstrate the usefulness of different PageRank approaches in characterizing protein networks and provide insights to protein interaction in the cell. PMID:23028653

Automatic face naming by learning discriminative affinity matrices from weakly labeled images.

PubMed

Xiao, Shijie; Xu, Dong; Wu, Jianxin

2015-10-01

Given a collection of images, where each image contains several faces and is associated with a few names in the corresponding caption, the goal of face naming is to infer the correct name for each face. In this paper, we propose two new methods to effectively solve this problem by learning two discriminative affinity matrices from these weakly labeled images. We first propose a new method called regularized low-rank representation by effectively utilizing weakly supervised information to learn a low-rank reconstruction coefficient matrix while exploring multiple subspace structures of the data. Specifically, by introducing a specially designed regularizer to the low-rank representation method, we penalize the corresponding reconstruction coefficients related to the situations where a face is reconstructed by using face images from other subjects or by using itself. With the inferred reconstruction coefficient matrix, a discriminative affinity matrix can be obtained. Moreover, we also develop a new distance metric learning method called ambiguously supervised structural metric learning by using weakly supervised information to seek a discriminative distance metric. Hence, another discriminative affinity matrix can be obtained using the similarity matrix (i.e., the kernel matrix) based on the Mahalanobis distances of the data. Observing that these two affinity matrices contain complementary information, we further combine them to obtain a fused affinity matrix, based on which we develop a new iterative scheme to infer the name of each face. Comprehensive experiments demonstrate the effectiveness of our approach.

Vps35 loss promotes hyperresorptive osteoclastogenesis and osteoporosis via sustained RANKL signaling

PubMed Central

Xia, Wen-Fang; Tang, Fu-Lei; Xiong, Lei; Xiong, Shan; Jung, Ji-Ung; Lee, Dae-Hoon; Li, Xing-Sheng; Feng, Xu; Mei, Lin

2013-01-01

Receptor activator of NF-κB (RANK) plays a critical role in osteoclastogenesis, an essential process for the initiation of bone remodeling to maintain healthy bone mass and structure. Although the signaling and function of RANK have been investigated extensively, much less is known about the negative regulatory mechanisms of its signaling. We demonstrate in this paper that RANK trafficking, signaling, and function are regulated by VPS35, a major component of the retromer essential for selective endosome to Golgi retrieval of membrane proteins. VPS35 loss of function altered RANK ligand (RANKL)–induced RANK distribution, enhanced RANKL sensitivity, sustained RANKL signaling, and increased hyperresorptive osteoclast (OC) formation. Hemizygous deletion of the Vps35 gene in mice promoted hyperresorptive osteoclastogenesis, decreased bone formation, and caused a subsequent osteoporotic deficit, including decreased trabecular bone volumes and reduced trabecular thickness and density in long bones. These results indicate that VPS35 critically deregulates RANK signaling, thus restraining increased formation of hyperresorptive OCs and preventing osteoporotic deficits. PMID:23509071

Automatically finding relevant citations for clinical guideline development.

PubMed

Bui, Duy Duc An; Jonnalagadda, Siddhartha; Del Fiol, Guilherme

2015-10-01

Literature database search is a crucial step in the development of clinical practice guidelines and systematic reviews. In the age of information technology, the process of literature search is still conducted manually, therefore it is costly, slow and subject to human errors. In this research, we sought to improve the traditional search approach using innovative query expansion and citation ranking approaches. We developed a citation retrieval system composed of query expansion and citation ranking methods. The methods are unsupervised and easily integrated over the PubMed search engine. To validate the system, we developed a gold standard consisting of citations that were systematically searched and screened to support the development of cardiovascular clinical practice guidelines. The expansion and ranking methods were evaluated separately and compared with baseline approaches. Compared with the baseline PubMed expansion, the query expansion algorithm improved recall (80.2% vs. 51.5%) with small loss on precision (0.4% vs. 0.6%). The algorithm could find all citations used to support a larger number of guideline recommendations than the baseline approach (64.5% vs. 37.2%, p<0.001). In addition, the citation ranking approach performed better than PubMed's "most recent" ranking (average precision +6.5%, recall@k +21.1%, p<0.001), PubMed's rank by "relevance" (average precision +6.1%, recall@k +14.8%, p<0.001), and the machine learning classifier that identifies scientifically sound studies from MEDLINE citations (average precision +4.9%, recall@k +4.2%, p<0.001). Our unsupervised query expansion and ranking techniques are more flexible and effective than PubMed's default search engine behavior and the machine learning classifier. Automated citation finding is promising to augment the traditional literature search. Copyright © 2015 Elsevier Inc. All rights reserved.

Finding Important Terms for Patients in Their Electronic Health Records: A Learning-to-Rank Approach Using Expert Annotations

PubMed Central

Zheng, Jiaping; Yu, Hong

2016-01-01

Background Many health organizations allow patients to access their own electronic health record (EHR) notes through online patient portals as a way to enhance patient-centered care. However, EHR notes are typically long and contain abundant medical jargon that can be difficult for patients to understand. In addition, many medical terms in patients’ notes are not directly related to their health care needs. One way to help patients better comprehend their own notes is to reduce information overload and help them focus on medical terms that matter most to them. Interventions can then be developed by giving them targeted education to improve their EHR comprehension and the quality of care. Objective We aimed to develop a supervised natural language processing (NLP) system called Finding impOrtant medical Concepts most Useful to patientS (FOCUS) that automatically identifies and ranks medical terms in EHR notes based on their importance to the patients. Methods First, we built an expert-annotated corpus. For each EHR note, 2 physicians independently identified medical terms important to the patient. Using the physicians’ agreement as the gold standard, we developed and evaluated FOCUS. FOCUS first identifies candidate terms from each EHR note using MetaMap and then ranks the terms using a support vector machine-based learn-to-rank algorithm. We explored rich learning features, including distributed word representation, Unified Medical Language System semantic type, topic features, and features derived from consumer health vocabulary. We compared FOCUS with 2 strong baseline NLP systems. Results Physicians annotated 90 EHR notes and identified a mean of 9 (SD 5) important terms per note. The Cohen’s kappa annotation agreement was .51. The 10-fold cross-validation results show that FOCUS achieved an area under the receiver operating characteristic curve (AUC-ROC) of 0.940 for ranking candidate terms from EHR notes to identify important terms. When including term identification, the performance of FOCUS for identifying important terms from EHR notes was 0.866 AUC-ROC. Both performance scores significantly exceeded the corresponding baseline system scores (P<.001). Rich learning features contributed to FOCUS’s performance substantially. Conclusions FOCUS can automatically rank terms from EHR notes based on their importance to patients. It may help develop future interventions that improve quality of care. PMID:27903489

Finding Important Terms for Patients in Their Electronic Health Records: A Learning-to-Rank Approach Using Expert Annotations.

PubMed

Chen, Jinying; Zheng, Jiaping; Yu, Hong

2016-11-30

Many health organizations allow patients to access their own electronic health record (EHR) notes through online patient portals as a way to enhance patient-centered care. However, EHR notes are typically long and contain abundant medical jargon that can be difficult for patients to understand. In addition, many medical terms in patients' notes are not directly related to their health care needs. One way to help patients better comprehend their own notes is to reduce information overload and help them focus on medical terms that matter most to them. Interventions can then be developed by giving them targeted education to improve their EHR comprehension and the quality of care. We aimed to develop a supervised natural language processing (NLP) system called Finding impOrtant medical Concepts most Useful to patientS (FOCUS) that automatically identifies and ranks medical terms in EHR notes based on their importance to the patients. First, we built an expert-annotated corpus. For each EHR note, 2 physicians independently identified medical terms important to the patient. Using the physicians' agreement as the gold standard, we developed and evaluated FOCUS. FOCUS first identifies candidate terms from each EHR note using MetaMap and then ranks the terms using a support vector machine-based learn-to-rank algorithm. We explored rich learning features, including distributed word representation, Unified Medical Language System semantic type, topic features, and features derived from consumer health vocabulary. We compared FOCUS with 2 strong baseline NLP systems. Physicians annotated 90 EHR notes and identified a mean of 9 (SD 5) important terms per note. The Cohen's kappa annotation agreement was .51. The 10-fold cross-validation results show that FOCUS achieved an area under the receiver operating characteristic curve (AUC-ROC) of 0.940 for ranking candidate terms from EHR notes to identify important terms. When including term identification, the performance of FOCUS for identifying important terms from EHR notes was 0.866 AUC-ROC. Both performance scores significantly exceeded the corresponding baseline system scores (P<.001). Rich learning features contributed to FOCUS's performance substantially. FOCUS can automatically rank terms from EHR notes based on their importance to patients. It may help develop future interventions that improve quality of care. ©Jinying Chen, Jiaping Zheng, Hong Yu. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 30.11.2016.

Resiliency and collateral learning in science in some students of cree ancestry

NASA Astrophysics Data System (ADS)

Sutherland, Dawn

2005-07-01

In the context of schooling, resiliency refers to the ability to thrive academically despite adverse circumstances. In this study the relationship between academic resilience and student's collateral learning is explored in 20 students of Cree ancestry. The individual resilience of each student was examined by identifying protective factors for school leaving within the microsystem of each student's ecological framework. Student responses to questions related to motivation and engagement were ranked. In addition, students' perception of the influence of family and peers on individual attributes toward schooling was ranked.To gain insight into the collateral learning aspects of science learning in Cree students, the participants in this study were asked to reflect on their learning strategies through the use of critical incidents. The relationship between collateral learning and resiliency was also explored.This study found that students possessing a greater number of protective factors were more likely to learn science in a way described by Jegede's collateral learning theory. Responses to critical incidents indicate some Cree students hold at least two sources of knowledge to explain some science concepts and therefore may adopt a collateral learning strategy. The importance these students place on earned or experiential knowledge is evident in the interviews. Some suggestions for classroom instruction are offered in conclusion.

Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm.

PubMed

Lu, Canyi; Tang, Jinhui; Yan, Shuicheng; Lin, Zhouchen

2016-02-01

The nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing. However, solving the nuclear norm-based relaxed convex problem usually leads to a suboptimal solution of the original rank minimization problem. In this paper, we propose to use a family of nonconvex surrogates of L0-norm on the singular values of a matrix to approximate the rank function. This leads to a nonconvex nonsmooth minimization problem. Then, we propose to solve the problem by an iteratively re-weighted nuclear norm (IRNN) algorithm. IRNN iteratively solves a weighted singular value thresholding problem, which has a closed form solution due to the special properties of the nonconvex surrogate functions. We also extend IRNN to solve the nonconvex problem with two or more blocks of variables. In theory, we prove that the IRNN decreases the objective function value monotonically, and any limit point is a stationary point. Extensive experiments on both synthesized data and real images demonstrate that IRNN enhances the low rank matrix recovery compared with the state-of-the-art convex algorithms.

Student perceptions of gamified audience response system interactions in large group lectures and via lecture capture technology.

PubMed

Pettit, Robin K; McCoy, Lise; Kinney, Marjorie; Schwartz, Frederic N

2015-05-22

Higher education students have positive attitudes about the use of audience response systems (ARS), but even technology-enhanced lessons can become tiresome if the pedagogical approach is exactly the same with each implementation. Gamification is the notion that gaming mechanics can be applied to routine activities. In this study, TurningPoint (TP) ARS interactions were gamified and implemented in 22 large group medical microbiology lectures throughout an integrated year 1 osteopathic medical school curriculum. A 32-item questionnaire was used to measure students' perceptions of the gamified TP interactions at the end of their first year. The survey instrument generated both Likert scale and open-ended response data that addressed game design and variety, engagement and learning features, use of TP questions after class, and any value of lecture capture technology for reviewing these interactive presentations. The Chi Square Test was used to analyze grouped responses to Likert scale questions. Responses to open-ended prompts were categorized using open-coding. Ninety-one students out of 106 (86 %) responded to the survey. A significant majority of the respondents agreed or strongly agreed that the games were engaging, and an effective learning tool. The questionnaire investigated the degree to which specific features of these interactions were engaging (nine items) and promoted learning (seven items). The most highly ranked engagement aspects were peer competition and focus on the activity (tied for highest ranking), and the most highly ranked learning aspect was applying theoretical knowledge to clinical scenarios. Another notable item was the variety of interactions, which ranked in the top three in both the engagement and learning categories. Open-ended comments shed light on how students use TP questions for exam preparation, and revealed engaging and non-engaging attributes of these interactive sessions for students who review them via lecture capture. Students clearly valued the engagement and learning aspects of gamified TP interactions. The overwhelming majority of students surveyed in this study were engaged by the variety of TP games, and gained an interest in microbiology. The methods described in this study may be useful for other educators wishing to expand the utility of ARS in their classrooms.

A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.

PubMed

Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang

2016-04-01

Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.

Going the Distance in Academic Libraries: Identifying Trends and Innovation in Distance Learning Resources and Services

ERIC Educational Resources Information Center

Nielsen, Jordan

2014-01-01

In 2012, "U.S. News & World Report" ranked nineteen institutions on its Up-and-Coming national universities list. The universities were put on the list based on rankings from experts in higher education administration. The experts were asked to identify institutions that had implemented innovative ideas in the areas of academics,…

76 FR 36608 - Self-Regulatory Organizations; NYSE Arca, Inc.; Order Granting Approval of Proposed Rule Change...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-22

.... This model will enable the Sub-Adviser to evaluate, rank, and select the appropriate mix of investments... becoming, risky. The Sub-Adviser will use a quantitative metric to rank and select the appropriate mix of... imposes a duty of due diligence on its Equity Trading Permit Holders to learn the essential facts relating...

Online Learning Policy and Practice Survey: A Survey of the States

ERIC Educational Resources Information Center

Center for Digital Education, 2008

2008-01-01

In 2008, the Center for Digital Education (CDE) conducted a review of state policy and programs to determine the status of online learning policy and practice across the United States. CDE interviewed state education officials across the nation to evaluate the overall landscape of online learning. The rankings reflect the vision, policies,…

Gamification of Learning and Teaching in Schools--A Critical Stance

ERIC Educational Resources Information Center

Buck, Marc Fabian

2017-01-01

The ongoing transformation of learning and teaching is one facet of the progressing digitalization of all aspects of life. Gamification's aim is to change learning for the better by making use of the motivating effects of (digital) games and elements typical of games, like experience points, levelling, quests, rankings etc. Especially in the light…

Assessment of Learning Outcomes in Higher Education: A Comparative Review of Selected Practices. OECD Education Working Papers, No. 15

ERIC Educational Resources Information Center

Nusche, Deborah

2008-01-01

Higher education institutions (HEIs) have experienced increasing pressures to provide accountability data and consumer information on the quality of teaching and learning. Existing ratings and rankings of HEIs tend to neglect information on student learning outcomes. Instead, they focus on inputs, activities and research outputs, such as resources…

Walking and talking the tree of life: Why and how to teach about biodiversity.

PubMed

Ballen, Cissy J; Greene, Harry W

2017-03-01

Taxonomic details of diversity are an essential scaffolding for biology education, yet outdated methods for teaching the tree of life (TOL), as implied by textbook content and usage, are still commonly employed. Here, we show that the traditional approach only vaguely represents evolutionary relationships, fails to denote major events in the history of life, and relies heavily on memorizing near-meaningless taxonomic ranks. Conversely, a clade-based strategy-focused on common ancestry, monophyletic groups, and derived functional traits-is explicitly based on Darwin's "descent with modification," provides students with a rational system for organizing the details of biodiversity, and readily lends itself to active learning techniques. We advocate for a phylogenetic classification that mirrors the TOL, a pedagogical format of increasingly complex but always hierarchical presentations, and the adoption of active learning technologies and tactics.

CAFÉ-Map: Context Aware Feature Mapping for mining high dimensional biomedical data.

PubMed

Minhas, Fayyaz Ul Amir Afsar; Asif, Amina; Arif, Muhammad

2016-12-01

Feature selection and ranking is of great importance in the analysis of biomedical data. In addition to reducing the number of features used in classification or other machine learning tasks, it allows us to extract meaningful biological and medical information from a machine learning model. Most existing approaches in this domain do not directly model the fact that the relative importance of features can be different in different regions of the feature space. In this work, we present a context aware feature ranking algorithm called CAFÉ-Map. CAFÉ-Map is a locally linear feature ranking framework that allows recognition of important features in any given region of the feature space or for any individual example. This allows for simultaneous classification and feature ranking in an interpretable manner. We have benchmarked CAFÉ-Map on a number of toy and real world biomedical data sets. Our comparative study with a number of published methods shows that CAFÉ-Map achieves better accuracies on these data sets. The top ranking features obtained through CAFÉ-Map in a gene profiling study correlate very well with the importance of different genes reported in the literature. Furthermore, CAFÉ-Map provides a more in-depth analysis of feature ranking at the level of individual examples. CAFÉ-Map Python code is available at: http://faculty.pieas.edu.pk/fayyaz/software.html#cafemap . The CAFÉ-Map package supports parallelization and sparse data and provides example scripts for classification. This code can be used to reconstruct the results given in this paper. Copyright © 2016 Elsevier Ltd. All rights reserved.

Concurrent Validity Between a Shared Curriculum, the Internal Medicine In-Training Examination, and the American Board of Internal Medicine Certifying Examination

PubMed Central

Sisson, Stephen D.; Bertram, Amanda; Yeh, Hsin-Chieh

2015-01-01

Background A core objective of residency education is to facilitate learning, and programs need more curricula and assessment tools with demonstrated validity evidence. Objective We sought to demonstrate concurrent validity between performance on a widely shared, ambulatory curriculum (the Johns Hopkins Internal Medicine Curriculum), the Internal Medicine In-Training Examination (IM-ITE), and the American Board of Internal Medicine Certifying Examination (ABIM-CE). Methods A cohort study of 443 postgraduate year (PGY)-3 residents at 22 academic and community hospital internal medicine residency programs using the curriculum through the Johns Hopkins Internet Learning Center (ILC). Total and percentile rank scores on ILC didactic modules were compared with total and percentile rank scores on the IM-ITE and total scores on the ABIM-CE. Results The average score on didactic modules was 80.1%; the percentile rank was 53.8. The average IM-ITE score was 64.1% with a percentile rank of 54.8. The average score on the ABIM-CE was 464. Scores on the didactic modules, IM-ITE, and ABIM-CE correlated with each other (P < .05). Residents completing greater numbers of didactic modules, regardless of scores, had higher IM-ITE total and percentile rank scores (P < .05). Resident performance on modules covering back pain, hypertension, preoperative evaluation, and upper respiratory tract infection was associated with IM-ITE percentile rank. Conclusions Performance on a widely shared ambulatory curriculum is associated with performance on the IM-ITE and the ABIM-CE. PMID:26217421

Designing the Group Use Videodisc: Socializing Communication Technology.

ERIC Educational Resources Information Center

Acker, Stephen R.; Gordon, Joan M.

1987-01-01

Indicates that students were favorably impressed with their videodisc learning experience, though the process of reaching consensus seemed to require the re-ordering of individual rankings. Discusses the relationships between design strategy, student interaction in the learning process, and funding educational technology. (JD)

Basis Expansion Approaches for Regularized Sequential Dictionary Learning Algorithms With Enforced Sparsity for fMRI Data Analysis.

PubMed

Seghouane, Abd-Krim; Iqbal, Asif

2017-09-01

Sequential dictionary learning algorithms have been successfully applied to functional magnetic resonance imaging (fMRI) data analysis. fMRI data sets are, however, structured data matrices with the notions of temporal smoothness in the column direction. This prior information, which can be converted into a constraint of smoothness on the learned dictionary atoms, has seldomly been included in classical dictionary learning algorithms when applied to fMRI data analysis. In this paper, we tackle this problem by proposing two new sequential dictionary learning algorithms dedicated to fMRI data analysis by accounting for this prior information. These algorithms differ from the existing ones in their dictionary update stage. The steps of this stage are derived as a variant of the power method for computing the SVD. The proposed algorithms generate regularized dictionary atoms via the solution of a left regularized rank-one matrix approximation problem where temporal smoothness is enforced via regularization through basis expansion and sparse basis expansion in the dictionary update stage. Applications on synthetic data experiments and real fMRI data sets illustrating the performance of the proposed algorithms are provided.

Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals

DOE PAGES

Rai, Prashant; Sargsyan, Khachik; Najm, Habib N.

2018-03-20

A new method for fast evaluation of high dimensional integrals arising in quantum mechanics is proposed. Here, the method is based on sparse approximation of a high dimensional function followed by a low-rank compression. In the first step, we interpret the high dimensional integrand as a tensor in a suitable tensor product space and determine its entries by a compressed sensing based algorithm using only a few function evaluations. Secondly, we implement a rank reduction strategy to compress this tensor in a suitable low-rank tensor format using standard tensor compression tools. This allows representing a high dimensional integrand function asmore » a small sum of products of low dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate this low-rank representation, thus alleviating the curse of dimensionality. Finally, numerical tests on synthetic functions, as well as on energy correction integrals for water and formaldehyde molecules demonstrate the efficiency of this method using very few function evaluations as compared to other integration strategies.« less

Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rai, Prashant; Sargsyan, Khachik; Najm, Habib N.

A new method for fast evaluation of high dimensional integrals arising in quantum mechanics is proposed. Here, the method is based on sparse approximation of a high dimensional function followed by a low-rank compression. In the first step, we interpret the high dimensional integrand as a tensor in a suitable tensor product space and determine its entries by a compressed sensing based algorithm using only a few function evaluations. Secondly, we implement a rank reduction strategy to compress this tensor in a suitable low-rank tensor format using standard tensor compression tools. This allows representing a high dimensional integrand function asmore » a small sum of products of low dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate this low-rank representation, thus alleviating the curse of dimensionality. Finally, numerical tests on synthetic functions, as well as on energy correction integrals for water and formaldehyde molecules demonstrate the efficiency of this method using very few function evaluations as compared to other integration strategies.« less

Asynchronous Gossip for Averaging and Spectral Ranking

NASA Astrophysics Data System (ADS)

Borkar, Vivek S.; Makhijani, Rahul; Sundaresan, Rajesh

2014-08-01

We consider two variants of the classical gossip algorithm. The first variant is a version of asynchronous stochastic approximation. We highlight a fundamental difficulty associated with the classical asynchronous gossip scheme, viz., that it may not converge to a desired average, and suggest an alternative scheme based on reinforcement learning that has guaranteed convergence to the desired average. We then discuss a potential application to a wireless network setting with simultaneous link activation constraints. The second variant is a gossip algorithm for distributed computation of the Perron-Frobenius eigenvector of a nonnegative matrix. While the first variant draws upon a reinforcement learning algorithm for an average cost controlled Markov decision problem, the second variant draws upon a reinforcement learning algorithm for risk-sensitive control. We then discuss potential applications of the second variant to ranking schemes, reputation networks, and principal component analysis.

Relaxations to Sparse Optimization Problems and Applications

NASA Astrophysics Data System (ADS)

Skau, Erik West

Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we apply a maximum entropy model, guided by the social media data, to estimate the flooded regions during a 2013 flood in Boulder, CO and show that the results are comparable to those obtained using expert information.

Fast Low-Rank Shared Dictionary Learning for Image Classification.

PubMed

Tiep Huu Vu; Monga, Vishal

2017-11-01

Despite the fact that different objects possess distinct class-specific features, they also usually share common patterns. This observation has been exploited partially in a recently proposed dictionary learning framework by separating the particularity and the commonality (COPAR). Inspired by this, we propose a novel method to explicitly and simultaneously learn a set of common patterns as well as class-specific features for classification with more intuitive constraints. Our dictionary learning framework is hence characterized by both a shared dictionary and particular (class-specific) dictionaries. For the shared dictionary, we enforce a low-rank constraint, i.e., claim that its spanning subspace should have low dimension and the coefficients corresponding to this dictionary should be similar. For the particular dictionaries, we impose on them the well-known constraints stated in the Fisher discrimination dictionary learning (FDDL). Furthermore, we develop new fast and accurate algorithms to solve the subproblems in the learning step, accelerating its convergence. The said algorithms could also be applied to FDDL and its extensions. The efficiencies of these algorithms are theoretically and experimentally verified by comparing their complexities and running time with those of other well-known dictionary learning methods. Experimental results on widely used image data sets establish the advantages of our method over the state-of-the-art dictionary learning methods.

The effects of age, rank and neophobia on social learning in horses.

PubMed

Krueger, Konstanze; Farmer, Kate; Heinze, Jürgen

2014-05-01

Social learning is said to meet the demands of complex environments in which individuals compete over resources and cooperate to share resources. Horses (Equus caballus) were thought to lack social learning skills because they feed on homogenously distributed resources with few reasons for conflict. However, the horse's social environment is complex, which raises the possibility that its capacity for social transfer of feeding behaviour has been underestimated. We conducted a social learning experiment using 30 socially kept horses of different ages. Five horses, one from each group, were chosen as demonstrators, and the remaining 25 horses were designated observers. Observers from each group were allowed to watch their group demonstrator opening a feeding apparatus. We found that young, low-ranking and more exploratory horses learned by observing older members of their own group, and the older the horse, the more slowly it appeared to learn. Social learning may be an adaptive specialisation to the social environment. Older animals may avoid the potential costs of acquiring complex and potentially disadvantageous feeding behaviours from younger group members. We argue that horses show social learning in the context of their social ecology and that research procedures must take such contexts into account. Misconceptions about the horse's sociality may have hampered earlier studies.

Fast Low-Rank Shared Dictionary Learning for Image Classification

NASA Astrophysics Data System (ADS)

Vu, Tiep Huu; Monga, Vishal

2017-11-01

Despite the fact that different objects possess distinct class-specific features, they also usually share common patterns. This observation has been exploited partially in a recently proposed dictionary learning framework by separating the particularity and the commonality (COPAR). Inspired by this, we propose a novel method to explicitly and simultaneously learn a set of common patterns as well as class-specific features for classification with more intuitive constraints. Our dictionary learning framework is hence characterized by both a shared dictionary and particular (class-specific) dictionaries. For the shared dictionary, we enforce a low-rank constraint, i.e. claim that its spanning subspace should have low dimension and the coefficients corresponding to this dictionary should be similar. For the particular dictionaries, we impose on them the well-known constraints stated in the Fisher discrimination dictionary learning (FDDL). Further, we develop new fast and accurate algorithms to solve the subproblems in the learning step, accelerating its convergence. The said algorithms could also be applied to FDDL and its extensions. The efficiencies of these algorithms are theoretically and experimentally verified by comparing their complexities and running time with those of other well-known dictionary learning methods. Experimental results on widely used image datasets establish the advantages of our method over state-of-the-art dictionary learning methods.

Random forests on Hadoop for genome-wide association studies of multivariate neuroimaging phenotypes

PubMed Central

2013-01-01

Motivation Multivariate quantitative traits arise naturally in recent neuroimaging genetics studies, in which both structural and functional variability of the human brain is measured non-invasively through techniques such as magnetic resonance imaging (MRI). There is growing interest in detecting genetic variants associated with such multivariate traits, especially in genome-wide studies. Random forests (RFs) classifiers, which are ensembles of decision trees, are amongst the best performing machine learning algorithms and have been successfully employed for the prioritisation of genetic variants in case-control studies. RFs can also be applied to produce gene rankings in association studies with multivariate quantitative traits, and to estimate genetic similarities measures that are predictive of the trait. However, in studies involving hundreds of thousands of SNPs and high-dimensional traits, a very large ensemble of trees must be inferred from the data in order to obtain reliable rankings, which makes the application of these algorithms computationally prohibitive. Results We have developed a parallel version of the RF algorithm for regression and genetic similarity learning tasks in large-scale population genetic association studies involving multivariate traits, called PaRFR (Parallel Random Forest Regression). Our implementation takes advantage of the MapReduce programming model and is deployed on Hadoop, an open-source software framework that supports data-intensive distributed applications. Notable speed-ups are obtained by introducing a distance-based criterion for node splitting in the tree estimation process. PaRFR has been applied to a genome-wide association study on Alzheimer's disease (AD) in which the quantitative trait consists of a high-dimensional neuroimaging phenotype describing longitudinal changes in the human brain structure. PaRFR provides a ranking of SNPs associated to this trait, and produces pair-wise measures of genetic proximity that can be directly compared to pair-wise measures of phenotypic proximity. Several known AD-related variants have been identified, including APOE4 and TOMM40. We also present experimental evidence supporting the hypothesis of a linear relationship between the number of top-ranked mutated states, or frequent mutation patterns, and an indicator of disease severity. Availability The Java codes are freely available at http://www2.imperial.ac.uk/~gmontana. PMID:24564704

Random forests on Hadoop for genome-wide association studies of multivariate neuroimaging phenotypes.

PubMed

Wang, Yue; Goh, Wilson; Wong, Limsoon; Montana, Giovanni

2013-01-01

Multivariate quantitative traits arise naturally in recent neuroimaging genetics studies, in which both structural and functional variability of the human brain is measured non-invasively through techniques such as magnetic resonance imaging (MRI). There is growing interest in detecting genetic variants associated with such multivariate traits, especially in genome-wide studies. Random forests (RFs) classifiers, which are ensembles of decision trees, are amongst the best performing machine learning algorithms and have been successfully employed for the prioritisation of genetic variants in case-control studies. RFs can also be applied to produce gene rankings in association studies with multivariate quantitative traits, and to estimate genetic similarities measures that are predictive of the trait. However, in studies involving hundreds of thousands of SNPs and high-dimensional traits, a very large ensemble of trees must be inferred from the data in order to obtain reliable rankings, which makes the application of these algorithms computationally prohibitive. We have developed a parallel version of the RF algorithm for regression and genetic similarity learning tasks in large-scale population genetic association studies involving multivariate traits, called PaRFR (Parallel Random Forest Regression). Our implementation takes advantage of the MapReduce programming model and is deployed on Hadoop, an open-source software framework that supports data-intensive distributed applications. Notable speed-ups are obtained by introducing a distance-based criterion for node splitting in the tree estimation process. PaRFR has been applied to a genome-wide association study on Alzheimer's disease (AD) in which the quantitative trait consists of a high-dimensional neuroimaging phenotype describing longitudinal changes in the human brain structure. PaRFR provides a ranking of SNPs associated to this trait, and produces pair-wise measures of genetic proximity that can be directly compared to pair-wise measures of phenotypic proximity. Several known AD-related variants have been identified, including APOE4 and TOMM40. We also present experimental evidence supporting the hypothesis of a linear relationship between the number of top-ranked mutated states, or frequent mutation patterns, and an indicator of disease severity. The Java codes are freely available at http://www2.imperial.ac.uk/~gmontana.

Oversampling the Minority Class in the Feature Space.

PubMed

Perez-Ortiz, Maria; Gutierrez, Pedro Antonio; Tino, Peter; Hervas-Martinez, Cesar

2016-09-01

The imbalanced nature of some real-world data is one of the current challenges for machine learning researchers. One common approach oversamples the minority class through convex combination of its patterns. We explore the general idea of synthetic oversampling in the feature space induced by a kernel function (as opposed to input space). If the kernel function matches the underlying problem, the classes will be linearly separable and synthetically generated patterns will lie on the minority class region. Since the feature space is not directly accessible, we use the empirical feature space (EFS) (a Euclidean space isomorphic to the feature space) for oversampling purposes. The proposed method is framed in the context of support vector machines, where the imbalanced data sets can pose a serious hindrance. The idea is investigated in three scenarios: 1) oversampling in the full and reduced-rank EFSs; 2) a kernel learning technique maximizing the data class separation to study the influence of the feature space structure (implicitly defined by the kernel function); and 3) a unified framework for preferential oversampling that spans some of the previous approaches in the literature. We support our investigation with extensive experiments over 50 imbalanced data sets.

Methods for evaluating and ranking transportation energy conservation programs

NASA Astrophysics Data System (ADS)

Santone, L. C.

1981-04-01

The energy conservation programs are assessed in terms of petroleum savings, incremental costs to consumers probability of technical and market success, and external impacts due to environmental, economic, and social factors. Three ranking functions and a policy matrix are used to evaluate the programs. The net present value measure which computes the present worth of petroleum savings less the present worth of costs is modified by dividing by the present value of DOE funding to obtain a net present value per program dollar. The comprehensive ranking function takes external impacts into account. Procedures are described for making computations of the ranking functions and the attributes that require computation. Computations are made for the electric vehicle, Stirling engine, gas turbine, and MPG mileage guide program.

Missing Modality Transfer Learning via Latent Low-Rank Constraint.

PubMed

Ding, Zhengming; Shao, Ming; Fu, Yun

2015-11-01

Transfer learning is usually exploited to leverage previously well-learned source domain for evaluating the unknown target domain; however, it may fail if no target data are available in the training stage. This problem arises when the data are multi-modal. For example, the target domain is in one modality, while the source domain is in another. To overcome this, we first borrow an auxiliary database with complete modalities, then consider knowledge transfer across databases and across modalities within databases simultaneously in a unified framework. The contributions are threefold: 1) a latent factor is introduced to uncover the underlying structure of the missing modality from the known data; 2) transfer learning in two directions allows the data alignment between both modalities and databases, giving rise to a very promising recovery; and 3) an efficient solution with theoretical guarantees to the proposed latent low-rank transfer learning algorithm. Comprehensive experiments on multi-modal knowledge transfer with missing target modality verify that our method can successfully inherit knowledge from both auxiliary database and source modality, and therefore significantly improve the recognition performance even when test modality is inaccessible in the training stage.

7 CFR 1735.30 - Hardship loans.

Code of Federal Regulations, 2012 CFR

2012-01-01

... be used by the Administrator to rank, from high to low, applications that have been determined to.... (v) Distance Learning and Medical Link Facilities. Borrowers will receive 2 points for loan funds included in the application for the purpose of providing distance learning or medical link transmission...

7 CFR 1735.30 - Hardship loans.

Code of Federal Regulations, 2014 CFR

2014-01-01

... be used by the Administrator to rank, from high to low, applications that have been determined to.... (v) Distance Learning and Medical Link Facilities. Borrowers will receive 2 points for loan funds included in the application for the purpose of providing distance learning or medical link transmission...

7 CFR 1735.30 - Hardship loans.

Code of Federal Regulations, 2011 CFR

2011-01-01

... be used by the Administrator to rank, from high to low, applications that have been determined to.... (v) Distance Learning and Medical Link Facilities. Borrowers will receive 2 points for loan funds included in the application for the purpose of providing distance learning or medical link transmission...

7 CFR 1735.30 - Hardship loans.

Code of Federal Regulations, 2013 CFR

2013-01-01

... be used by the Administrator to rank, from high to low, applications that have been determined to.... (v) Distance Learning and Medical Link Facilities. Borrowers will receive 2 points for loan funds included in the application for the purpose of providing distance learning or medical link transmission...

7 CFR 1735.30 - Hardship loans.

Code of Federal Regulations, 2010 CFR

2010-01-01

... be used by the Administrator to rank, from high to low, applications that have been determined to.... (v) Distance Learning and Medical Link Facilities. Borrowers will receive 2 points for loan funds included in the application for the purpose of providing distance learning or medical link transmission...

A Delphi-Based Approach for Detecting Key E-Learning Trends in Postgraduate Education: The Spanish Case

ERIC Educational Resources Information Center

Lopez-Catalan, Blanca; Bañuls, Victor A.

2017-01-01

Purpose: The purpose of this paper is to present the results of national level Delphi study carried out in Spain aimed at providing inputs for higher education administrators and decision makers about key e-learning trends for supporting postgraduate courses. Design/methodology/approach: The ranking of the e-learning trends is based on a…

Implementation of Real-World Experiential Learning in a Food Science Course Using a Food Industry-Integrated Approach

ERIC Educational Resources Information Center

Hollis, Francine H.; Eren, Fulya

2016-01-01

Success skills have been ranked as the most important core competency for new food science professionals to have by food science graduates and their employers. It is imperative that food science instructors promote active learning in food science courses through experiential learning activities to enhance student success skills such as oral and…

Student Perceptions of Online Homework Use for Formative Assessment of Learning in Organic Chemistry

ERIC Educational Resources Information Center

Richards-Babb, Michelle; Curtis, Reagan; Georgieva, Zornitsa; Penn, John H.

2015-01-01

Use of online homework as a formative assessment tool for organic chemistry coursework was examined. Student perceptions of online homework in terms of (i) its ranking relative to other course aspects, (ii) their learning of organic chemistry, and (iii) whether it improved their study habits and how students used it as a learning tool were…

Enhanced Student Learning in Accounting Utilising Web-Based Technology, Peer-Review Feedback and Reflective Practices: A Learning Community Approach to Assessment

ERIC Educational Resources Information Center

Taylor, Sue; Ryan, Mary; Pearce, Jon

2015-01-01

Higher education is becoming a major driver of economic competitiveness in an increasingly knowledge-driven global economy. Maintaining the competitive edge has seen an increase in public accountability of higher education institutions through the mechanism of ranking universities based on the quality of their teaching and learning outcomes. As a…

SWIFT-Review: a text-mining workbench for systematic review.

PubMed

Howard, Brian E; Phillips, Jason; Miller, Kyle; Tandon, Arpit; Mav, Deepak; Shah, Mihir R; Holmgren, Stephanie; Pelch, Katherine E; Walker, Vickie; Rooney, Andrew A; Macleod, Malcolm; Shah, Ruchir R; Thayer, Kristina

2016-05-23

There is growing interest in using machine learning approaches to priority rank studies and reduce human burden in screening literature when conducting systematic reviews. In addition, identifying addressable questions during the problem formulation phase of systematic review can be challenging, especially for topics having a large literature base. Here, we assess the performance of the SWIFT-Review priority ranking algorithm for identifying studies relevant to a given research question. We also explore the use of SWIFT-Review during problem formulation to identify, categorize, and visualize research areas that are data rich/data poor within a large literature corpus. Twenty case studies, including 15 public data sets, representing a range of complexity and size, were used to assess the priority ranking performance of SWIFT-Review. For each study, seed sets of manually annotated included and excluded titles and abstracts were used for machine training. The remaining references were then ranked for relevance using an algorithm that considers term frequency and latent Dirichlet allocation (LDA) topic modeling. This ranking was evaluated with respect to (1) the number of studies screened in order to identify 95 % of known relevant studies and (2) the "Work Saved over Sampling" (WSS) performance metric. To assess SWIFT-Review for use in problem formulation, PubMed literature search results for 171 chemicals implicated as EDCs were uploaded into SWIFT-Review (264,588 studies) and categorized based on evidence stream and health outcome. Patterns of search results were surveyed and visualized using a variety of interactive graphics. Compared with the reported performance of other tools using the same datasets, the SWIFT-Review ranking procedure obtained the highest scores on 11 out of 15 of the public datasets. Overall, these results suggest that using machine learning to triage documents for screening has the potential to save, on average, more than 50 % of the screening effort ordinarily required when using un-ordered document lists. In addition, the tagging and annotation capabilities of SWIFT-Review can be useful during the activities of scoping and problem formulation. Text-mining and machine learning software such as SWIFT-Review can be valuable tools to reduce the human screening burden and assist in problem formulation.

Trends in teachers' recommendations for changing elementary and junior-high school science programs

NASA Astrophysics Data System (ADS)

Stronck, David R.

Since 1978 many studies have called for changes in the practices of science teaching. These changes in instruction will occur only when the teachers decide to change their practices. This study uses surveys to consider the question of what were the trends in the teachers' recommendations for changes in elementary and junior-high school science programs between the years of 1978 and 1982. Large samples of teachers in British Columbia, Canada, responded anonymously to questionnaires in these years: 3040 teachers in 1978 and 1631 in 1982, with return rates ranging from 77.5% to 85%. These teachers described themselves as shifting their classroom practices toward ones that emphasize passive learning and memorization. The British Columbia Science Assessments recommend more inservice programs to stop this trend. There were very few differences in the teachers' recommendations for changes in the schools. The elementary-school teachers had major changes in their rankings of only two activities: they increased their ranking of activity-centered learning and reduced their ranking of outdoor education.

Muscle RANK is a key regulator of Ca2+ storage, SERCA activity, and function of fast-twitch skeletal muscles.

PubMed

Dufresne, Sébastien S; Dumont, Nicolas A; Boulanger-Piette, Antoine; Fajardo, Val A; Gamu, Daniel; Kake-Guena, Sandrine-Aurélie; David, Rares Ovidiu; Bouchard, Patrice; Lavergne, Éliane; Penninger, Josef M; Pape, Paul C; Tupling, A Russell; Frenette, Jérôme

2016-04-15

Receptor-activator of nuclear factor-κB (RANK), its ligand RANKL, and the soluble decoy receptor osteoprotegerin are the key regulators of osteoclast differentiation and bone remodeling. Here we show that RANK is also expressed in fully differentiated myotubes and skeletal muscle. Muscle RANK deletion has inotropic effects in denervated, but not in sham, extensor digitorum longus (EDL) muscles preventing the loss of maximum specific force while promoting muscle atrophy, fatigability, and increased proportion of fast-twitch fibers. In denervated EDL muscles, RANK deletion markedly increased stromal interaction molecule 1 content, a Ca(2+)sensor, and altered activity of the sarco(endo)plasmic reticulum Ca(2+)-ATPase (SERCA) modulating Ca(2+)storage. Muscle RANK deletion had no significant effects on the sham or denervated slow-twitch soleus muscles. These data identify a novel role for RANK as a key regulator of Ca(2+)storage and SERCA activity, ultimately affecting denervated skeletal muscle function. Copyright © 2016 the American Physiological Society.

Muscle RANK is a key regulator of Ca2+ storage, SERCA activity, and function of fast-twitch skeletal muscles

PubMed Central

Dufresne, Sébastien S.; Dumont, Nicolas A.; Boulanger-Piette, Antoine; Fajardo, Val A.; Gamu, Daniel; Kake-Guena, Sandrine-Aurélie; David, Rares Ovidiu; Bouchard, Patrice; Lavergne, Éliane; Penninger, Josef M.; Pape, Paul C.; Tupling, A. Russell

2016-01-01

Receptor-activator of nuclear factor-κB (RANK), its ligand RANKL, and the soluble decoy receptor osteoprotegerin are the key regulators of osteoclast differentiation and bone remodeling. Here we show that RANK is also expressed in fully differentiated myotubes and skeletal muscle. Muscle RANK deletion has inotropic effects in denervated, but not in sham, extensor digitorum longus (EDL) muscles preventing the loss of maximum specific force while promoting muscle atrophy, fatigability, and increased proportion of fast-twitch fibers. In denervated EDL muscles, RANK deletion markedly increased stromal interaction molecule 1 content, a Ca2+ sensor, and altered activity of the sarco(endo)plasmic reticulum Ca2+-ATPase (SERCA) modulating Ca2+ storage. Muscle RANK deletion had no significant effects on the sham or denervated slow-twitch soleus muscles. These data identify a novel role for RANK as a key regulator of Ca2+ storage and SERCA activity, ultimately affecting denervated skeletal muscle function. PMID:26825123

TCC: an R package for comparing tag count data with robust normalization strategies

PubMed Central

2013-01-01

Background Differential expression analysis based on “next-generation” sequencing technologies is a fundamental means of studying RNA expression. We recently developed a multi-step normalization method (called TbT) for two-group RNA-seq data with replicates and demonstrated that the statistical methods available in four R packages (edgeR, DESeq, baySeq, and NBPSeq) together with TbT can produce a well-ranked gene list in which true differentially expressed genes (DEGs) are top-ranked and non-DEGs are bottom ranked. However, the advantages of the current TbT method come at the cost of a huge computation time. Moreover, the R packages did not have normalization methods based on such a multi-step strategy. Results TCC (an acronym for Tag Count Comparison) is an R package that provides a series of functions for differential expression analysis of tag count data. The package incorporates multi-step normalization methods, whose strategy is to remove potential DEGs before performing the data normalization. The normalization function based on this DEG elimination strategy (DEGES) includes (i) the original TbT method based on DEGES for two-group data with or without replicates, (ii) much faster methods for two-group data with or without replicates, and (iii) methods for multi-group comparison. TCC provides a simple unified interface to perform such analyses with combinations of functions provided by edgeR, DESeq, and baySeq. Additionally, a function for generating simulation data under various conditions and alternative DEGES procedures consisting of functions in the existing packages are provided. Bioinformatics scientists can use TCC to evaluate their methods, and biologists familiar with other R packages can easily learn what is done in TCC. Conclusion DEGES in TCC is essential for accurate normalization of tag count data, especially when up- and down-regulated DEGs in one of the samples are extremely biased in their number. TCC is useful for analyzing tag count data in various scenarios ranging from unbiased to extremely biased differential expression. TCC is available at http://www.iu.a.u-tokyo.ac.jp/~kadota/TCC/ and will appear in Bioconductor (http://bioconductor.org/) from ver. 2.13. PMID:23837715

77 FR 58991 - State-Level Guarantee Fee Pricing

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-25

.../relatedservicinginfo/pdf/foreclosuretimeframes.pdf and http://www.freddiemac.com/learn/pdfs/service/exhibit83.pdf . The... Relative to the National Average Estimated Cost per day Foreclosure average Total time to relative to Rank.../guides/ssg/relatedservicinginfo/pdf/foreclosuretimeframes.pdf and http://www.freddiemac.com/learn/pdfs...

75 FR 6362 - Privacy Act of 1974; System of Records

Federal Register 2010, 2011, 2012, 2013, 2014

2010-02-09

..., Department of Defense. NM01500-9 SYSTEM NAME: Integrated Learning Environment (ILE) Classes (September 19... personal identifier number assigned to individual, pay plan/grade, rank, occupation, Unit Identification... register to take classes offered under Navy eLearning.'' AUTHORITY FOR MAINTENANCE OF THE SYSTEM: Delete...

COGNITIVE FUNCTION IN A MIDDLE AGED COHORT IS RELATED TO HIGHER QUALITY DIETARY PATTERN 5 AND 25 YEARS EARLIER: THE CARDIA STUDY

PubMed Central

ZHU, N.; JACOBS, D.R.; MEYER, K.A.; HE, K.; LAUNER, L.; REIS, J.P.; YAFFE, K.; SIDNEY, S.; WHITMER, R.A.; STEFFEN, L.M.

2017-01-01

Background Preserving cognitive function is an important public health issue. We investigated whether dietary pattern associates with cognitive function in middle-age. Methods We studied 2435 participants in the community-based Coronary Artery Risk Development in Young Adults (CARDIA) study of black and white men and women aged 18–30 in 1985–86 (year 0, Y0). We hypothesized that a higher A Priori Diet Quality Score, measured at Y0 and Y20, is associated with better cognitive function measured at Y25. The diet score incorporated 46 food groups (each in servings/day) as the sum of quintile ranks of food groups rated beneficial, 0 for food groups rated neutral, and reversed quintile ranks for food groups rated adverse; higher score indicated better diet quality. Y25 cognitive testing included verbal memory (Rey Auditory-Verbal Learning Test (RAVLT)), psychomotor speed (Digit Symbol Substitution Test (DSST)) and executive function (Stroop). Results Per 10-unit higher diet score at Y20, the RAVLT was 0.32 words recalled higher, the DSST was 1.76 digits higher, and the Stroop was 1.00 seconds+errors lower (better performance) after adjusting for race, sex, age, clinic, and energy intake. Further adjustment for physical activity, smoking, education, and body mass index attenuated the association slightly. Diet score at Y0 and increase in diet score over 20 years were also positively associated with each cognitive test. Conclusions A higher quality dietary pattern was associated with better cognitive function 5 years and even 25 years later in apparently healthy middle-aged adults. PMID:25560814

Association of learning styles with research self-efficacy: study of short-term research training program for medical students.

PubMed

Dumbauld, Jill; Black, Michelle; Depp, Colin A; Daly, Rebecca; Curran, Maureen A; Winegarden, Babbi; Jeste, Dilip V

2014-12-01

With a growing need for developing future physician scientists, identifying characteristics of medical students who are likely to benefit from research training programs is important. This study assessed if specific learning styles of medical students, participating in federally funded short-term research training programs, were associated with research self-efficacy, a potential predictor of research career success. Seventy-five first-year medical students from 28 medical schools, selected to participate in two competitive NIH-supported summer programs for research training in aging, completed rating scales to evaluate learning styles at baseline, and research self-efficacy before and after training. We examined associations of individual learning styles (visual-verbal, sequential-global, sensing-intuitive, and active-reflective) with students' gender, ranking of medical school, and research self-efficacy. Research self-efficacy improved significantly following the training programs. Students with a verbal learning style reported significantly greater research self-efficacy at baseline, while visual, sequential, and intuitive learners demonstrated significantly greater increases in research self-efficacy from baseline to posttraining. No significant relationships were found between learning styles and students' gender or ranking of their medical school. Assessments of learning styles may provide useful information to guide future training endeavors aimed at developing the next generation of physician-scientists. © 2014 Wiley Periodicals, Inc.

Improving teaching strategies in an undergraduate community health nursing (CHN) program: implementation of a service-learning preceptor program.

PubMed

Kazemi, Donna; Behan, Jennifer; Boniauto, Maria

2011-08-01

A service-learning component was added to the existing preceptor practicum program at the University of North Carolina Charlotte's School of Nursing (UNCC SON) in the fall of 2007 for nursing students in the community health nursing (CHN) practicum course. The preceptorship model is commonly used in undergraduate nursing education. The aim of this study was to improve teaching strategies in the existing school health nursing (SHN) preceptor program by the addition of a service-learning community partnership. Adding the service-learning component was based on the Polvika model. A total of 27 nursing students and 33 preceptors participated in the study. Percentages, means, standard deviations, and rankings were used to analyze the data. The participants completed a multiple-choice survey and ranked a list of tasks. The students were able to fulfill their task responsibilities, and the service-learning preceptor program was cost effective for the SHN preceptors through hours saved by the nursing students. The preceptor role is associated with many factors, including perceived burden, which affects their willingness to work with students. The findings demonstrated that service learning is an effective teaching strategy in the CHN nursing students' learning by fostering the preceptors' benefits, rewards, support, and commitment to the role. Published by Elsevier Ltd.

ReactionPredictor: prediction of complex chemical reactions at the mechanistic level using machine learning.

PubMed

Kayala, Matthew A; Baldi, Pierre

2012-10-22

Proposing reasonable mechanisms and predicting the course of chemical reactions is important to the practice of organic chemistry. Approaches to reaction prediction have historically used obfuscating representations and manually encoded patterns or rules. Here we present ReactionPredictor, a machine learning approach to reaction prediction that models elementary, mechanistic reactions as interactions between approximate molecular orbitals (MOs). A training data set of productive reactions known to occur at reasonable rates and yields and verified by inclusion in the literature or textbooks is derived from an existing rule-based system and expanded upon with manual curation from graduate level textbooks. Using this training data set of complex polar, hypervalent, radical, and pericyclic reactions, a two-stage machine learning prediction framework is trained and validated. In the first stage, filtering models trained at the level of individual MOs are used to reduce the space of possible reactions to consider. In the second stage, ranking models over the filtered space of possible reactions are used to order the reactions such that the productive reactions are the top ranked. The resulting model, ReactionPredictor, perfectly ranks polar reactions 78.1% of the time and recovers all productive reactions 95.7% of the time when allowing for small numbers of errors. Pericyclic and radical reactions are perfectly ranked 85.8% and 77.0% of the time, respectively, rising to >93% recovery for both reaction types with a small number of allowed errors. Decisions about which of the polar, pericyclic, or radical reaction type ranking models to use can be made with >99% accuracy. Finally, for multistep reaction pathways, we implement the first mechanistic pathway predictor using constrained tree-search to discover a set of reasonable mechanistic steps from given reactants to given products. Webserver implementations of both the single step and pathway versions of ReactionPredictor are available via the chemoinformatics portal http://cdb.ics.uci.edu/.

A method for integrating and ranking the evidence for biochemical pathways by mining reactions from text

PubMed Central

Miwa, Makoto; Ohta, Tomoko; Rak, Rafal; Rowley, Andrew; Kell, Douglas B.; Pyysalo, Sampo; Ananiadou, Sophia

2013-01-01

Motivation: To create, verify and maintain pathway models, curators must discover and assess knowledge distributed over the vast body of biological literature. Methods supporting these tasks must understand both the pathway model representations and the natural language in the literature. These methods should identify and order documents by relevance to any given pathway reaction. No existing system has addressed all aspects of this challenge. Method: We present novel methods for associating pathway model reactions with relevant publications. Our approach extracts the reactions directly from the models and then turns them into queries for three text mining-based MEDLINE literature search systems. These queries are executed, and the resulting documents are combined and ranked according to their relevance to the reactions of interest. We manually annotate document-reaction pairs with the relevance of the document to the reaction and use this annotation to study several ranking methods, using various heuristic and machine-learning approaches. Results: Our evaluation shows that the annotated document-reaction pairs can be used to create a rule-based document ranking system, and that machine learning can be used to rank documents by their relevance to pathway reactions. We find that a Support Vector Machine-based system outperforms several baselines and matches the performance of the rule-based system. The success of the query extraction and ranking methods are used to update our existing pathway search system, PathText. Availability: An online demonstration of PathText 2 and the annotated corpus are available for research purposes at http://www.nactem.ac.uk/pathtext2/. Contact: makoto.miwa@manchester.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:23813008

A novel cadaver-based educational program in general surgery training.

PubMed

Lewis, Catherine E; Peacock, Warwick J; Tillou, Areti; Hines, O Joe; Hiatt, Jonathan R

2012-01-01

To describe the development of a cadaver-based educational program and report our residents' assessment of the new program. An anatomy-based educational program was developed using fresh frozen cadavers to teach surgical anatomy and operative skills to general surgery (GS) trainees. Residents were asked to complete a voluntary, anonymous survey evaluating perceptions of the program (6 questions formulated on a 5-point Likert scale) and comparing cadaver sessions to other types of learning (4 rank order questions). Large university teaching hospital. Medical students, residents, and faculty members were participants in the cadaver programs. Only GS residents were asked to complete the survey. Since its implementation, 150 residents of all levels participated in 13 sessions. A total of 40 surveys were returned for a response rate of 89%. Overall, respondents held a positive view of the cadaver sessions and believed them to be useful for learning anatomy (94% agree or strongly agree), learning the steps of an operation (76% agree or strongly agree), and increasing confidence in doing an operation (53% agree or strongly agree). Trainees wanted to have more sessions (87% agree or strongly agree), and believed they would spend free time in the cadaver laboratory (58% agree or strongly agree). Compared with other learning modalities, cadaver sessions were ranked first for learning surgical anatomy, followed by textbooks, simulators, web sites, animate laboratories, and lectures. Respondents also ranked cadaver sessions first for increasing confidence in performing a procedure and for learning the steps of an operation. Cost of cadavers represented the major expense of the program. Fresh cadaver dissections represent a solution to the challenges of efficient, safe, and effective general surgery education. Residents have a positive attitude toward these teaching sessions and found them to be more effective than other learning modalities. Copyright © 2012 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

Social Image Tag Ranking by Two-View Learning

NASA Astrophysics Data System (ADS)

Zhuang, Jinfeng; Hoi, Steven C. H.

Tags play a central role in text-based social image retrieval and browsing. However, the tags annotated by web users could be noisy, irrelevant, and often incomplete for describing the image contents, which may severely deteriorate the performance of text-based image retrieval models. In order to solve this problem, researchers have proposed techniques to rank the annotated tags of a social image according to their relevance to the visual content of the image. In this paper, we aim to overcome the challenge of social image tag ranking for a corpus of social images with rich user-generated tags by proposing a novel two-view learning approach. It can effectively exploit both textual and visual contents of social images to discover the complicated relationship between tags and images. Unlike the conventional learning approaches that usually assumes some parametric models, our method is completely data-driven and makes no assumption about the underlying models, making the proposed solution practically more effective. We formulate our method as an optimization task and present an efficient algorithm to solve it. To evaluate the efficacy of our method, we conducted an extensive set of experiments by applying our technique to both text-based social image retrieval and automatic image annotation tasks. Our empirical results showed that the proposed method can be more effective than the conventional approaches.

Implicational Markedness and Frequency in Constraint-Based Computational Models of Phonological Learning

ERIC Educational Resources Information Center

Jarosz, Gaja

2010-01-01

This study examines the interacting roles of implicational markedness and frequency from the joint perspectives of formal linguistic theory, phonological acquisition and computational modeling. The hypothesis that child grammars are rankings of universal constraints, as in Optimality Theory (Prince & Smolensky, 1993/2004), that learning involves a…

78 FR 64052 - Proposed Interagency Policy Statement Establishing Joint Standards for Assessing the Diversity...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-25

... learn more about diversity policies and practices, the OMWI Directors and staff held a series of... opportunity for regulated entities to provide input on assessment standards and for the Agencies to learn... of the organization including executive and managerial ranks. The entity holds management accountable...

78 FR 25717 - Applications for New Awards; Strengthening Institutions Program (SIP)

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-02

... use of time, staff, money, or other resources while improving student learning or other educational... migrant, or who have disabilities. Open educational resources (OER) means teaching, learning, and research... awards for individual development grants in rank order from the funding slate according to the average...

78 FR 18307 - Submission for OMB Review; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-26

...-0362. Summary of Collection: APHIS Student Outreach Program to help students learn about careers in... Program is to: (1) Provide students an opportunity to live on a university campus while learning about... applications will help APHIS to rate and rank the applicants. Description of Respondents: Individuals or...

Walking and talking the tree of life: Why and how to teach about biodiversity

PubMed Central

Ballen, Cissy J.; Greene, Harry W.

2017-01-01

Taxonomic details of diversity are an essential scaffolding for biology education, yet outdated methods for teaching the tree of life (TOL), as implied by textbook content and usage, are still commonly employed. Here, we show that the traditional approach only vaguely represents evolutionary relationships, fails to denote major events in the history of life, and relies heavily on memorizing near-meaningless taxonomic ranks. Conversely, a clade-based strategy—focused on common ancestry, monophyletic groups, and derived functional traits—is explicitly based on Darwin’s “descent with modification,” provides students with a rational system for organizing the details of biodiversity, and readily lends itself to active learning techniques. We advocate for a phylogenetic classification that mirrors the TOL, a pedagogical format of increasingly complex but always hierarchical presentations, and the adoption of active learning technologies and tactics. PMID:28319149

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xu, Q; Stanford University School of Medicine, Stanford, CA; Liu, H

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channelmore » and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral CT. This work is partially supported by the National Natural Science Foundation of China (No. 61302136), and the Natural Science Basic Research Plan in Shaanxi Province of China (No. 2014JQ8317).« less

Applying machine learning to pattern analysis for automated in-design layout optimization

NASA Astrophysics Data System (ADS)

Cain, Jason P.; Fakhry, Moutaz; Pathak, Piyush; Sweis, Jason; Gennari, Frank; Lai, Ya-Chieh

2018-04-01

Building on previous work for cataloging unique topological patterns in an integrated circuit physical design, a new process is defined in which a risk scoring methodology is used to rank patterns based on manufacturing risk. Patterns with high risk are then mapped to functionally equivalent patterns with lower risk. The higher risk patterns are then replaced in the design with their lower risk equivalents. The pattern selection and replacement is fully automated and suitable for use for full-chip designs. Results from 14nm product designs show that the approach can identify and replace risk patterns with quantifiable positive impact on the risk score distribution after replacement.

LMS in university for in-class education: Synergy of free software, competitive approach and social networks technology

NASA Astrophysics Data System (ADS)

Radygin, V. Y.; Lukyanova, N. V.; Kupriyanov, D. Yu.

2017-01-01

Transformation of learning management systems over last two decades was investigated. The features of using e-learning systems for in-class education were discussed. The necessity of integration e-learning system with the student performance controlling system was shown. The influence of choice of student ranking system on students' motivation was described. The own way to choice of e-learning system design principles and technologies were suggested.

Sharing e-Learning Experiences: A Personalised Approach

NASA Astrophysics Data System (ADS)

Clematis, Andrea; Forcheri, Paola; Ierardi, Maria Grazia; Quarati, Alfonso

A two-tier architecture is presented, based on hybrid peer-to-peer technology, aimed at providing personalized access to heterogeneous learning sources. The architecture deploys a conceptual model that is superimposed over logically and physically separated repositories. The model is based on the interactions between users and learning resources, described by means of coments. To support users to find out material satisfying their needs, mechanisms for ranking resources and for extracting personalized views of the learning space are provided.

Exchange-Hole Dipole Dispersion Model for Accurate Energy Ranking in Molecular Crystal Structure Prediction.

PubMed

Whittleton, Sarah R; Otero-de-la-Roza, A; Johnson, Erin R

2017-02-14

Accurate energy ranking is a key facet to the problem of first-principles crystal-structure prediction (CSP) of molecular crystals. This work presents a systematic assessment of B86bPBE-XDM, a semilocal density functional combined with the exchange-hole dipole moment (XDM) dispersion model, for energy ranking using 14 compounds from the first five CSP blind tests. Specifically, the set of crystals studied comprises 11 rigid, planar compounds and 3 co-crystals. The experimental structure was correctly identified as the lowest in lattice energy for 12 of the 14 total crystals. One of the exceptions is 4-hydroxythiophene-2-carbonitrile, for which the experimental structure was correctly identified once a quasi-harmonic estimate of the vibrational free-energy contribution was included, evidencing the occasional importance of thermal corrections for accurate energy ranking. The other exception is an organic salt, where charge-transfer error (also called delocalization error) is expected to cause the base density functional to be unreliable. Provided the choice of base density functional is appropriate and an estimate of temperature effects is used, XDM-corrected density-functional theory is highly reliable for the energetic ranking of competing crystal structures.

Is lecture dead? A preliminary study of medical students' evaluation of teaching methods in the preclinical curriculum.

PubMed

Zinski, Anne; Blackwell, Kristina T C Panizzi Woodley; Belue, F Mike; Brooks, William S

2017-09-22

To investigate medical students' perceptions of lecture and non-lecture-based instructional methods and compare preferences for use and quantity of each during preclinical training. We administered a survey to first- and second-year undergraduate medical students at the University of Alabama School of Medicine in Birmingham, Alabama, USA aimed to evaluate preferred instructional methods.  Using a cross-sectional study design, Likert scale ratings and student rankings were used to determine preferences among lecture, laboratory, team-based learning, simulation, small group case-based learning, large group case-based learning, patient presentation, and peer teaching. We calculated mean ratings for each instructional method and used chi-square tests to compare proportions of first- and second-year cohorts who ranked each in their top 5 preferred methods. Among participating students, lecture (M=3.6, SD=1.0), team based learning (M=4.2, SD=1.0), simulation (M=4.0, SD=1.0), small group case-based learning (M=3.8, SD=1.0), laboratory (M=3.6, SD=1.0), and patient presentation (M=3.8, SD=0.9) received higher scores than other instructional methods. Overall, second-year students ranked lecture lower (χ 2 (1, N=120) =16.33, p<0.0001) and patient presentation higher (χ 2 (1, N=120) =3.75, p=0.05) than first-year students. While clinically-oriented teaching methods were preferred by second-year medical students, lecture-based instruction was popular among first-year students. Results warrant further investigation to determine the ideal balance of didactic methods in undergraduate medical education, specifically curricula that employ patient-oriented instruction during the second preclinical year.

Rank-based pooling for deep convolutional neural networks.

PubMed

Shi, Zenglin; Ye, Yangdong; Wu, Yunpeng

2016-11-01

Pooling is a key mechanism in deep convolutional neural networks (CNNs) which helps to achieve translation invariance. Numerous studies, both empirically and theoretically, show that pooling consistently boosts the performance of the CNNs. The conventional pooling methods are operated on activation values. In this work, we alternatively propose rank-based pooling. It is derived from the observations that ranking list is invariant under changes of activation values in a pooling region, and thus rank-based pooling operation may achieve more robust performance. In addition, the reasonable usage of rank can avoid the scale problems encountered by value-based methods. The novel pooling mechanism can be regarded as an instance of weighted pooling where a weighted sum of activations is used to generate the pooling output. This pooling mechanism can also be realized as rank-based average pooling (RAP), rank-based weighted pooling (RWP) and rank-based stochastic pooling (RSP) according to different weighting strategies. As another major contribution, we present a novel criterion to analyze the discriminant ability of various pooling methods, which is heavily under-researched in machine learning and computer vision community. Experimental results on several image benchmarks show that rank-based pooling outperforms the existing pooling methods in classification performance. We further demonstrate better performance on CIFAR datasets by integrating RSP into Network-in-Network. Copyright © 2016 Elsevier Ltd. All rights reserved.

GAtor: A First-Principles Genetic Algorithm for Molecular Crystal Structure Prediction.

PubMed

Curtis, Farren; Li, Xiayue; Rose, Timothy; Vázquez-Mayagoitia, Álvaro; Bhattacharya, Saswata; Ghiringhelli, Luca M; Marom, Noa

2018-04-10

We present the implementation of GAtor, a massively parallel, first-principles genetic algorithm (GA) for molecular crystal structure prediction. GAtor is written in Python and currently interfaces with the FHI-aims code to perform local optimizations and energy evaluations using dispersion-inclusive density functional theory (DFT). GAtor offers a variety of fitness evaluation, selection, crossover, and mutation schemes. Breeding operators designed specifically for molecular crystals provide a balance between exploration and exploitation. Evolutionary niching is implemented in GAtor by using machine learning to cluster the dynamically updated population by structural similarity and then employing a cluster-based fitness function. Evolutionary niching promotes uniform sampling of the potential energy surface by evolving several subpopulations, which helps overcome initial pool biases and selection biases (genetic drift). The various settings offered by GAtor increase the likelihood of locating numerous low-energy minima, including those located in disconnected, hard to reach regions of the potential energy landscape. The best structures generated are re-relaxed and re-ranked using a hierarchy of increasingly accurate DFT functionals and dispersion methods. GAtor is applied to a chemically diverse set of four past blind test targets, characterized by different types of intermolecular interactions. The experimentally observed structures and other low-energy structures are found for all four targets. In particular, for Target II, 5-cyano-3-hydroxythiophene, the top ranked putative crystal structure is a Z' = 2 structure with P1̅ symmetry and a scaffold packing motif, which has not been reported previously.

Collaborative environmental planning in river management: An application of multicriteria decision analysis in the White River Watershed in Vermont

USGS Publications Warehouse

Hermans, C.; Erickson, J.; Noordewier, T.; Sheldon, A.; Kline, M.

2007-01-01

Multicriteria decision analysis (MCDA) provides a well-established family of decision tools to aid stakeholder groups in arriving at collective decisions. MCDA can also function as a framework for the social learning process, serving as an educational aid in decision problems characterized by a high level of public participation. In this paper, the framework and results of a structured decision process using the outranking MCDA methodology preference ranking organization method of enrichment evaluation (PROMETHEE) are presented. PROMETHEE is used to frame multi-stakeholder discussions of river management alternatives for the Upper White River of Central Vermont, in the northeastern United States. Stakeholders met over 10 months to create a shared vision of an ideal river and its services to communities, develop a list of criteria by which to evaluate river management alternatives, and elicit preferences to rank and compare individual and group preferences. The MCDA procedure helped to frame a group process that made stakeholder preferences explicit and substantive discussions about long-term river management possible. ?? 2006 Elsevier Ltd. All rights reserved.

Collaborative environmental planning in river management: an application of multicriteria decision analysis in the White River Watershed in Vermont.

PubMed

Hermans, Caroline; Erickson, Jon; Noordewier, Tom; Sheldon, Amy; Kline, Mike

2007-09-01

Multicriteria decision analysis (MCDA) provides a well-established family of decision tools to aid stakeholder groups in arriving at collective decisions. MCDA can also function as a framework for the social learning process, serving as an educational aid in decision problems characterized by a high level of public participation. In this paper, the framework and results of a structured decision process using the outranking MCDA methodology preference ranking organization method of enrichment evaluation (PROMETHEE) are presented. PROMETHEE is used to frame multi-stakeholder discussions of river management alternatives for the Upper White River of Central Vermont, in the northeastern United States. Stakeholders met over 10 months to create a shared vision of an ideal river and its services to communities, develop a list of criteria by which to evaluate river management alternatives, and elicit preferences to rank and compare individual and group preferences. The MCDA procedure helped to frame a group process that made stakeholder preferences explicit and substantive discussions about long-term river management possible.

Indexing and Retrieval for the Web.

ERIC Educational Resources Information Center

Rasmussen, Edie M.

2003-01-01

Explores current research on indexing and ranking as retrieval functions of search engines on the Web. Highlights include measuring search engine stability; evaluation of Web indexing and retrieval; Web crawlers; hyperlinks for indexing and ranking; ranking for metasearch; document structure; citation indexing; relevance; query evaluation;…

Multi-Target Regression via Robust Low-Rank Learning.

PubMed

Zhen, Xiantong; Yu, Mengyang; He, Xiaofei; Li, Shuo

2018-02-01

Multi-target regression has recently regained great popularity due to its capability of simultaneously learning multiple relevant regression tasks and its wide applications in data mining, computer vision and medical image analysis, while great challenges arise from jointly handling inter-target correlations and input-output relationships. In this paper, we propose Multi-layer Multi-target Regression (MMR) which enables simultaneously modeling intrinsic inter-target correlations and nonlinear input-output relationships in a general framework via robust low-rank learning. Specifically, the MMR can explicitly encode inter-target correlations in a structure matrix by matrix elastic nets (MEN); the MMR can work in conjunction with the kernel trick to effectively disentangle highly complex nonlinear input-output relationships; the MMR can be efficiently solved by a new alternating optimization algorithm with guaranteed convergence. The MMR leverages the strength of kernel methods for nonlinear feature learning and the structural advantage of multi-layer learning architectures for inter-target correlation modeling. More importantly, it offers a new multi-layer learning paradigm for multi-target regression which is endowed with high generality, flexibility and expressive ability. Extensive experimental evaluation on 18 diverse real-world datasets demonstrates that our MMR can achieve consistently high performance and outperforms representative state-of-the-art algorithms, which shows its great effectiveness and generality for multivariate prediction.

Assessing the Readability of Medical Documents: A Ranking Approach.

PubMed

Zheng, Jiaping; Yu, Hong

2018-03-23

The use of electronic health record (EHR) systems with patient engagement capabilities, including viewing, downloading, and transmitting health information, has recently grown tremendously. However, using these resources to engage patients in managing their own health remains challenging due to the complex and technical nature of the EHR narratives. Our objective was to develop a machine learning-based system to assess readability levels of complex documents such as EHR notes. We collected difficulty ratings of EHR notes and Wikipedia articles using crowdsourcing from 90 readers. We built a supervised model to assess readability based on relative orders of text difficulty using both surface text features and word embeddings. We evaluated system performance using the Kendall coefficient of concordance against human ratings. Our system achieved significantly higher concordance (.734) with human annotators than did a baseline using the Flesch-Kincaid Grade Level, a widely adopted readability formula (.531). The improvement was also consistent across different disease topics. This method's concordance with an individual human user's ratings was also higher than the concordance between different human annotators (.658). We explored methods to automatically assess the readability levels of clinical narratives. Our ranking-based system using simple textual features and easy-to-learn word embeddings outperformed a widely used readability formula. Our ranking-based method can predict relative difficulties of medical documents. It is not constrained to a predefined set of readability levels, a common design in many machine learning-based systems. Furthermore, the feature set does not rely on complex processing of the documents. One potential application of our readability ranking is personalization, allowing patients to better accommodate their own background knowledge. ©Jiaping Zheng, Hong Yu. Originally published in JMIR Medical Informatics (http://medinform.jmir.org), 23.03.2018.

Simultaneously learning DNA motif along with its position and sequence rank preferences through expectation maximization algorithm.

PubMed

Zhang, ZhiZhuo; Chang, Cheng Wei; Hugo, Willy; Cheung, Edwin; Sung, Wing-Kin

2013-03-01

Although de novo motifs can be discovered through mining over-represented sequence patterns, this approach misses some real motifs and generates many false positives. To improve accuracy, one solution is to consider some additional binding features (i.e., position preference and sequence rank preference). This information is usually required from the user. This article presents a de novo motif discovery algorithm called SEME (sampling with expectation maximization for motif elicitation), which uses pure probabilistic mixture model to model the motif's binding features and uses expectation maximization (EM) algorithms to simultaneously learn the sequence motif, position, and sequence rank preferences without asking for any prior knowledge from the user. SEME is both efficient and accurate thanks to two important techniques: the variable motif length extension and importance sampling. Using 75 large-scale synthetic datasets, 32 metazoan compendium benchmark datasets, and 164 chromatin immunoprecipitation sequencing (ChIP-Seq) libraries, we demonstrated the superior performance of SEME over existing programs in finding transcription factor (TF) binding sites. SEME is further applied to a more difficult problem of finding the co-regulated TF (coTF) motifs in 15 ChIP-Seq libraries. It identified significantly more correct coTF motifs and, at the same time, predicted coTF motifs with better matching to the known motifs. Finally, we show that the learned position and sequence rank preferences of each coTF reveals potential interaction mechanisms between the primary TF and the coTF within these sites. Some of these findings were further validated by the ChIP-Seq experiments of the coTFs. The application is available online.

Computers and Young Children

ERIC Educational Resources Information Center

Lacina, Jan

2007-01-01

Technology is a way of life for most Americans. A recent study published by the National Writing Project (2007) found that Americans believe that computers have a positive effect on writing skills. The importance of learning to use technology ranked just below learning to read and write, and 74 percent of the survey respondents noted that children…

Prevailing Attitudes about the Role of Women in Distance Learning Administration

ERIC Educational Resources Information Center

Kupczynski, Lori; Mundy, Marie-Anne

2015-01-01

The increasing scarcity of women within higher academic ranks is troublesome, especially as associate and full-professors with tenure are generally those tapped for leadership positions. This study surveyed female administrators in distance education in an effort to thematically analyze their perceptions of distance learning in higher education.…

How Sociological Leaders Rank Learning Goals for Introductory Sociology

ERIC Educational Resources Information Center

Persell, Caroline Hodges

2010-01-01

In 2001, the American Sociological Association launched a task force to articulate learning goals for an introduction to sociology course and design an advanced high school sociology curriculum that could also be a model for introductory sociology courses in colleges and universities. This research note describes one of several efforts to validate…

Request for Support: A Tool for Strengthening Network Capacity

ERIC Educational Resources Information Center

Bain, Jamie; Harden, Noelle; Heim, Stephanie

2017-01-01

A request for support (RFS) is a tool that is used to strengthen network capacity by prioritizing needs and optimizing learning opportunities. Within University of Minnesota Extension, we implemented an RFS process through an online survey designed to help leaders of food networks identify and rank learning and capacity-building needs and indicate…

BiGGER: a new (soft) docking algorithm for predicting protein interactions.

PubMed

Palma, P N; Krippahl, L; Wampler, J E; Moura, J J

2000-06-01

A new computationally efficient and automated "soft docking" algorithm is described to assist the prediction of the mode of binding between two proteins, using the three-dimensional structures of the unbound molecules. The method is implemented in a software package called BiGGER (Bimolecular Complex Generation with Global Evaluation and Ranking) and works in two sequential steps: first, the complete 6-dimensional binding spaces of both molecules is systematically searched. A population of candidate protein-protein docked geometries is thus generated and selected on the basis of the geometric complementarity and amino acid pairwise affinities between the two molecular surfaces. Most of the conformational changes observed during protein association are treated in an implicit way and test results are equally satisfactory, regardless of starting from the bound or the unbound forms of known structures of the interacting proteins. In contrast to other methods, the entire molecular surfaces are searched during the simulation, using absolutely no additional information regarding the binding sites. In a second step, an interaction scoring function is used to rank the putative docked structures. The function incorporates interaction terms that are thought to be relevant to the stabilization of protein complexes. These include: geometric complementarity of the surfaces, explicit electrostatic interactions, desolvation energy, and pairwise propensities of the amino acid side chains to contact across the molecular interface. The relative functional contribution of each of these interaction terms to the global scoring function has been empirically adjusted through a neural network optimizer using a learning set of 25 protein-protein complexes of known crystallographic structures. In 22 out of 25 protein-protein complexes tested, near-native docked geometries were found with C(alpha) RMS deviations < or =4.0 A from the experimental structures, of which 14 were found within the 20 top ranking solutions. The program works on widely available personal computers and takes 2 to 8 hours of CPU time to run any of the docking tests herein presented. Finally, the value and limitations of the method for the study of macromolecular interactions, not yet revealed by experimental techniques, are discussed.

Partial Roc Reveals Superiority of Mutual Rank of Pearson's Correlation Coefficient as a Coexpression Measure to Elucidate Functional Association of Genes

NASA Astrophysics Data System (ADS)

Obayashi, Takeshi; Kinoshita, Kengo

2013-01-01

Gene coexpression analysis is a powerful approach to elucidate gene function. We have established and developed this approach using vast amount of publicly available gene expression data measured by microarray techniques. The coexpressed genes are used to estimate gene function of the guide gene or to construct gene coexpression networks. In the case to construct gene networks, researchers should introduce an arbitrary threshold of gene coexpression, because gene coexpression value is continuous value. In the viewpoint to introduce common threshold of gene coexpression, we previously reported rank of Pearson's correlation coefficient (PCC) is more useful than the original PCC value. In this manuscript, we re-assessed the measure of gene coexpression to construct gene coexpression network, and found that mutual rank (MR) of PCC showed better performance than rank of PCC and the original PCC in low false positive rate.

DockRank: Ranking docked conformations using partner-specific sequence homology-based protein interface prediction

PubMed Central

Xue, Li C.; Jordan, Rafael A.; EL-Manzalawy, Yasser; Dobbs, Drena; Honavar, Vasant

2015-01-01

Selecting near-native conformations from the immense number of conformations generated by docking programs remains a major challenge in molecular docking. We introduce DockRank, a novel approach to scoring docked conformations based on the degree to which the interface residues of the docked conformation match a set of predicted interface residues. Dock-Rank uses interface residues predicted by partner-specific sequence homology-based protein–protein interface predictor (PS-HomPPI), which predicts the interface residues of a query protein with a specific interaction partner. We compared the performance of DockRank with several state-of-the-art docking scoring functions using Success Rate (the percentage of cases that have at least one near-native conformation among the top m conformations) and Hit Rate (the percentage of near-native conformations that are included among the top m conformations). In cases where it is possible to obtain partner-specific (PS) interface predictions from PS-HomPPI, DockRank consistently outperforms both (i) ZRank and IRAD, two state-of-the-art energy-based scoring functions (improving Success Rate by up to 4-fold); and (ii) Variants of DockRank that use predicted interface residues obtained from several protein interface predictors that do not take into account the binding partner in making interface predictions (improving success rate by up to 39-fold). The latter result underscores the importance of using partner-specific interface residues in scoring docked conformations. We show that DockRank, when used to re-rank the conformations returned by ClusPro, improves upon the original ClusPro rankings in terms of both Success Rate and Hit Rate. DockRank is available as a server at http://einstein.cs.iastate.edu/DockRank/. PMID:23873600

DockRank: ranking docked conformations using partner-specific sequence homology-based protein interface prediction.

PubMed

Xue, Li C; Jordan, Rafael A; El-Manzalawy, Yasser; Dobbs, Drena; Honavar, Vasant

2014-02-01

Selecting near-native conformations from the immense number of conformations generated by docking programs remains a major challenge in molecular docking. We introduce DockRank, a novel approach to scoring docked conformations based on the degree to which the interface residues of the docked conformation match a set of predicted interface residues. DockRank uses interface residues predicted by partner-specific sequence homology-based protein-protein interface predictor (PS-HomPPI), which predicts the interface residues of a query protein with a specific interaction partner. We compared the performance of DockRank with several state-of-the-art docking scoring functions using Success Rate (the percentage of cases that have at least one near-native conformation among the top m conformations) and Hit Rate (the percentage of near-native conformations that are included among the top m conformations). In cases where it is possible to obtain partner-specific (PS) interface predictions from PS-HomPPI, DockRank consistently outperforms both (i) ZRank and IRAD, two state-of-the-art energy-based scoring functions (improving Success Rate by up to 4-fold); and (ii) Variants of DockRank that use predicted interface residues obtained from several protein interface predictors that do not take into account the binding partner in making interface predictions (improving success rate by up to 39-fold). The latter result underscores the importance of using partner-specific interface residues in scoring docked conformations. We show that DockRank, when used to re-rank the conformations returned by ClusPro, improves upon the original ClusPro rankings in terms of both Success Rate and Hit Rate. DockRank is available as a server at http://einstein.cs.iastate.edu/DockRank/. Copyright © 2013 Wiley Periodicals, Inc.

On the ranking of chemicals based on their PBT characteristics: comparison of different ranking methodologies using selected POPs as an illustrative example.

PubMed

Sailaukhanuly, Yerbolat; Zhakupbekova, Arai; Amutova, Farida; Carlsen, Lars

2013-01-01

Knowledge of the environmental behavior of chemicals is a fundamental part of the risk assessment process. The present paper discusses various methods of ranking of a series of persistent organic pollutants (POPs) according to the persistence, bioaccumulation and toxicity (PBT) characteristics. Traditionally ranking has been done as an absolute (total) ranking applying various multicriteria data analysis methods like simple additive ranking (SAR) or various utility functions (UFs) based rankings. An attractive alternative to these ranking methodologies appears to be partial order ranking (POR). The present paper compares different ranking methods like SAR, UF and POR. Significant discrepancies between the rankings are noted and it is concluded that partial order ranking, as a method without any pre-assumptions concerning possible relation between the single parameters, appears as the most attractive ranking methodology. In addition to the initial ranking partial order methodology offers a wide variety of analytical tools to elucidate the interplay between the objects to be ranked and the ranking parameters. In the present study is included an analysis of the relative importance of the single P, B and T parameters. Copyright © 2012 Elsevier Ltd. All rights reserved.

The Functions and Dysfunctions of College Rankings: An Analysis of Institutional Expenditure

ERIC Educational Resources Information Center

Kim, Jeongeun

2018-01-01

College rankings have become a powerful influence in higher education. While the determinants of educational quality are not clearly defined, college rankings designate an institution's standing in a numerical order based on quantifiable measurements that focus primarily on institutional resources. Previous research has identified the…

Genetic deletion of muscle RANK or selective inhibition of RANKL is not as effective as full-length OPG-fc in mitigating muscular dystrophy.

PubMed

Dufresne, Sébastien S; Boulanger-Piette, Antoine; Bossé, Sabrina; Argaw, Anteneh; Hamoudi, Dounia; Marcadet, Laetitia; Gamu, Daniel; Fajardo, Val A; Yagita, Hideo; Penninger, Josef M; Russell Tupling, A; Frenette, Jérôme

2018-04-24

Although there is a strong association between osteoporosis and skeletal muscle atrophy/dysfunction, the functional relevance of a particular biological pathway that regulates synchronously bone and skeletal muscle physiopathology is still elusive. Receptor-activator of nuclear factor κB (RANK), its ligand RANKL and the soluble decoy receptor osteoprotegerin (OPG) are the key regulators of osteoclast differentiation and bone remodelling. We thus hypothesized that RANK/RANKL/OPG, which is a key pathway for bone regulation, is involved in Duchenne muscular dystrophy (DMD) physiopathology. Our results show that muscle-specific RANK deletion (mdx-RANK mko ) in dystrophin deficient mdx mice improves significantly specific force [54% gain in force] of EDL muscles with no protective effect against eccentric contraction-induced muscle dysfunction. In contrast, full-length OPG-Fc injections restore the force of dystrophic EDL muscles [162% gain in force], protect against eccentric contraction-induced muscle dysfunction ex vivo and significantly improve functional performance on downhill treadmill and post-exercise physical activity. Since OPG serves a soluble receptor for RANKL and as a decoy receptor for TRAIL, mdx mice were injected with anti-RANKL and anti-TRAIL antibodies to decipher the dual function of OPG. Injections of anti-RANKL and/or anti-TRAIL increase significantly the force of dystrophic EDL muscle [45% and 17% gains in force, respectively]. In agreement, truncated OPG-Fc that contains only RANKL domains produces similar gains, in terms of force production, than anti-RANKL treatments. To corroborate that full-length OPG-Fc also acts independently of RANK/RANKL pathway, dystrophin/RANK double-deficient mice were treated with full-length OPG-Fc for 10 days. Dystrophic EDL muscles exhibited a significant gain in force relative to untreated dystrophin/RANK double-deficient mice, indicating that the effect of full-length OPG-Fc is in part independent of the RANKL/RANK interaction. The sarco/endoplasmic reticulum Ca 2+ ATPase (SERCA) activity is significantly depressed in dysfunctional and dystrophic muscles and full-length OPG-Fc treatment increased SERCA activity and SERCA-2a expression. These findings demonstrate the superiority of full-length OPG-Fc treatment relative to truncated OPG-Fc, anti-RANKL, anti-TRAIL or muscle RANK deletion in improving dystrophic muscle function, integrity and protection against eccentric contractions. In conclusion, full-length OPG-Fc represents an efficient alternative in the development of new treatments for muscular dystrophy in which a single therapeutic approach may be foreseeable to maintain both bone and skeletal muscle functions.

Discriminative Transfer Subspace Learning via Low-Rank and Sparse Representation.

PubMed

Xu, Yong; Fang, Xiaozhao; Wu, Jian; Li, Xuelong; Zhang, David

2016-02-01

In this paper, we address the problem of unsupervised domain transfer learning in which no labels are available in the target domain. We use a transformation matrix to transfer both the source and target data to a common subspace, where each target sample can be represented by a combination of source samples such that the samples from different domains can be well interlaced. In this way, the discrepancy of the source and target domains is reduced. By imposing joint low-rank and sparse constraints on the reconstruction coefficient matrix, the global and local structures of data can be preserved. To enlarge the margins between different classes as much as possible and provide more freedom to diminish the discrepancy, a flexible linear classifier (projection) is obtained by learning a non-negative label relaxation matrix that allows the strict binary label matrix to relax into a slack variable matrix. Our method can avoid a potentially negative transfer by using a sparse matrix to model the noise and, thus, is more robust to different types of noise. We formulate our problem as a constrained low-rankness and sparsity minimization problem and solve it by the inexact augmented Lagrange multiplier method. Extensive experiments on various visual domain adaptation tasks show the superiority of the proposed method over the state-of-the art methods. The MATLAB code of our method will be publicly available at http://www.yongxu.org/lunwen.html.

Hierarchical Gene Selection and Genetic Fuzzy System for Cancer Microarray Data Classification

PubMed Central

Nguyen, Thanh; Khosravi, Abbas; Creighton, Douglas; Nahavandi, Saeid

2015-01-01

This paper introduces a novel approach to gene selection based on a substantial modification of analytic hierarchy process (AHP). The modified AHP systematically integrates outcomes of individual filter methods to select the most informative genes for microarray classification. Five individual ranking methods including t-test, entropy, receiver operating characteristic (ROC) curve, Wilcoxon and signal to noise ratio are employed to rank genes. These ranked genes are then considered as inputs for the modified AHP. Additionally, a method that uses fuzzy standard additive model (FSAM) for cancer classification based on genes selected by AHP is also proposed in this paper. Traditional FSAM learning is a hybrid process comprising unsupervised structure learning and supervised parameter tuning. Genetic algorithm (GA) is incorporated in-between unsupervised and supervised training to optimize the number of fuzzy rules. The integration of GA enables FSAM to deal with the high-dimensional-low-sample nature of microarray data and thus enhance the efficiency of the classification. Experiments are carried out on numerous microarray datasets. Results demonstrate the performance dominance of the AHP-based gene selection against the single ranking methods. Furthermore, the combination of AHP-FSAM shows a great accuracy in microarray data classification compared to various competing classifiers. The proposed approach therefore is useful for medical practitioners and clinicians as a decision support system that can be implemented in the real medical practice. PMID:25823003

Hierarchical gene selection and genetic fuzzy system for cancer microarray data classification.

PubMed

Nguyen, Thanh; Khosravi, Abbas; Creighton, Douglas; Nahavandi, Saeid

2015-01-01

This paper introduces a novel approach to gene selection based on a substantial modification of analytic hierarchy process (AHP). The modified AHP systematically integrates outcomes of individual filter methods to select the most informative genes for microarray classification. Five individual ranking methods including t-test, entropy, receiver operating characteristic (ROC) curve, Wilcoxon and signal to noise ratio are employed to rank genes. These ranked genes are then considered as inputs for the modified AHP. Additionally, a method that uses fuzzy standard additive model (FSAM) for cancer classification based on genes selected by AHP is also proposed in this paper. Traditional FSAM learning is a hybrid process comprising unsupervised structure learning and supervised parameter tuning. Genetic algorithm (GA) is incorporated in-between unsupervised and supervised training to optimize the number of fuzzy rules. The integration of GA enables FSAM to deal with the high-dimensional-low-sample nature of microarray data and thus enhance the efficiency of the classification. Experiments are carried out on numerous microarray datasets. Results demonstrate the performance dominance of the AHP-based gene selection against the single ranking methods. Furthermore, the combination of AHP-FSAM shows a great accuracy in microarray data classification compared to various competing classifiers. The proposed approach therefore is useful for medical practitioners and clinicians as a decision support system that can be implemented in the real medical practice.

Biomarker selection and classification of "-omics" data using a two-step bayes classification framework.

PubMed

Assawamakin, Anunchai; Prueksaaroon, Supakit; Kulawonganunchai, Supasak; Shaw, Philip James; Varavithya, Vara; Ruangrajitpakorn, Taneth; Tongsima, Sissades

2013-01-01

Identification of suitable biomarkers for accurate prediction of phenotypic outcomes is a goal for personalized medicine. However, current machine learning approaches are either too complex or perform poorly. Here, a novel two-step machine-learning framework is presented to address this need. First, a Naïve Bayes estimator is used to rank features from which the top-ranked will most likely contain the most informative features for prediction of the underlying biological classes. The top-ranked features are then used in a Hidden Naïve Bayes classifier to construct a classification prediction model from these filtered attributes. In order to obtain the minimum set of the most informative biomarkers, the bottom-ranked features are successively removed from the Naïve Bayes-filtered feature list one at a time, and the classification accuracy of the Hidden Naïve Bayes classifier is checked for each pruned feature set. The performance of the proposed two-step Bayes classification framework was tested on different types of -omics datasets including gene expression microarray, single nucleotide polymorphism microarray (SNParray), and surface-enhanced laser desorption/ionization time-of-flight (SELDI-TOF) proteomic data. The proposed two-step Bayes classification framework was equal to and, in some cases, outperformed other classification methods in terms of prediction accuracy, minimum number of classification markers, and computational time.

Comparisons of methods for determining dominance rank in male and female prairie voles (Microtus ochrogastor)

USGS Publications Warehouse

Lanctot, Richard B.; Best, Louis B.

2000-01-01

Dominance ranks in male and female prairie voles (Microtus ochrogaster) were determined from 6 measurements that mimicked environmental situations that might be encountered by prairie voles in communal groups, including agonistic interactions resulting from competition for food and water and encounters in burrows. Male and female groups of 6 individuals each were tested against one another in pairwise encounters (i.e., dyads) for 5 of the measurements and together as a group in a 6th measurement. Two types of response variables, aggressive behaviors and possession time of a limiting resource, were collected during trials, and those data were used to determine cardinal ranks and principal component ranks for all animals within each group. Cardinal ranks and principal component ranks seldom yielded similar rankings for each animal across measurements. However, dominance measurements that were conducted in similar environmental contexts, regardless of the response variable recorded, ranked animals similarly. Our results suggest that individual dominance measurements assessed situation- or resource-specific responses. Our study demonstrates problems inherent in determining dominance rankings of individuals within groups, including choosing measurements, response variables, and statistical techniques. Researchers should avoid using a single measurement to represent social dominance until they have first demonstrated that a dominance relationship between 2 individuals has been learned (i.e., subsequent interactions show a reduced response rather than an escalation), that this relationship is relatively constant through time, and that the relationship is not context dependent. Such assessments of dominance status between all dyads then can be used to generate dominance rankings within social groups.

Faculty Development in Higher Education: Long-Term Impact of a Summer Teaching and Learning Workshop

ERIC Educational Resources Information Center

Persellin, Diane; Goodrick, Terry

2010-01-01

Past participants of the Associated Colleges of the South Summer Teaching and Learning Workshop were surveyed to determine long-term impact of this type of professional development experience. Results indicate a large majority of participants across rank and academic discipline continued to view the workshop as effective and valued feedback from…

A National Research Survey of Technology Use in the BSW Teaching and Learning Process

ERIC Educational Resources Information Center

Buquoi, Brittany; McClure, Carli; Kotrlik, Joseph W.; Machtmes, Krisanna; Bunch, J. C.

2013-01-01

The purpose of this descriptive-correlational research study was to assess the overall use of technology in the teaching and learning process (TLP) by BSW educators. The accessible and target population included all full-time, professorial-rank, BSW faculty in Council on Social Work Education--accredited BSW programs at land grant universities.…

What Belongs in Your 15-Bean Soup? Using the Learning Cycle to Address Misconceptions about Construction of Taxonomic Keys

ERIC Educational Resources Information Center

Ross, Ann; Vanderspool, Staria

2004-01-01

Students can use seed characteristics to discriminate between the different kinds of legumes using taxonomic classification processes of sorting and ranking, followed by construction of taxonomic keys. The application of the Learning Cycle process to taxonomic principles, hierarchical classification, and construction of keys presents the…

On the Quality of Examples in Introductory Java Textbooks

ERIC Educational Resources Information Center

Borstler, Jurgen; Nordstrom, Marie; Paterson, James H.

2011-01-01

Example programs play an important role in the teaching and learning of programming. Students as well as teachers rank examples as the most important resources for learning to program. Example programs work as role models and must therefore always be consistent with the principles and rules we are teaching. However, it is difficult to find or…

Keys to Collaboration: What It Takes to Move toward Collective Responsbility

ERIC Educational Resources Information Center

Crow, Tracy

2015-01-01

Ask educators what they need for their own learning, and more time to collaborate with colleagues generally ranks high on the list. Educators know that when they encounter specific student learning or instructional challenges, their peers typically have insights and solutions that will be helpful. Every school has an enormous body of expertise,…

Identifying Core Mobile Learning Faculty Competencies Based Integrated Approach: A Delphi Study

ERIC Educational Resources Information Center

Elbarbary, Rafik Said

2015-01-01

This study is based on the integrated approach as a concept framework to identify, categorize, and rank a key component of mobile learning core competencies for Egyptian faculty members in higher education. The field investigation framework used four rounds Delphi technique to determine the importance rate of each component of core competencies…

Critical and Creative Thinking as Learning Processes at Top-Ranking Chinese Middle Schools: Possibilities and Required Improvements

ERIC Educational Resources Information Center

Liu, Z. K.; He, J.; Li, B.

2015-01-01

Fostering and enabling critical and creative thinking of students is considered an important goal, and it is assumed that in particular, talented students have considerable potential for applying such high-level cognitive processes for learning in classrooms. However, Chinese students are often considered as rote learners, and that learning…

36 CFR 230.5 - Ranking criteria and proposal selection.

Code of Federal Regulations, 2013 CFR

2013-07-01

..., and wildlife habitat; (iii) Benefits from forest-based experiential learning, including K-12... from serving as replicable models of effective forest stewardship for private landowners; and (v...

36 CFR 230.5 - Ranking criteria and proposal selection.

Code of Federal Regulations, 2014 CFR

2014-07-01

..., and wildlife habitat; (iii) Benefits from forest-based experiential learning, including K-12... from serving as replicable models of effective forest stewardship for private landowners; and (v...

36 CFR 230.5 - Ranking criteria and proposal selection.

Code of Federal Regulations, 2012 CFR

2012-07-01

..., and wildlife habitat; (iii) Benefits from forest-based experiential learning, including K-12... from serving as replicable models of effective forest stewardship for private landowners; and (v...

A Ranking Approach to Genomic Selection.

PubMed

Blondel, Mathieu; Onogi, Akio; Iwata, Hiroyoshi; Ueda, Naonori

2015-01-01

Genomic selection (GS) is a recent selective breeding method which uses predictive models based on whole-genome molecular markers. Until now, existing studies formulated GS as the problem of modeling an individual's breeding value for a particular trait of interest, i.e., as a regression problem. To assess predictive accuracy of the model, the Pearson correlation between observed and predicted trait values was used. In this paper, we propose to formulate GS as the problem of ranking individuals according to their breeding value. Our proposed framework allows us to employ machine learning methods for ranking which had previously not been considered in the GS literature. To assess ranking accuracy of a model, we introduce a new measure originating from the information retrieval literature called normalized discounted cumulative gain (NDCG). NDCG rewards more strongly models which assign a high rank to individuals with high breeding value. Therefore, NDCG reflects a prerequisite objective in selective breeding: accurate selection of individuals with high breeding value. We conducted a comparison of 10 existing regression methods and 3 new ranking methods on 6 datasets, consisting of 4 plant species and 25 traits. Our experimental results suggest that tree-based ensemble methods including McRank, Random Forests and Gradient Boosting Regression Trees achieve excellent ranking accuracy. RKHS regression and RankSVM also achieve good accuracy when used with an RBF kernel. Traditional regression methods such as Bayesian lasso, wBSR and BayesC were found less suitable for ranking. Pearson correlation was found to correlate poorly with NDCG. Our study suggests two important messages. First, ranking methods are a promising research direction in GS. Second, NDCG can be a useful evaluation measure for GS.

A learning framework for age rank estimation based on face images with scattering transform.

PubMed

Chang, Kuang-Yu; Chen, Chu-Song

2015-03-01

This paper presents a cost-sensitive ordinal hyperplanes ranking algorithm for human age estimation based on face images. The proposed approach exploits relative-order information among the age labels for rank prediction. In our approach, the age rank is obtained by aggregating a series of binary classification results, where cost sensitivities among the labels are introduced to improve the aggregating performance. In addition, we give a theoretical analysis on designing the cost of individual binary classifier so that the misranking cost can be bounded by the total misclassification costs. An efficient descriptor, scattering transform, which scatters the Gabor coefficients and pooled with Gaussian smoothing in multiple layers, is evaluated for facial feature extraction. We show that this descriptor is a generalization of conventional bioinspired features and is more effective for face-based age inference. Experimental results demonstrate that our method outperforms the state-of-the-art age estimation approaches.

Preparing Graduate Teaching Assistant's to Teach Introduction Geosciences in the 21st Century

NASA Astrophysics Data System (ADS)

Teasdale, R.; Monet, J.

2008-12-01

Effective teaching requires in-depth content knowledge and pedagogical understanding of the subject. Most graduate teaching assistants (GTAs) are well prepared in content, they often lack pedagogical knowledge needed to teach undergraduate students. There are no consistent, nationwide standards for preparing GTAs in the delivery of high quality instruction in the Geosciences. Without formal training on strategies to engage students in active learning, GTA's often implement a traditional approach to teaching science modeled on their own learning experiences. In the Department of Geological and Environmental Sciences at CSU Chico, every semester approximately 700 undergraduate students enroll in GE courses with required lab sections taught by GTAs. Classroom observations completed by faculty members often reveal that GTAs have a good understanding of the content, but remain entrenched in traditional approaches to teaching science. Classroom observers commonly report on the lack of undergraduate student engagement, or the instructor's inability to ask skillful questions. We view this not as a shortcoming of the GTA, but as a weakness of their preparation. This study examines the outcomes of GTA's learning in a science teaching methods course offered in Spring 2008. This one unit pilot-course was designed to introduce reformed teaching practices to GTAs. In addition to addressing the mechanics of teaching, the course focused on six areas of instruction that were identified by faculty and GTAs as important areas for improvement. Faculty instructors completed classroom visits then met with GTAs to debrief and determine numerical rankings in the areas of reform teaching practices. Rankings helped GTAs select three of the six areas of instruction as goals for the rest of the semester. In the 14th week of class, GTAs ranked themselves again. In most cases, rankings assigned early in the course by GTAs and faculty instructors were within 0.5 points (on a 4 point scale) of each other. GTA improvements of reformed teaching practices were as much as 2.5 points higher than the initial rankings, with average improvement of 0.76 points. These outcomes led to implementation of a more in- depth course for GTA's in the form of a three- unit science teaching methods course for Fall 2008.

Ranked solutions to a class of combinatorial optimizations - with applications in mass spectrometry based peptide sequencing

NASA Astrophysics Data System (ADS)

Doerr, Timothy; Alves, Gelio; Yu, Yi-Kuo

2006-03-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time. This suggests a way to efficiently find approximate solutions - - find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the fininte number of high- ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks - - peptide sequencing using tandem mass spectrometry data.

An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms

PubMed Central

Thomas, Phillip S.

2017-01-01

We propose a method for solving the vibrational Schrödinger equation with which one can compute spectra for molecules with more than ten atoms. It uses sum-of-product (SOP) basis functions stored in a canonical polyadic tensor format and generated by evaluating matrix-vector products. By doing a sequence of partial optimizations, in each of which the factors in a SOP basis function for a single coordinate are optimized, the rank of the basis functions is reduced as matrix-vector products are computed. This is better than using an alternating least squares method to reduce the rank, as is done in the reduced-rank block power method. Partial optimization is better because it speeds up the calculation by about an order of magnitude and allows one to significantly reduce the memory cost. We demonstrate the effectiveness of the new method by computing vibrational spectra of two molecules, ethylene oxide (C2H4O) and cyclopentadiene (C5H6), with 7 and 11 atoms, respectively. PMID:28571348

An intertwined method for making low-rank, sum-of-product basis functions that makes it possible to compute vibrational spectra of molecules with more than 10 atoms.

PubMed

Thomas, Phillip S; Carrington, Tucker

2017-05-28

We propose a method for solving the vibrational Schrödinger equation with which one can compute spectra for molecules with more than ten atoms. It uses sum-of-product (SOP) basis functions stored in a canonical polyadic tensor format and generated by evaluating matrix-vector products. By doing a sequence of partial optimizations, in each of which the factors in a SOP basis function for a single coordinate are optimized, the rank of the basis functions is reduced as matrix-vector products are computed. This is better than using an alternating least squares method to reduce the rank, as is done in the reduced-rank block power method. Partial optimization is better because it speeds up the calculation by about an order of magnitude and allows one to significantly reduce the memory cost. We demonstrate the effectiveness of the new method by computing vibrational spectra of two molecules, ethylene oxide (C 2 H 4 O) and cyclopentadiene (C 5 H 6 ), with 7 and 11 atoms, respectively.

Does current reporting of lung function by the UK cystic fibrosis registry allow a fair comparison of adult centres?

PubMed

Nightingale, Julia Anne; Osmond, Clive

2017-09-01

Outcome data for UK cystic fibrosis centres are publicly available in an annual report, which ranks centres by median FEV 1 % predicted. We wished to assess whether there are differences in lung function outcomes between adult centres that might imply differing standards of care. UK Registry data from 4761 subjects at 34 anonymised adult centres were used to calculate mean FEV 1 % and rate of change of lung function for 2007-13. These measures were used to rank centres and compare outcomes. There are minor differences between centres for mean FEV 1 % for some years of the study and for rate of change of lung function over the study period. However, rankings are critically dependent on the outcome measure chosen and centre variation becomes negligible once patient population characteristics are taken into account. We have demonstrated that the ranking of centres is biased and any apparent difference in respiratory outcomes is unlikely to be related to differing standards of care between centres. Copyright © 2017 European Cystic Fibrosis Society. Published by Elsevier B.V. All rights reserved.

Is extreme learning machine feasible? A theoretical assessment (part I).

PubMed

Liu, Xia; Lin, Shaobo; Fang, Jian; Xu, Zongben

2015-01-01

An extreme learning machine (ELM) is a feedforward neural network (FNN) like learning system whose connections with output neurons are adjustable, while the connections with and within hidden neurons are randomly fixed. Numerous applications have demonstrated the feasibility and high efficiency of ELM-like systems. It has, however, been open if this is true for any general applications. In this two-part paper, we conduct a comprehensive feasibility analysis of ELM. In Part I, we provide an answer to the question by theoretically justifying the following: 1) for some suitable activation functions, such as polynomials, Nadaraya-Watson and sigmoid functions, the ELM-like systems can attain the theoretical generalization bound of the FNNs with all connections adjusted, i.e., they do not degrade the generalization capability of the FNNs even when the connections with and within hidden neurons are randomly fixed; 2) the number of hidden neurons needed for an ELM-like system to achieve the theoretical bound can be estimated; and 3) whenever the activation function is taken as polynomial, the deduced hidden layer output matrix is of full column-rank, therefore the generalized inverse technique can be efficiently applied to yield the solution of an ELM-like system, and, furthermore, for the nonpolynomial case, the Tikhonov regularization can be applied to guarantee the weak regularity while not sacrificing the generalization capability. In Part II, however, we reveal a different aspect of the feasibility of ELM: there also exists some activation functions, which makes the corresponding ELM degrade the generalization capability. The obtained results underlie the feasibility and efficiency of ELM-like systems, and yield various generalizations and improvements of the systems as well.

Anomaly detection driven active learning for identifying suspicious tracks and events in WAMI video

NASA Astrophysics Data System (ADS)

Miller, David J.; Natraj, Aditya; Hockenbury, Ryler; Dunn, Katherine; Sheffler, Michael; Sullivan, Kevin

2012-06-01

We describe a comprehensive system for learning to identify suspicious vehicle tracks from wide-area motion (WAMI) video. First, since the road network for the scene of interest is assumed unknown, agglomerative hierarchical clustering is applied to all spatial vehicle measurements, resulting in spatial cells that largely capture individual road segments. Next, for each track, both at the cell (speed, acceleration, azimuth) and track (range, total distance, duration) levels, extreme value feature statistics are both computed and aggregated, to form summary (p-value based) anomaly statistics for each track. Here, to fairly evaluate tracks that travel across different numbers of spatial cells, for each cell-level feature type, a single (most extreme) statistic is chosen, over all cells traveled. Finally, a novel active learning paradigm, applied to a (logistic regression) track classifier, is invoked to learn to distinguish suspicious from merely anomalous tracks, starting from anomaly-ranked track prioritization, with ground-truth labeling by a human operator. This system has been applied to WAMI video data (ARGUS), with the tracks automatically extracted by a system developed in-house at Toyon Research Corporation. Our system gives promising preliminary results in highly ranking as suspicious aerial vehicles, dismounts, and traffic violators, and in learning which features are most indicative of suspicious tracks.

Automatic vetting of planet candidates from ground based surveys: Machine learning with NGTS

NASA Astrophysics Data System (ADS)

Armstrong, David J.; Günther, Maximilian N.; McCormac, James; Smith, Alexis M. S.; Bayliss, Daniel; Bouchy, François; Burleigh, Matthew R.; Casewell, Sarah; Eigmüller, Philipp; Gillen, Edward; Goad, Michael R.; Hodgkin, Simon T.; Jenkins, James S.; Louden, Tom; Metrailler, Lionel; Pollacco, Don; Poppenhaeger, Katja; Queloz, Didier; Raynard, Liam; Rauer, Heike; Udry, Stéphane; Walker, Simon R.; Watson, Christopher A.; West, Richard G.; Wheatley, Peter J.

2018-05-01

State of the art exoplanet transit surveys are producing ever increasing quantities of data. To make the best use of this resource, in detecting interesting planetary systems or in determining accurate planetary population statistics, requires new automated methods. Here we describe a machine learning algorithm that forms an integral part of the pipeline for the NGTS transit survey, demonstrating the efficacy of machine learning in selecting planetary candidates from multi-night ground based survey data. Our method uses a combination of random forests and self-organising-maps to rank planetary candidates, achieving an AUC score of 97.6% in ranking 12368 injected planets against 27496 false positives in the NGTS data. We build on past examples by using injected transit signals to form a training set, a necessary development for applying similar methods to upcoming surveys. We also make the autovet code used to implement the algorithm publicly accessible. autovet is designed to perform machine learned vetting of planetary candidates, and can utilise a variety of methods. The apparent robustness of machine learning techniques, whether on space-based or the qualitatively different ground-based data, highlights their importance to future surveys such as TESS and PLATO and the need to better understand their advantages and pitfalls in an exoplanetary context.

Manifold regularized matrix completion for multi-label learning with ADMM.

PubMed

Liu, Bin; Li, Yingming; Xu, Zenglin

2018-05-01

Multi-label learning is a common machine learning problem arising from numerous real-world applications in diverse fields, e.g, natural language processing, bioinformatics, information retrieval and so on. Among various multi-label learning methods, the matrix completion approach has been regarded as a promising approach to transductive multi-label learning. By constructing a joint matrix comprising the feature matrix and the label matrix, the missing labels of test samples are regarded as missing values of the joint matrix. With the low-rank assumption of the constructed joint matrix, the missing labels can be recovered by minimizing its rank. Despite its success, most matrix completion based approaches ignore the smoothness assumption of unlabeled data, i.e., neighboring instances should also share a similar set of labels. Thus they may under exploit the intrinsic structures of data. In addition, the matrix completion problem can be less efficient. To this end, we propose to efficiently solve the multi-label learning problem as an enhanced matrix completion model with manifold regularization, where the graph Laplacian is used to ensure the label smoothness over it. To speed up the convergence of our model, we develop an efficient iterative algorithm, which solves the resulted nuclear norm minimization problem with the alternating direction method of multipliers (ADMM). Experiments on both synthetic and real-world data have shown the promising results of the proposed approach. Copyright © 2018 Elsevier Ltd. All rights reserved.

Phenotypic plasticity to light and nutrient availability alters functional trait ranking across eight perennial grassland species.

PubMed

Siebenkäs, Alrun; Schumacher, Jens; Roscher, Christiane

2015-03-27

Functional traits are often used as species-specific mean trait values in comparative plant ecology or trait-based predictions of ecosystem processes, assuming that interspecific differences are greater than intraspecific trait variation and that trait-based ranking of species is consistent across environments. Although this assumption is increasingly challenged, there is a lack of knowledge regarding to what degree the extent of intraspecific trait variation in response to varying environmental conditions depends on the considered traits and the characteristics of the studied species to evaluate the consequences for trait-based species ranking. We studied functional traits of eight perennial grassland species classified into different functional groups (forbs vs. grasses) and varying in their inherent growth stature (tall vs. small) in a common garden experiment with different environments crossing three levels of nutrient availability and three levels of light availability over 4 months of treatment applications. Grasses and forbs differed in almost all above- and belowground traits, while trait differences related to growth stature were generally small. The traits showing the strongest responses to resource availability were similarly for grasses and forbs those associated with allocation and resource uptake. The strength of trait variation in response to varying resource availability differed among functional groups (grasses > forbs) and species of varying growth stature (small-statured > tall-statured species) in many aboveground traits, but only to a lower extent in belowground traits. These differential responses altered trait-based species ranking in many aboveground traits, such as specific leaf area, tissue nitrogen and carbon concentrations and above-belowground allocation (leaf area ratio and root : shoot ratio) at varying resource supply, while trait-based species ranking was more consistent in belowground traits. Our study shows that species grouping according to functional traits is valid, but trait-based species ranking depends on environmental conditions, thus limiting the applicability of species-specific mean trait values in ecological studies. Published by Oxford University Press on behalf of the Annals of Botany Company.

PEACE: pulsar evaluation algorithm for candidate extraction - a software package for post-analysis processing of pulsar survey candidates

NASA Astrophysics Data System (ADS)

Lee, K. J.; Stovall, K.; Jenet, F. A.; Martinez, J.; Dartez, L. P.; Mata, A.; Lunsford, G.; Cohen, S.; Biwer, C. M.; Rohr, M.; Flanigan, J.; Walker, A.; Banaszak, S.; Allen, B.; Barr, E. D.; Bhat, N. D. R.; Bogdanov, S.; Brazier, A.; Camilo, F.; Champion, D. J.; Chatterjee, S.; Cordes, J.; Crawford, F.; Deneva, J.; Desvignes, G.; Ferdman, R. D.; Freire, P.; Hessels, J. W. T.; Karuppusamy, R.; Kaspi, V. M.; Knispel, B.; Kramer, M.; Lazarus, P.; Lynch, R.; Lyne, A.; McLaughlin, M.; Ransom, S.; Scholz, P.; Siemens, X.; Spitler, L.; Stairs, I.; Tan, M.; van Leeuwen, J.; Zhu, W. W.

2013-07-01

Modern radio pulsar surveys produce a large volume of prospective candidates, the majority of which are polluted by human-created radio frequency interference or other forms of noise. Typically, large numbers of candidates need to be visually inspected in order to determine if they are real pulsars. This process can be labour intensive. In this paper, we introduce an algorithm called Pulsar Evaluation Algorithm for Candidate Extraction (PEACE) which improves the efficiency of identifying pulsar signals. The algorithm ranks the candidates based on a score function. Unlike popular machine-learning-based algorithms, no prior training data sets are required. This algorithm has been applied to data from several large-scale radio pulsar surveys. Using the human-based ranking results generated by students in the Arecibo Remote Command Center programme, the statistical performance of PEACE was evaluated. It was found that PEACE ranked 68 per cent of the student-identified pulsars within the top 0.17 per cent of sorted candidates, 95 per cent within the top 0.34 per cent and 100 per cent within the top 3.7 per cent. This clearly demonstrates that PEACE significantly increases the pulsar identification rate by a factor of about 50 to 1000. To date, PEACE has been directly responsible for the discovery of 47 new pulsars, 5 of which are millisecond pulsars that may be useful for pulsar timing based gravitational-wave detection projects.

Transitive inference in two lemur species (Eulemur macaco and Eulemur fulvus).

PubMed

Tromp, D; Meunier, H; Roeder, J J

2015-03-01

When confronted with tasks involving reasoning instead of simple learning through trial and error, lemurs appeared to be less competent than simians. Our study aims to investigate lemurs' capability for transitive inference, a form of deductive reasoning in which the subject deduces logical conclusions from preliminary information. Transitive inference may have an adaptative function, especially in species living in large, complex social groups and is proposed to play a major role in rank estimation and establishment of dominance hierarchies. We proposed to test the capacities of reasoning using transitive inference in two species of lemurs, the brown lemur (Eulemur fulvus) and the black lemur (Eulemur macaco), both living in multimale-multifemale societies. For that purpose, we designed an original setup providing, for the first time in this kind of cognitive task, pictures of conspecifics' faces as stimuli. Subjects were trained to differentiate six photographs of unknown conspecifics named randomly from A to F to establish the order A > B > C > D > E > F and select consistently the highest-ranking photograph in five adjacent pairs AB, BC, CD, DE, and EF. Then lemurs were presented with the same adjacent pairs and three new and non-adjacent pairs BD, BE, CE. The results showed that all subjects correctly selected the highest-ranking photograph in every non-adjacent pair, reflecting lemurs' capacity for transitive inference. Our results are discussed in the context of the still debated current theories about the mechanisms underlying this specific capacity. © 2014 Wiley Periodicals, Inc.

7 CFR 633.5 - Application procedures.

Code of Federal Regulations, 2011 CFR

2011-01-01

... ranking criteria and limit the approval of requests for agreements in accordance with the ranking scheme... of matching funds, significance of wetland functions and values, and estimated success of protection...

Resolution of ranking hierarchies in directed networks.

PubMed

Letizia, Elisa; Barucca, Paolo; Lillo, Fabrizio

2018-01-01

Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit.

Resolution of ranking hierarchies in directed networks

PubMed Central

Barucca, Paolo; Lillo, Fabrizio

2018-01-01

Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit. PMID:29394278

Functional form and risk adjustment of hospital costs: Bayesian analysis of a Box-Cox random coefficients model.

PubMed

Hollenbeak, Christopher S

2005-10-15

While risk-adjusted outcomes are often used to compare the performance of hospitals and physicians, the most appropriate functional form for the risk adjustment process is not always obvious for continuous outcomes such as costs. Semi-log models are used most often to correct skewness in cost data, but there has been limited research to determine whether the log transformation is sufficient or whether another transformation is more appropriate. This study explores the most appropriate functional form for risk-adjusting the cost of coronary artery bypass graft (CABG) surgery. Data included patients undergoing CABG surgery at four hospitals in the midwest and were fit to a Box-Cox model with random coefficients (BCRC) using Markov chain Monte Carlo methods. Marginal likelihoods and Bayes factors were computed to perform model comparison of alternative model specifications. Rankings of hospital performance were created from the simulation output and the rankings produced by Bayesian estimates were compared to rankings produced by standard models fit using classical methods. Results suggest that, for these data, the most appropriate functional form is not logarithmic, but corresponds to a Box-Cox transformation of -1. Furthermore, Bayes factors overwhelmingly rejected the natural log transformation. However, the hospital ranking induced by the BCRC model was not different from the ranking produced by maximum likelihood estimates of either the linear or semi-log model. Copyright (c) 2005 John Wiley & Sons, Ltd.

Peer-to-Peer Learning and the Army Learning Model

DTIC Science & Technology

2012-06-08

their goals. 4. Capability to operate and provide advice at the national level. 5. Cultural astuteness and ability to use this awareness and...Joint and cultural context of the Operating Environment, collaborative skills are required. This survey finds that collaboration among peers ranked...and engagement (oral, written, negotiation) • Critical thinking and problem solving • Cultural and joint, interagency, intergovernmental, and

Learning, Interactional, and Motivational Outcomes in One-to-One Synchronous Computer-Mediated versus Face-to-Face Tutoring

ERIC Educational Resources Information Center

Siler, Stephanie Ann; VanLehn, Kurt

2009-01-01

Face-to-face (FTF) human-human tutoring has ranked among the most effective forms of instruction. However, because computer-mediated (CM) tutoring is becoming increasingly common, it is instructive to evaluate its effectiveness relative to face-to-face tutoring. Does the lack of spoken, face-to-face interaction affect learning gains and…

Working to Learn, Learning to Work: Unlocking the Potential of New York's Adult College Students

ERIC Educational Resources Information Center

Hilliard, Tom; Schimke, Karen, Ed.; Bowles, Jonathan, Ed.

2007-01-01

The vitality of New York State's economy depends on deepening the ranks of the skilled workforce, a need that will grow more urgent over the next several years as the Baby Boomer generation moves into retirement. If employers cannot fill high-skilled positions they will lose competitive ground, and some may leave. New York has successfully…

The Teaching and Learning of Spelling in the Spanish Heritage Language Classroom: Mastering Written Accent Marks

ERIC Educational Resources Information Center

Beaudrie, Sara M.

2017-01-01

Spanish spelling, especially the use of written accent marks, is a major stumbling block for Spanish heritage language (SHL) learners (Carreira 2002). In fact, Mikulski (2006) found that most SHL learners ranked bettering their spelling and grammar as a very important learning goal. Despite its importance in literacy development and its perceived…

What Will They Learn? 2012-13. A Survey of Core Requirements at Our Nation's Colleges and Universities

ERIC Educational Resources Information Center

Kempson, Lauri; Bako, Tom; Lewin, Greg

2012-01-01

The American Council of Trustees and Alumni (ACTA) has released "What Will They Learn? 2012-13," the fourth edition, evaluating the general education requirements at 1,070 colleges and universities. Unlike other college rankings, ACTA does not consider an institution's wealth, prestige, or popularity. Rather, ACTA rates institutions…

Enhancing College Students' Life Skills through Project Based Learning

ERIC Educational Resources Information Center

Wurdinger, Scott; Qureshi, Mariam

2015-01-01

This study examined whether life skills could be developed in a Project Based Learning (PBL) course. The participants were students enrolled in a graduate level PBL course. The same 35-question survey was given to students at the beginning and end of the course, and students were asked to rank their life skills using a Likert scale. Additionally,…

Learning context-sensitive shape similarity by graph transduction.

PubMed

Bai, Xiang; Yang, Xingwei; Latecki, Longin Jan; Liu, Wenyu; Tu, Zhuowen

2010-05-01

Shape similarity and shape retrieval are very important topics in computer vision. The recent progress in this domain has been mostly driven by designing smart shape descriptors for providing better similarity measure between pairs of shapes. In this paper, we provide a new perspective to this problem by considering the existing shapes as a group, and study their similarity measures to the query shape in a graph structure. Our method is general and can be built on top of any existing shape similarity measure. For a given similarity measure, a new similarity is learned through graph transduction. The new similarity is learned iteratively so that the neighbors of a given shape influence its final similarity to the query. The basic idea here is related to PageRank ranking, which forms a foundation of Google Web search. The presented experimental results demonstrate that the proposed approach yields significant improvements over the state-of-art shape matching algorithms. We obtained a retrieval rate of 91.61 percent on the MPEG-7 data set, which is the highest ever reported in the literature. Moreover, the learned similarity by the proposed method also achieves promising improvements on both shape classification and shape clustering.

Object Classification With Joint Projection and Low-Rank Dictionary Learning.

PubMed

Foroughi, Homa; Ray, Nilanjan; Hong Zhang

2018-02-01

For an object classification system, the most critical obstacles toward real-world applications are often caused by large intra-class variability, arising from different lightings, occlusion, and corruption, in limited sample sets. Most methods in the literature would fail when the training samples are heavily occluded, corrupted or have significant illumination or viewpoint variations. Besides, most of the existing methods and especially deep learning-based methods, need large training sets to achieve a satisfactory recognition performance. Although using the pre-trained network on a generic large-scale data set and fine-tune it to the small-sized target data set is a widely used technique, this would not help when the content of base and target data sets are very different. To address these issues simultaneously, we propose a joint projection and low-rank dictionary learning method using dual graph constraints. Specifically, a structured class-specific dictionary is learned in the low-dimensional space, and the discrimination is further improved by imposing a graph constraint on the coding coefficients, that maximizes the intra-class compactness and inter-class separability. We enforce structural incoherence and low-rank constraints on sub-dictionaries to reduce the redundancy among them, and also make them robust to variations and outliers. To preserve the intrinsic structure of data, we introduce a supervised neighborhood graph into the framework to make the proposed method robust to small-sized and high-dimensional data sets. Experimental results on several benchmark data sets verify the superior performance of our method for object classification of small-sized data sets, which include a considerable amount of different kinds of variation, and may have high-dimensional feature vectors.

National Center on Family Homelessness

MedlinePlus

... national data sets and our own research, we rank states in four domains from 1 (high) to ... Education and Career Readiness Health and Wellness Adult Learning and the Workforce International Client Services Student Assessment ...

Local Functional Connectivity as a Pre-Surgical Tool for Seizure Focus Identification in Non-Lesion, Focal Epilepsy

PubMed Central

Weaver, K. E.; Chaovalitwongse, W. A.; Novotny, E. J.; Poliakov, A.; Grabowski, T. G.; Ojemann, J. G.

2013-01-01

Successful resection of cortical tissue engendering seizure activity is efficacious for the treatment of refractory, focal epilepsy. The pre-operative localization of the seizure focus is therefore critical to yielding positive, post-operative outcomes. In a small proportion of focal epilepsy patients presenting with normal MRI, identification of the seizure focus is significantly more challenging. We examined the capacity of resting state functional MRI (rsfMRI) to identify the seizure focus in a group of four non-lesion, focal (NLF) epilepsy individuals. We predicted that computing patterns of local functional connectivity in and around the epileptogenic zone combined with a specific reference to the corresponding region within the contralateral hemisphere would reliably predict the location of the seizure focus. We first averaged voxel-wise regional homogeneity (ReHo) across regions of interest (ROIs) from a standardized, probabilistic atlas for each NLF subject as well as 16 age- and gender-matched controls. To examine contralateral effects, we computed a ratio of the mean pair-wise correlations of all voxels within a ROI with the corresponding contralateral region (IntraRegional Connectivity – IRC). For each subject, ROIs were ranked (from lowest to highest) on ReHo, IRC, and the mean of the two values. At the group level, we observed a significant decrease in the rank for ROI harboring the seizure focus for the ReHo rankings as well as for the mean rank. At the individual level, the seizure focus ReHo rank was within bottom 10% lowest ranked ROIs for all four NLF epilepsy patients and three out of the four for the IRC rankings. However, when the two ranks were combined (averaging across ReHo and IRC ranks and scalars), the seizure focus ROI was either the lowest or second lowest ranked ROI for three out of the four epilepsy subjects. This suggests that rsfMRI may serve as an adjunct pre-surgical tool, facilitating the identification of the seizure focus in focal epilepsy. PMID:23641233

Ranking of patient and surgeons' perspectives for endpoints in randomized controlled trials--lessons learned from the POVATI trial [ISRCTN 60734227].

PubMed

Fischer, Lars; Deckert, Andreas; Diener, Markus K; Zimmermann, Johannes B; Büchler, Markus W; Seiler, Christoph M

2011-10-01

Surgical trials focus mainly on mortality and morbidity rates, which may be not the most important endpoints from the patient's perspective. Evaluation of expectations and needs of patients enrolled in clinical trials can be analyzed using a procedure called ranking. Within the Postsurgical Pain Outcome of Vertical and Transverse Abdominal Incision randomized trial (POVATI), the perspectives of participating patients and surgeons were assessed as well as the influence of the surgical intervention on patients' needs. All included patients of the POVATI trial were asked preoperatively and postoperatively to rank predetermined outcome variables concerning the upcoming surgical procedure (e.g., pain, complication, cosmetic result) hierarchically according to their importance. Preoperatively, the surgeons were asked to do the same. One hundred eighty two out of 200 randomized patients (71 females, 111 males; mean age 59 years) returned the ranking questionnaire preoperatively and 152 patients (67 females, 85 males; mean age 60 years) on the day of discharge. There were no differences between the two groups with respect to the distribution of ranking variables (p > 0.05). Thirty-five surgeons (7 residents, 6 fellows, and 22 consultants) completed the same ranking questionnaire. The order of the four most important ranking variables for both patients and surgeons were death, avoiding of postoperative complications, avoiding of intraoperative complications, and pain. Surgeons ranked the variable "cosmetic result" significantly as more important compared to patients (p = 0.034, Fisher's exact test). Patients and surgeons did not differ in ranking predetermined outcomes in the POVATI trial. Only the variable "cosmetic result" is significantly more important from the surgeon's than from the patient's perspective. Ranking of outcomes might be a beneficial tool and can be a proper addition to RCTs.

Ranking Hearing Aid Input-Output Functions for Understanding Low-, Conversational-, and High-Level Speech in Multitalker Babble

ERIC Educational Resources Information Center

Chung, King; Killion, Mead C.; Christensen, Laurel A.

2007-01-01

Purpose: To determine the rankings of 6 input-output functions for understanding low-level, conversational, and high-level speech in multitalker babble without manipulating volume control for listeners with normal hearing, flat sensorineural hearing loss, and mildly sloping sensorineural hearing loss. Method: Peak clipping, compression limiting,…

Early play may predict later dominance relationships in yellow-bellied marmots (Marmota flaviventris).

PubMed

Blumstein, Daniel T; Chung, Lawrance K; Smith, Jennifer E

2013-05-22

Play has been defined as apparently functionless behaviour, yet since play is costly, models of adaptive evolution predict that it should have some beneficial function (or functions) that outweigh its costs. We provide strong evidence for a long-standing, but poorly supported hypothesis: that early social play is practice for later dominance relationships. We calculated the relative dominance rank by observing the directional outcome of playful interactions in juvenile and yearling yellow-bellied marmots (Marmota flaviventris) and found that these rank relationships were correlated with later dominance ranks calculated from agonistic interactions, however, the strength of this relationship attenuated over time. While play may have multiple functions, one of them may be to establish later dominance relationships in a minimally costly way.

Functional complexity and ecosystem stability: an experimental approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Van Voris, P.; O'Neill, R.V.; Shugart, H.H.

1978-01-01

The complexity-stability hypothesis was experimentally tested using intact terrestrial microcosms. Functional complexity was defined as the number and significance of component interactions (i.e., population interactions, physical-chemical reactions, biological turnover rates) influenced by nonlinearities, feedbacks, and time delays. It was postulated that functional complexity could be nondestructively measured through analysis of a signal generated from the system. Power spectral analysis of hourly CO/sub 2/ efflux, from eleven old-field microcosms, was analyzed for the number of low frequency peaks and used to rank the functional complexity of each system. Ranking of ecosystem stability was based on the capacity of the system tomore » retain essential nutrients and was measured by net loss of Ca after the system was stressed. Rank correlation supported the hypothesis that increasing ecosystem functional complexity leads to increasing ecosystem stability. The results indicated that complex functional dynamics can serve to stabilize the system. The results also demonstrated that microcosms are useful tools for system-level investigations.« less

Computations Underlying Social Hierarchy Learning: Distinct Neural Mechanisms for Updating and Representing Self-Relevant Information.

PubMed

Kumaran, Dharshan; Banino, Andrea; Blundell, Charles; Hassabis, Demis; Dayan, Peter

2016-12-07

Knowledge about social hierarchies organizes human behavior, yet we understand little about the underlying computations. Here we show that a Bayesian inference scheme, which tracks the power of individuals, better captures behavioral and neural data compared with a reinforcement learning model inspired by rating systems used in games such as chess. We provide evidence that the medial prefrontal cortex (MPFC) selectively mediates the updating of knowledge about one's own hierarchy, as opposed to that of another individual, a process that underpinned successful performance and involved functional interactions with the amygdala and hippocampus. In contrast, we observed domain-general coding of rank in the amygdala and hippocampus, even when the task did not require it. Our findings reveal the computations underlying a core aspect of social cognition and provide new evidence that self-relevant information may indeed be afforded a unique representational status in the brain. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

A Measurement of AFIT Contracting and Acquisition Management Program Usefulness as Perceived by Graduates and Their Supervisors.

DTIC Science & Technology

1982-09-01

21 functions. The legal category covers the business, commer- cial and contract law fields, including patents and royalties, technical data, claims...Course Rankings Question # Subject Area Median Rank 55,56,59 Contract Management Theory 7.0 1 53,54 Contract Law 6.5 2 So Contracting & Acquis. Mgt...respondents ranked Contract Management Theory as the most useful course among all courses in the AFIT CAM curriculum. Graduates ranked Contract Law as

A Universal Rank-Size Law

PubMed Central

2016-01-01

A mere hyperbolic law, like the Zipf’s law power function, is often inadequate to describe rank-size relationships. An alternative theoretical distribution is proposed based on theoretical physics arguments starting from the Yule-Simon distribution. A modeling is proposed leading to a universal form. A theoretical suggestion for the “best (or optimal) distribution”, is provided through an entropy argument. The ranking of areas through the number of cities in various countries and some sport competition ranking serves for the present illustrations. PMID:27812192

Generalized Higher Order Orthogonal Iteration for Tensor Learning and Decomposition.

PubMed

Liu, Yuanyuan; Shang, Fanhua; Fan, Wei; Cheng, James; Cheng, Hong

2016-12-01

Low-rank tensor completion (LRTC) has successfully been applied to a wide range of real-world problems. Despite the broad, successful applications, existing LRTC methods may become very slow or even not applicable for large-scale problems. To address this issue, a novel core tensor trace-norm minimization (CTNM) method is proposed for simultaneous tensor learning and decomposition, and has a much lower computational complexity. In our solution, first, the equivalence relation of trace norm of a low-rank tensor and its core tensor is induced. Second, the trace norm of the core tensor is used to replace that of the whole tensor, which leads to two much smaller scale matrix TNM problems. Finally, an efficient alternating direction augmented Lagrangian method is developed to solve our problems. Our CTNM formulation needs only O((R N +NRI)log(√{I N })) observations to reliably recover an N th-order I×I×…×I tensor of n -rank (r,r,…,r) , compared with O(rI N-1 ) observations required by those tensor TNM methods ( I > R ≥ r ). Extensive experimental results show that CTNM is usually more accurate than them, and is orders of magnitude faster.

Rank preserving sparse learning for Kinect based scene classification.

PubMed

Tao, Dapeng; Jin, Lianwen; Yang, Zhao; Li, Xuelong

2013-10-01

With the rapid development of the RGB-D sensors and the promptly growing population of the low-cost Microsoft Kinect sensor, scene classification, which is a hard, yet important, problem in computer vision, has gained a resurgence of interest recently. That is because the depth of information provided by the Kinect sensor opens an effective and innovative way for scene classification. In this paper, we propose a new scheme for scene classification, which applies locality-constrained linear coding (LLC) to local SIFT features for representing the RGB-D samples and classifies scenes through the cooperation between a new rank preserving sparse learning (RPSL) based dimension reduction and a simple classification method. RPSL considers four aspects: 1) it preserves the rank order information of the within-class samples in a local patch; 2) it maximizes the margin between the between-class samples on the local patch; 3) the L1-norm penalty is introduced to obtain the parsimony property; and 4) it models the classification error minimization by utilizing the least-squares error minimization. Experiments are conducted on the NYU Depth V1 dataset and demonstrate the robustness and effectiveness of RPSL for scene classification.

76 FR 19951 - Submission for OMB Review; Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2011-04-11

... Appropriations Act (Pub. L. 108- 7) provided grant funds in the Distance Learning and Telemedicine Grant Program... information to score and rank applications for funding. Scoring will consist of three categories: Rurality...

The use of team-based, guided inquiry learning to overcome educational disadvantages in learning human physiology: a structural equation model.

PubMed

Rathner, Joseph A; Byrne, Graeme

2014-09-01

The study of human bioscience is viewed as a crucial curriculum in allied health. Nevertheless, bioscience (and particularly physiology) is notoriously difficult for undergraduates, particularly academically disadvantaged students. So endemic are the high failure rates (particularly in nursing) that it has come to be known as "the human bioscience problem." In the present report, we describe the outcomes for individual success in studying first-year human physiology in a subject that emphasises team-based active learning as the major pedagogy for mastering subject learning outcomes. Structural equation modeling was used to develop a model of the impact team learning had on individual performance. Modeling was consistent with the idea that students with similar academic abilities (as determined by tertiary entrance rank) were advantaged (scored higher on individual assessment items) by working in strong teams (teams that scored higher in team-based assessments). Analysis of covariance revealed that students who studied the subject with active learning as the major mode of learning activities outperformed students who studied the subject using the traditional didactic teaching format (lectures and tutorials, P = 0.000). After adjustment for tertiary entrance rank (via analysis of covariance) on two individual tests (the final exam and a late-semester in-class test), individual student grades improved by 8% (95% confidence interval: 6-10%) and 12% (95% confidence interval: 10-14%) when students engaged in team-based active learning. These data quantitatively support the notion that weaker students working in strong teams can overcome their educational disadvantages. Copyright © 2014 The American Physiological Society.

Effects of a blended learning module on self-reported learning performances in baccalaureate nursing students.

PubMed

Hsu, Li-Ling; Hsieh, Suh-Ing

2011-11-01

This article is a report of a quasi-experimental study of the effects of blended modules on nursing students' learning of ethics course content. There is yet to be an empirically supported mix of strategies on which a working blended learning model can be built for nursing education. This was a two-group pretest and post-test quasi-experimental study in 2008 involving a total of 233 students. Two of the five clusters were designated the experimental group to experience a blended learning model, and the rest were designated the control group to be given classroom lectures only. The Case Analysis Attitude Scale, Case Analysis Self-Evaluation Scale, Blended Learning Satisfaction Scale, and Metacognition Scale were used in pretests and post-tests for the students to rate their own performance. In this study, the experimental group did not register significantly higher mean scores on the Case Analysis Attitude Scale at post-test and higher mean ranks on the Case Analysis Self-Evaluation Scale, the Blended Learning Satisfaction Scale, and the Metacognition Scale at post-test than the control group. Moreover, the experimental group registered significant progress in the mean ranks on the Case Analysis Self-Evaluation Scale and the Metacognition Scale from pretest to post-test. No between-subjects effects of four scales at post-test were found. Newly developed course modules, be it blended learning or a combination of traditional and innovative components, should be tested repeatedly for effectiveness and popularity for the purpose of facilitating the ultimate creation of a most effective course module for nursing education. © 2011 Blackwell Publishing Ltd.

The use of team-based, guided inquiry learning to overcome educational disadvantages in learning human physiology: a structural equation model

PubMed Central

Byrne, Graeme

2014-01-01

The study of human bioscience is viewed as a crucial curriculum in allied health. Nevertheless, bioscience (and particularly physiology) is notoriously difficult for undergraduates, particularly academically disadvantaged students. So endemic are the high failure rates (particularly in nursing) that it has come to be known as “the human bioscience problem.” In the present report, we describe the outcomes for individual success in studying first-year human physiology in a subject that emphasises team-based active learning as the major pedagogy for mastering subject learning outcomes. Structural equation modeling was used to develop a model of the impact team learning had on individual performance. Modeling was consistent with the idea that students with similar academic abilities (as determined by tertiary entrance rank) were advantaged (scored higher on individual assessment items) by working in strong teams (teams that scored higher in team-based assessments). Analysis of covariance revealed that students who studied the subject with active learning as the major mode of learning activities outperformed students who studied the subject using the traditional didactic teaching format (lectures and tutorials, P = 0.000). After adjustment for tertiary entrance rank (via analysis of covariance) on two individual tests (the final exam and a late-semester in-class test), individual student grades improved by 8% (95% confidence interval: 6–10%) and 12% (95% confidence interval: 10–14%) when students engaged in team-based active learning. These data quantitatively support the notion that weaker students working in strong teams can overcome their educational disadvantages. PMID:25179611

PageRank and rank-reversal dependence on the damping factor

NASA Astrophysics Data System (ADS)

Son, S.-W.; Christensen, C.; Grassberger, P.; Paczuski, M.

2012-12-01

PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d0=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d0.

Adaptive Comparative Judgment: A Tool to Support Students' Assessment Literacy.

PubMed

Rhind, Susan M; Hughes, Kirsty J; Yool, Donald; Shaw, Darren; Kerr, Wesley; Reed, Nicki

Comparative judgment in assessment is a process whereby repeated comparison of two items (e.g., assessment answers) can allow an accurate ranking of all the submissions to be achieved. In adaptive comparative judgment (ACJ), technology is used to automate the process and present pairs of pieces of work over iterative cycles. An online ACJ system was used to present students with work prepared by a previous cohort at the same stage of their studies. Objective marks given to the work by experienced faculty were compared to the rankings given to the work by a cohort of veterinary students (n=154). Each student was required to review and judge 20 answers provided by the previous cohort to a free-text short answer question. The time that students spent on the judgment tasks was recorded, and students were asked to reflect on their experiences after engaging with the task. There was a strong positive correlation between student ranking and faculty marking. A weak positive correlation was found between the time students spent on the judgments and their performance on the part of their own examination that contained questions in the same format. Slightly less than half of the students agreed that the exercise was a good use of their time, but 78% agreed that they had learned from the process. Qualitative data highlighted different levels of benefit from the simplest aspect of learning more about the topic to an appreciation of the more generic lessons to be learned.

MQAPRank: improved global protein model quality assessment by learning-to-rank.

PubMed

Jing, Xiaoyang; Dong, Qiwen

2017-05-25

Protein structure prediction has achieved a lot of progress during the last few decades and a greater number of models for a certain sequence can be predicted. Consequently, assessing the qualities of predicted protein models in perspective is one of the key components of successful protein structure prediction. Over the past years, a number of methods have been developed to address this issue, which could be roughly divided into three categories: single methods, quasi-single methods and clustering (or consensus) methods. Although these methods achieve much success at different levels, accurate protein model quality assessment is still an open problem. Here, we present the MQAPRank, a global protein model quality assessment program based on learning-to-rank. The MQAPRank first sorts the decoy models by using single method based on learning-to-rank algorithm to indicate their relative qualities for the target protein. And then it takes the first five models as references to predict the qualities of other models by using average GDT_TS scores between reference models and other models. Benchmarked on CASP11 and 3DRobot datasets, the MQAPRank achieved better performances than other leading protein model quality assessment methods. Recently, the MQAPRank participated in the CASP12 under the group name FDUBio and achieved the state-of-the-art performances. The MQAPRank provides a convenient and powerful tool for protein model quality assessment with the state-of-the-art performances, it is useful for protein structure prediction and model quality assessment usages.

Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination.

PubMed

Zhao, Qibin; Zhang, Liqing; Cichocki, Andrzej

2015-09-01

CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem especially for CP rank . In addition, existing approaches do not take into account uncertainty information of latent factors, as well as missing entries. To address these issues, we formulate CP factorization using a hierarchical probabilistic model and employ a fully Bayesian treatment by incorporating a sparsity-inducing prior over multiple latent factors and the appropriate hyperpriors over all hyperparameters, resulting in automatic rank determination. To learn the model, we develop an efficient deterministic Bayesian inference algorithm, which scales linearly with data size. Our method is characterized as a tuning parameter-free approach, which can effectively infer underlying multilinear factors with a low-rank constraint, while also providing predictive distributions over missing entries. Extensive simulations on synthetic data illustrate the intrinsic capability of our method to recover the ground-truth of CP rank and prevent the overfitting problem, even when a large amount of entries are missing. Moreover, the results from real-world applications, including image inpainting and facial image synthesis, demonstrate that our method outperforms state-of-the-art approaches for both tensor factorization and tensor completion in terms of predictive performance.

Social justice in education: how the function of selection in educational institutions predicts support for (non)egalitarian assessment practices

PubMed Central

Autin, Frédérique; Batruch, Anatolia; Butera, Fabrizio

2015-01-01

Educational institutions are considered a keystone for the establishment of a meritocratic society. They supposedly serve two functions: an educational function that promotes learning for all, and a selection function that sorts individuals into different programs, and ultimately social positions, based on individual merit. We study how the function of selection relates to support for assessment practices known to harm vs. benefit lower status students, through the perceived justice principles underlying these practices. We study two assessment practices: normative assessment—focused on ranking and social comparison, known to hinder the success of lower status students—and formative assessment—focused on learning and improvement, known to benefit lower status students. Normative assessment is usually perceived as relying on an equity principle, with rewards being allocated based on merit and should thus appear as positively associated with the function of selection. Formative assessment is usually perceived as relying on corrective justice that aims to ensure equality of outcomes by considering students’ needs, which makes it less suitable for the function of selection. A questionnaire measuring these constructs was administered to university students. Results showed that believing that education is intended to select the best students positively predicts support for normative assessment, through increased perception of its reliance on equity, and negatively predicts support for formative assessment, through reduced perception of its ability to establish corrective justice. This study suggests that the belief in the function of selection as inherent to educational institutions can contribute to the reproduction of social inequalities by preventing change from assessment practices known to disadvantage lower-status student, namely normative assessment, to more favorable practices, namely formative assessment, and by promoting matching beliefs in justice principles. PMID:26097460

Social justice in education: how the function of selection in educational institutions predicts support for (non)egalitarian assessment practices.

PubMed

Autin, Frédérique; Batruch, Anatolia; Butera, Fabrizio

2015-01-01

Educational institutions are considered a keystone for the establishment of a meritocratic society. They supposedly serve two functions: an educational function that promotes learning for all, and a selection function that sorts individuals into different programs, and ultimately social positions, based on individual merit. We study how the function of selection relates to support for assessment practices known to harm vs. benefit lower status students, through the perceived justice principles underlying these practices. We study two assessment practices: normative assessment-focused on ranking and social comparison, known to hinder the success of lower status students-and formative assessment-focused on learning and improvement, known to benefit lower status students. Normative assessment is usually perceived as relying on an equity principle, with rewards being allocated based on merit and should thus appear as positively associated with the function of selection. Formative assessment is usually perceived as relying on corrective justice that aims to ensure equality of outcomes by considering students' needs, which makes it less suitable for the function of selection. A questionnaire measuring these constructs was administered to university students. Results showed that believing that education is intended to select the best students positively predicts support for normative assessment, through increased perception of its reliance on equity, and negatively predicts support for formative assessment, through reduced perception of its ability to establish corrective justice. This study suggests that the belief in the function of selection as inherent to educational institutions can contribute to the reproduction of social inequalities by preventing change from assessment practices known to disadvantage lower-status student, namely normative assessment, to more favorable practices, namely formative assessment, and by promoting matching beliefs in justice principles.

Verification of learner’s differences by team-based learning in biochemistry classes

PubMed Central

2017-01-01

Purpose We tested the effect of team-based learning (TBL) on medical education through the second-year premedical students’ TBL scores in biochemistry classes over 5 years. Methods We analyzed the results based on test scores before and after the students’ debate. The groups of students for statistical analysis were divided as follows: group 1 comprised the top-ranked students, group 3 comprised the low-ranked students, and group 2 comprised the medium-ranked students. Therefore, group T comprised 382 students (the total number of students in group 1, 2, and 3). To calibrate the difficulty of the test, original scores were converted into standardized scores. We determined the differences of the tests using Student t-test, and the relationship between scores before, and after the TBL using linear regression tests. Results Although there was a decrease in the lowest score, group T and 3 showed a significant increase in both original and standardized scores; there was also an increase in the standardized score of group 3. There was a positive correlation between the pre- and the post-debate scores in group T, and 2. And the beta values of the pre-debate scores and “the changes between the pre- and post-debate scores” were statistically significant in both original and standardized scores. Conclusion TBL is one of the educational methods for helping students improve their grades, particularly those of low-ranked students. PMID:29207457

Beyond Low-Rank Representations: Orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering.

PubMed

Wang, Yang; Wu, Lin

2018-07-01

Low-Rank Representation (LRR) is arguably one of the most powerful paradigms for Multi-view spectral clustering, which elegantly encodes the multi-view local graph/manifold structures into an intrinsic low-rank self-expressive data similarity embedded in high-dimensional space, to yield a better graph partition than their single-view counterparts. In this paper we revisit it with a fundamentally different perspective by discovering LRR as essentially a latent clustered orthogonal projection based representation winged with an optimized local graph structure for spectral clustering; each column of the representation is fundamentally a cluster basis orthogonal to others to indicate its members, which intuitively projects the view-specific feature representation to be the one spanned by all orthogonal basis to characterize the cluster structures. Upon this finding, we propose our technique with the following: (1) We decompose LRR into latent clustered orthogonal representation via low-rank matrix factorization, to encode the more flexible cluster structures than LRR over primal data objects; (2) We convert the problem of LRR into that of simultaneously learning orthogonal clustered representation and optimized local graph structure for each view; (3) The learned orthogonal clustered representations and local graph structures enjoy the same magnitude for multi-view, so that the ideal multi-view consensus can be readily achieved. The experiments over multi-view datasets validate its superiority, especially over recent state-of-the-art LRR models. Copyright © 2018 Elsevier Ltd. All rights reserved.

U.S. Declining Global Rankings in Math and Science and the Impact on Our National Security: Policy Options to Elicit Another Sputnik Moment

DTIC Science & Technology

2014-03-01

to school adequately prepared. Self-regulation is the ability of students to take the necessary steps to ensure they are prepared to learn . A self... schools where students are provided with a positive social learning environment that promotes self-efficacy and emulation in the classroom that has... learning process. In 2002, approximately 26 percent of student in the U.S. came to school chronically unprepared (National Center for Education

Appearance is a function of the face.

PubMed

Borah, Gregory L; Rankin, Marlene K

2010-03-01

Increasingly, third-party insurers deny coverage to patients with posttraumatic and congenital facial deformities because these are not seen as "functional." Recent facial transplants have demonstrated that severely deformed patients are willing to undergo potentially life-threatening surgery in search of a normal physiognomy. Scant quantitative research exists that objectively documents appearance as a primary "function" of the face. This study was designed to establish a population-based definition of the functions of the human face, rank importance of the face among various anatomical areas, and determine the risk value the average person places on a normal appearance. Voluntary adult subjects (n = 210) in three states aged 18 to 75 years were recruited using a quota sampling technique. Subjects completed study questionnaires of demography and bias using the Gamble Chance of Death Questionnaire and the Rosenberg Self-Esteem Scale. The face ranked as the most important anatomical area for functional reconstruction. Appearance was the fifth most important function of the face, after breathing, sight, speech, and eating. Normal facial appearance was rated as very important for one to be a functioning member of American society (p = 0.01) by 49 percent. One in seven subjects (13 percent) would accept a 30 to 45 percent risk of death to obtain a "normal" face. Normal appearance is a primary function of the face, based on a large, culturally diverse population sample across the lifespan. Normal appearance ranks above smell and expression as a function. Restoration of facial appearance is ranked the most important anatomical area for repair. Normal facial appearance is very important for one to be a functional member of American society.

A Gaussian-based rank approximation for subspace clustering

NASA Astrophysics Data System (ADS)

Xu, Fei; Peng, Chong; Hu, Yunhong; He, Guoping

2018-04-01

Low-rank representation (LRR) has been shown successful in seeking low-rank structures of data relationships in a union of subspaces. Generally, LRR and LRR-based variants need to solve the nuclear norm-based minimization problems. Beyond the success of such methods, it has been widely noted that the nuclear norm may not be a good rank approximation because it simply adds all singular values of a matrix together and thus large singular values may dominant the weight. This results in far from satisfactory rank approximation and may degrade the performance of lowrank models based on the nuclear norm. In this paper, we propose a novel nonconvex rank approximation based on the Gaussian distribution function, which has demanding properties to be a better rank approximation than the nuclear norm. Then a low-rank model is proposed based on the new rank approximation with application to motion segmentation. Experimental results have shown significant improvements and verified the effectiveness of our method.

Performance comparison of machine learning algorithms and number of independent components used in fMRI decoding of belief vs. disbelief.

PubMed

Douglas, P K; Harris, Sam; Yuille, Alan; Cohen, Mark S

2011-05-15

Machine learning (ML) has become a popular tool for mining functional neuroimaging data, and there are now hopes of performing such analyses efficiently in real-time. Towards this goal, we compared accuracy of six different ML algorithms applied to neuroimaging data of persons engaged in a bivariate task, asserting their belief or disbelief of a variety of propositional statements. We performed unsupervised dimension reduction and automated feature extraction using independent component (IC) analysis and extracted IC time courses. Optimization of classification hyperparameters across each classifier occurred prior to assessment. Maximum accuracy was achieved at 92% for Random Forest, followed by 91% for AdaBoost, 89% for Naïve Bayes, 87% for a J48 decision tree, 86% for K*, and 84% for support vector machine. For real-time decoding applications, finding a parsimonious subset of diagnostic ICs might be useful. We used a forward search technique to sequentially add ranked ICs to the feature subspace. For the current data set, we determined that approximately six ICs represented a meaningful basis set for classification. We then projected these six IC spatial maps forward onto a later scanning session within subject. We then applied the optimized ML algorithms to these new data instances, and found that classification accuracy results were reproducible. Additionally, we compared our classification method to our previously published general linear model results on this same data set. The highest ranked IC spatial maps show similarity to brain regions associated with contrasts for belief > disbelief, and disbelief < belief. Copyright © 2010 Elsevier Inc. All rights reserved.

Evaluation of facial attractiveness for patients with malocclusion: a machine-learning technique employing Procrustes.

PubMed

Yu, Xiaonan; Liu, Bin; Pei, Yuru; Xu, Tianmin

2014-05-01

To establish an objective method for evaluating facial attractiveness from a set of orthodontic photographs. One hundred eight malocclusion patients randomly selected from six universities in China were randomly divided into nine groups, with each group containing an equal number of patients with Class I, II, and III malocclusions. Sixty-nine expert Chinese orthodontists ranked photographs of the patients (frontal, lateral, and frontal smiling photos) before and after orthodontic treatment from "most attractive" to "least attractive" in each group. A weighted mean ranking was then calculated for each patient, based on which a three-point scale was created. Procrustes superimposition was conducted on 101 landmarks identified on the photographs. A support vector regression (SVR) function was set up according to the coordinate values of identified landmarks of each photographic set and its corresponding grading. Its predictive ability was tested for each group in turn. The average coincidence rate obtained for comparisons of the subjective ratings with the SVR evaluation was 71.8% according to 18 verification tests. Geometric morphometrics combined with SVR may be a prospective method for objective comprehensive evaluation of facial attractiveness in the near future.

Analysis of dermatology resident self-reported successful learning styles and implications for core competency curriculum development.

PubMed

Stratman, Erik J; Vogel, Curt A; Reck, Samuel J; Mukesh, Bickol N

2008-01-01

There are different teaching styles for delivering competency-based curricula. The education literature suggests that learning is maximized when teaching is delivered in a style preferred by learners. To determine if dermatology residents report learning style preferences aligned with adult learning. Dermatology residents attending an introductory cutaneous biology course completed a learning styles inventory assessing self-reported success in 35 active and passive learning activities. The 35 learning activities were ranked in order of preference by learners. Mean overall ratings for active learning activities were significantly higher than for passive learning activities (P = 0.002). Trends in dermatology resident learning style preferences should be considered during program curriculum development. Programs should integrate a variety of curriculum delivery methods to accommodate various learning styles, with an emphasis on the active learning styles preferred by residents.

Exercise counteracts declining hippocampal function in aging and Alzheimer's disease.

PubMed

Intlekofer, Karlie A; Cotman, Carl W

2013-09-01

Alzheimer's disease (AD) afflicts more than 5.4 million Americans and ranks as the most common type of dementia (Thies and Bleiler, 2011), yet effective pharmacological treatments have not been identified. Substantial evidence indicates that physical activity enhances learning and memory for people of all ages, including individuals that suffer from cognitive impairment. The mechanisms that underlie these benefits have been explored using animal models, including transgenic models of AD. Accumulating research shows that physical activity reinstates hippocampal function by enhancing the expression of brain-derived neurotrophic factor (BDNF) and other growth factors that promote neurogenesis, angiogenesis, and synaptic plasticity. In addition, several studies have found that physical activity counteracts age- and AD-associated declines in mitochondrial and immune system function. A growing body of evidence also suggests that exercise interventions hold the potential to reduce the pathological features associated with AD. Taken together, animal and human studies indicate that exercise provides a powerful stimulus that can countervail the molecular changes that underlie the progressive loss of hippocampal function in advanced age and AD. 2012 Published by Elsevier Inc

Equity weights in the allocation of health care: the rank-dependent QALY model.

PubMed

Bleichrodt, Han; Diecidue, Enrico; Quiggin, John

2004-01-01

This paper introduces the rank-dependent quality-adjusted life-years (QALY) model, a new method to aggregate QALYs in economic evaluations of health care. The rank-dependent QALY model permits the formalization of influential concepts of equity in the allocation of health care, such as the fair innings approach, and it includes as special cases many of the social welfare functions that have been proposed in the literature. An important advantage of the rank-dependent QALY model is that it offers a straightforward procedure to estimate equity weights for QALYs. We characterize the rank-dependent QALY model and argue that its central condition has normative appeal.

LCK rank of locally conformally Kähler manifolds with potential

NASA Astrophysics Data System (ADS)

Ornea, Liviu; Verbitsky, Misha

2016-09-01

An LCK manifold with potential is a quotient of a Kähler manifold X equipped with a positive Kähler potential f, such that the monodromy group acts on X by holomorphic homotheties and multiplies f by a character. The LCK rank is the rank of the image of this character, considered as a function from the monodromy group to real numbers. We prove that an LCK manifold with potential can have any rank between 1 and b1(M) . Moreover, LCK manifolds with proper potential (ones with rank 1) are dense. Two errata to our previous work are given in the last section.

Professional Learning Communities, Self Efficacy, and Collaborative Learning in the Elementary School

ERIC Educational Resources Information Center

Sweigart, Diana Provancha

2012-01-01

The United States of America used to have the best high school graduation rate in the world. However, by 2006, the U.S. was ranked 18 out of 26 among industrialized nations (Organization for Economic Co-operation and Development, 2010) with three out of every ten public school students failing to complete high school with a diploma (DuFour and…

Adult Education Philosophy: The Case of Self-Directed Learning Strategies in Graduate Teaching

ERIC Educational Resources Information Center

Cox, Thomas D.

2015-01-01

This paper examines graduate students' perceptions of instruction of a professor who holds an adult education philosophy of self-directed learning (SDL). Students enrolled in three online courses (N=106) in the Fall of 2013 (n=56) and the Spring of 2014 (n=50) were asked to rank 10 of the professor's behaviors in the courses based on their level…

Air Force Commander’s Guide to Diversity and Inclusion

DTIC Science & Technology

2015-01-01

diversity: differences in styles of work, thinking, learning , and personality ■ organizational/structural diversity: organizational/ institutional...leadership roles themselves, or inspire youth from different backgrounds to join. Research shows that organizations must lead to reap diversity’s benefits...Greatest Air Force,’ but to remain so, we must learn to be comprehensively inclusive, throughout our ranks, and throughout our specialties. If we

Socioecological predictors of immune defences in wild spotted hyenas

PubMed Central

Flies, Andrew S.; Mansfield, Linda S.; Flies, Emily J.; Grant, Chris K.; Holekamp, Kay E.

2016-01-01

Summary Social rank can profoundly affect many aspects of mammalian reproduction and stress physiology, but little is known about how immune function is affected by rank and other socio-ecological factors in free-living animals.In this study we examine the effects of sex, social rank, and reproductive status on immune function in long-lived carnivores that are routinely exposed to a plethora of pathogens, yet rarely show signs of disease.Here we show that two types of immune defenses, complement-mediated bacterial killing capacity (BKC) and total IgM, are positively correlated with social rank in wild hyenas, but that a third type, total IgG, does not vary with rank.Female spotted hyenas, which are socially dominant to males in this species, have higher BKC, and higher IgG and IgM concentrations, than do males.Immune defenses are lower in lactating than pregnant females, suggesting the immune defenses may be energetically costly.Serum cortisol and testosterone concentrations are not reliable predictors of basic immune defenses in wild female spotted hyenas.These results suggest that immune defenses are costly and multiple socioecological variables are important determinants of basic immune defenses among wild hyenas. Effects of these variables should be accounted for when attempting to understand disease ecology and immune function. PMID:27833242

Early play may predict later dominance relationships in yellow-bellied marmots (Marmota flaviventris)

PubMed Central

Blumstein, Daniel T.; Chung, Lawrance K.; Smith, Jennifer E.

2013-01-01

Play has been defined as apparently functionless behaviour, yet since play is costly, models of adaptive evolution predict that it should have some beneficial function (or functions) that outweigh its costs. We provide strong evidence for a long-standing, but poorly supported hypothesis: that early social play is practice for later dominance relationships. We calculated the relative dominance rank by observing the directional outcome of playful interactions in juvenile and yearling yellow-bellied marmots (Marmota flaviventris) and found that these rank relationships were correlated with later dominance ranks calculated from agonistic interactions, however, the strength of this relationship attenuated over time. While play may have multiple functions, one of them may be to establish later dominance relationships in a minimally costly way. PMID:23536602

A fuzzy pattern matching method based on graph kernel for lithography hotspot detection

NASA Astrophysics Data System (ADS)

Nitta, Izumi; Kanazawa, Yuzi; Ishida, Tsutomu; Banno, Koji

2017-03-01

In advanced technology nodes, lithography hotspot detection has become one of the most significant issues in design for manufacturability. Recently, machine learning based lithography hotspot detection has been widely investigated, but it has trade-off between detection accuracy and false alarm. To apply machine learning based technique to the physical verification phase, designers require minimizing undetected hotspots to avoid yield degradation. They also need a ranking of similar known patterns with a detected hotspot to prioritize layout pattern to be corrected. To achieve high detection accuracy and to prioritize detected hotspots, we propose a novel lithography hotspot detection method using Delaunay triangulation and graph kernel based machine learning. Delaunay triangulation extracts features of hotspot patterns where polygons locate irregularly and closely one another, and graph kernel expresses inner structure of graphs. Additionally, our method provides similarity between two patterns and creates a list of similar training patterns with a detected hotspot. Experiments results on ICCAD 2012 benchmarks show that our method achieves high accuracy with allowable range of false alarm. We also show the ranking of the similar known patterns with a detected hotspot.

Ranked solutions to a class of combinatorial optimizations—with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media

NASA Astrophysics Data System (ADS)

Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo

2005-08-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.

Two-Dimensional Hermite Filters Simplify the Description of High-Order Statistics of Natural Images.

PubMed

Hu, Qin; Victor, Jonathan D

2016-09-01

Natural image statistics play a crucial role in shaping biological visual systems, understanding their function and design principles, and designing effective computer-vision algorithms. High-order statistics are critical for conveying local features, but they are challenging to study - largely because their number and variety is large. Here, via the use of two-dimensional Hermite (TDH) functions, we identify a covert symmetry in high-order statistics of natural images that simplifies this task. This emerges from the structure of TDH functions, which are an orthogonal set of functions that are organized into a hierarchy of ranks. Specifically, we find that the shape (skewness and kurtosis) of the distribution of filter coefficients depends only on the projection of the function onto a 1-dimensional subspace specific to each rank. The characterization of natural image statistics provided by TDH filter coefficients reflects both their phase and amplitude structure, and we suggest an intuitive interpretation for the special subspace within each rank.

Motor Learning as Young Gymnast's Talent Indicator.

PubMed

di Cagno, Alessandra; Battaglia, Claudia; Fiorilli, Giovanni; Piazza, Marina; Giombini, Arrigo; Fagnani, Federica; Borrione, Paolo; Calcagno, Giuseppe; Pigozzi, Fabio

2014-12-01

Talent identification plans are designed to select young athletes with the ability to achieve future success in sports. The aim of the study was to verify the predictive value of coordination and precision in skill acquisition during motor learning, as indicators of talent. One hundred gymnasts, both cadets (aged 11.5 ± 0.5 yr.) and juniors (aged 13.3 ± 0.5 years), competing at the national level, were enrolled in the study. The assessment of motor coordination involved three tests of the validated Hirtz's battery (1985), and motor skill learning involved four technical tests, specific of rhythmic gymnastics. All the tests were correlated with ranking and performance scores reached by each gymnast in the 2011, 2012, and 2013 National Championships. Coordination tests were significantly correlated to 2013 Championships scores (p < 0.01) and ranking (p < 0.05) of elite cadet athletes. Precision, in skill acquisition test results, was positively and significantly associated with scores in 2013 (adj. R(2) = 0.26, p < 0.01). Gymnasts with the best results in coordination and motor learning tests went on to achieve better competition results in three- year time. Key pointsIn talent identification and selection procedures it is better to include the evaluation of coordination and motor learning ability.Motor learning assessment concerns performance improvement and the ability to develop it, rather than evaluating the athlete's current performance.In this manner talent identification processes should be focused on the future performance capabilities of athletes.

Motor Learning as Young Gymnast’s Talent Indicator

PubMed Central

di Cagno, Alessandra; Battaglia, Claudia; Fiorilli, Giovanni; Piazza, Marina; Giombini, Arrigo; Fagnani, Federica; Borrione, Paolo; Calcagno, Giuseppe; Pigozzi, Fabio

2014-01-01

Talent identification plans are designed to select young athletes with the ability to achieve future success in sports. The aim of the study was to verify the predictive value of coordination and precision in skill acquisition during motor learning, as indicators of talent. One hundred gymnasts, both cadets (aged 11.5 ± 0.5 yr.) and juniors (aged 13.3 ± 0.5 years), competing at the national level, were enrolled in the study. The assessment of motor coordination involved three tests of the validated Hirtz’s battery (1985), and motor skill learning involved four technical tests, specific of rhythmic gymnastics. All the tests were correlated with ranking and performance scores reached by each gymnast in the 2011, 2012, and 2013 National Championships. Coordination tests were significantly correlated to 2013 Championships scores (p < 0.01) and ranking (p < 0.05) of elite cadet athletes. Precision, in skill acquisition test results, was positively and significantly associated with scores in 2013 (adj. R2 = 0.26, p < 0.01). Gymnasts with the best results in coordination and motor learning tests went on to achieve better competition results in three- year time. Key points In talent identification and selection procedures it is better to include the evaluation of coordination and motor learning ability. Motor learning assessment concerns performance improvement and the ability to develop it, rather than evaluating the athlete’s current performance. In this manner talent identification processes should be focused on the future performance capabilities of athletes. PMID:25435768

Student Practices, Learning, and Attitudes When Using Computerized Ranking Tasks

NASA Astrophysics Data System (ADS)

Lee, Kevin M.; Prather, E. E.; Collaboration of Astronomy Teaching Scholars CATS

2011-01-01

Ranking Tasks are a novel type of conceptual exercise based on a technique called rule assessment. Ranking Tasks present students with a series of four to eight icons that describe slightly different variations of a basic physical situation. Students are then asked to identify the order, or ranking, of the various situations based on some physical outcome or result. The structure of Ranking Tasks makes it difficult for students to rely strictly on memorized answers and mechanical substitution of formulae. In addition, by changing the presentation of the different scenarios (e.g., photographs, line diagrams, graphs, tables, etc.) we find that Ranking Tasks require students to develop mental schema that are more flexible and robust. Ranking tasks may be implemented on the computer which requires students to order the icons through drag-and-drop. Computer implementation allows the incorporation of background material, grading with feedback, and providing additional similar versions of the task through randomization so that students can build expertise through practice. This poster will summarize the results of a study of student usage of computerized ranking tasks. We will investigate 1) student practices (How do they make use of these tools?), 2) knowledge and skill building (Do student scores improve with iteration and are there diminishing returns?), and 3) student attitudes toward using computerized Ranking Tasks (Do they like using them?). This material is based upon work supported by the National Science Foundation under Grant No. 0715517, a CCLI Phase III Grant for the Collaboration of Astronomy Teaching Scholars (CATS). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.

28 CFR 0.137 - Designating officials to perform the functions and duties of certain offices in case of absence...

Code of Federal Regulations, 2010 CFR

2010-07-01

... paragraphs (a) or (b) of this section, the ranking deputy (or an equivalent official) in such unit who is... directs otherwise. Except as otherwise provided by law, if there is no ranking deputy available, the... designate the ranking deputy (or an equivalent official) in the unit who is available to act as head. If...

Bayesian Inference of Natural Rankings in Incomplete Competition Networks

PubMed Central

Park, Juyong; Yook, Soon-Hyung

2014-01-01

Competition between a complex system's constituents and a corresponding reward mechanism based on it have profound influence on the functioning, stability, and evolution of the system. But determining the dominance hierarchy or ranking among the constituent parts from the strongest to the weakest – essential in determining reward and penalty – is frequently an ambiguous task due to the incomplete (partially filled) nature of competition networks. Here we introduce the “Natural Ranking,” an unambiguous ranking method applicable to a round robin tournament, and formulate an analytical model based on the Bayesian formula for inferring the expected mean and error of the natural ranking of nodes from an incomplete network. We investigate its potential and uses in resolving important issues of ranking by applying it to real-world competition networks. PMID:25163528

Bayesian Inference of Natural Rankings in Incomplete Competition Networks

NASA Astrophysics Data System (ADS)

Park, Juyong; Yook, Soon-Hyung

2014-08-01

Competition between a complex system's constituents and a corresponding reward mechanism based on it have profound influence on the functioning, stability, and evolution of the system. But determining the dominance hierarchy or ranking among the constituent parts from the strongest to the weakest - essential in determining reward and penalty - is frequently an ambiguous task due to the incomplete (partially filled) nature of competition networks. Here we introduce the ``Natural Ranking,'' an unambiguous ranking method applicable to a round robin tournament, and formulate an analytical model based on the Bayesian formula for inferring the expected mean and error of the natural ranking of nodes from an incomplete network. We investigate its potential and uses in resolving important issues of ranking by applying it to real-world competition networks.

Maryland's high cancer mortality rate: a review of contributing demographic factors.

PubMed

Freedman, D M

1999-01-01

For many years, Maryland has ranked among the top states in cancer mortality. This study analyzed mortality data from the National Center for Health Statistics (CDC-Wonder) to help explain Maryland's cancer rate and rank. Age-adjusted rates are based on deaths per 100,000 population from 1991 through 1995. Rates and ranks overall, and stratified by age, are calculated for total cancer mortality, as well as for four major sites: lung, breast, prostate, and colorectal. Because states differ in their racial/gender mix, race/gender rates among states are also compared. Although Maryland ranks seventh in overall cancer mortality, its rates and rank by race and gender subpopulation are less high. For those under 75, white men ranked 26th, black men ranked 20th, and black and white women ranked 12th and 10th, respectively. Maryland's overall rank, as with any state, is a function of the rates of its racial and gender subpopulations and the relative size of these groups in the state. Many of the disparities between Maryland's overall high cancer rank and its lower rank by subpopulation also characterize the major cancer sites. Although a stratified presentation of cancer rates and ranks may be more favorable to Maryland, it should not be used to downplay the attention cancer mortality in Maryland deserves.

Desirability-based methods of multiobjective optimization and ranking for global QSAR studies. Filtering safe and potent drug candidates from combinatorial libraries.

PubMed

Cruz-Monteagudo, Maykel; Borges, Fernanda; Cordeiro, M Natália D S; Cagide Fajin, J Luis; Morell, Carlos; Ruiz, Reinaldo Molina; Cañizares-Carmenate, Yudith; Dominguez, Elena Rosa

2008-01-01

Up to now, very few applications of multiobjective optimization (MOOP) techniques to quantitative structure-activity relationship (QSAR) studies have been reported in the literature. However, none of them report the optimization of objectives related directly to the final pharmaceutical profile of a drug. In this paper, a MOOP method based on Derringer's desirability function that allows conducting global QSAR studies, simultaneously considering the potency, bioavailability, and safety of a set of drug candidates, is introduced. The results of the desirability-based MOOP (the levels of the predictor variables concurrently producing the best possible compromise between the properties determining an optimal drug candidate) are used for the implementation of a ranking method that is also based on the application of desirability functions. This method allows ranking drug candidates with unknown pharmaceutical properties from combinatorial libraries according to the degree of similarity with the previously determined optimal candidate. Application of this method will make it possible to filter the most promising drug candidates of a library (the best-ranked candidates), which should have the best pharmaceutical profile (the best compromise between potency, safety and bioavailability). In addition, a validation method of the ranking process, as well as a quantitative measure of the quality of a ranking, the ranking quality index (Psi), is proposed. The usefulness of the desirability-based methods of MOOP and ranking is demonstrated by its application to a library of 95 fluoroquinolones, reporting their gram-negative antibacterial activity and mammalian cell cytotoxicity. Finally, the combined use of the desirability-based methods of MOOP and ranking proposed here seems to be a valuable tool for rational drug discovery and development.

Rank-Optimized Logistic Matrix Regression toward Improved Matrix Data Classification.

PubMed

Zhang, Jianguang; Jiang, Jianmin

2018-02-01

While existing logistic regression suffers from overfitting and often fails in considering structural information, we propose a novel matrix-based logistic regression to overcome the weakness. In the proposed method, 2D matrices are directly used to learn two groups of parameter vectors along each dimension without vectorization, which allows the proposed method to fully exploit the underlying structural information embedded inside the 2D matrices. Further, we add a joint [Formula: see text]-norm on two parameter matrices, which are organized by aligning each group of parameter vectors in columns. This added co-regularization term has two roles-enhancing the effect of regularization and optimizing the rank during the learning process. With our proposed fast iterative solution, we carried out extensive experiments. The results show that in comparison to both the traditional tensor-based methods and the vector-based regression methods, our proposed solution achieves better performance for matrix data classifications.

Continuous-variable quantum Gaussian process regression and quantum singular value decomposition of nonsparse low-rank matrices

NASA Astrophysics Data System (ADS)

Das, Siddhartha; Siopsis, George; Weedbrook, Christian

2018-02-01

With the significant advancement in quantum computation during the past couple of decades, the exploration of machine-learning subroutines using quantum strategies has become increasingly popular. Gaussian process regression is a widely used technique in supervised classical machine learning. Here we introduce an algorithm for Gaussian process regression using continuous-variable quantum systems that can be realized with technology based on photonic quantum computers under certain assumptions regarding distribution of data and availability of efficient quantum access. Our algorithm shows that by using a continuous-variable quantum computer a dramatic speedup in computing Gaussian process regression can be achieved, i.e., the possibility of exponentially reducing the time to compute. Furthermore, our results also include a continuous-variable quantum-assisted singular value decomposition method of nonsparse low rank matrices and forms an important subroutine in our Gaussian process regression algorithm.

ProtDec-LTR2.0: an improved method for protein remote homology detection by combining pseudo protein and supervised Learning to Rank.

PubMed

Chen, Junjie; Guo, Mingyue; Li, Shumin; Liu, Bin

2017-11-01

As one of the most important tasks in protein sequence analysis, protein remote homology detection is critical for both basic research and practical applications. Here, we present an effective web server for protein remote homology detection called ProtDec-LTR2.0 by combining ProtDec-Learning to Rank (LTR) and pseudo protein representation. Experimental results showed that the detection performance is obviously improved. The web server provides a user-friendly interface to explore the sequence and structure information of candidate proteins and find their conserved domains by launching a multiple sequence alignment tool. The web server is free and open to all users with no login requirement at http://bioinformatics.hitsz.edu.cn/ProtDec-LTR2.0/. bliu@hit.edu.cn. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Low-rank plus sparse decomposition for exoplanet detection in direct-imaging ADI sequences. The LLSG algorithm

NASA Astrophysics Data System (ADS)

Gomez Gonzalez, C. A.; Absil, O.; Absil, P.-A.; Van Droogenbroeck, M.; Mawet, D.; Surdej, J.

2016-05-01

Context. Data processing constitutes a critical component of high-contrast exoplanet imaging. Its role is almost as important as the choice of a coronagraph or a wavefront control system, and it is intertwined with the chosen observing strategy. Among the data processing techniques for angular differential imaging (ADI), the most recent is the family of principal component analysis (PCA) based algorithms. It is a widely used statistical tool developed during the first half of the past century. PCA serves, in this case, as a subspace projection technique for constructing a reference point spread function (PSF) that can be subtracted from the science data for boosting the detectability of potential companions present in the data. Unfortunately, when building this reference PSF from the science data itself, PCA comes with certain limitations such as the sensitivity of the lower dimensional orthogonal subspace to non-Gaussian noise. Aims: Inspired by recent advances in machine learning algorithms such as robust PCA, we aim to propose a localized subspace projection technique that surpasses current PCA-based post-processing algorithms in terms of the detectability of companions at near real-time speed, a quality that will be useful for future direct imaging surveys. Methods: We used randomized low-rank approximation methods recently proposed in the machine learning literature, coupled with entry-wise thresholding to decompose an ADI image sequence locally into low-rank, sparse, and Gaussian noise components (LLSG). This local three-term decomposition separates the starlight and the associated speckle noise from the planetary signal, which mostly remains in the sparse term. We tested the performance of our new algorithm on a long ADI sequence obtained on β Pictoris with VLT/NACO. Results: Compared to a standard PCA approach, LLSG decomposition reaches a higher signal-to-noise ratio and has an overall better performance in the receiver operating characteristic space. This three-term decomposition brings a detectability boost compared to the full-frame standard PCA approach, especially in the small inner working angle region where complex speckle noise prevents PCA from discerning true companions from noise.

Rank-preserving regression: a more robust rank regression model against outliers.

PubMed

Chen, Tian; Kowalski, Jeanne; Chen, Rui; Wu, Pan; Zhang, Hui; Feng, Changyong; Tu, Xin M

2016-08-30

Mean-based semi-parametric regression models such as the popular generalized estimating equations are widely used to improve robustness of inference over parametric models. Unfortunately, such models are quite sensitive to outlying observations. The Wilcoxon-score-based rank regression (RR) provides more robust estimates over generalized estimating equations against outliers. However, the RR and its extensions do not sufficiently address missing data arising in longitudinal studies. In this paper, we propose a new approach to address outliers under a different framework based on the functional response models. This functional-response-model-based alternative not only addresses limitations of the RR and its extensions for longitudinal data, but, with its rank-preserving property, even provides more robust estimates than these alternatives. The proposed approach is illustrated with both real and simulated data. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Tailoring cancer education and support programs for low-income, primarily African American cancer survivors.

PubMed

Martin, Michelle Y; Pollack, Lori A; Evans, Mary B; Smith, Judith Lee; Kratt, Polly; Prayor-Patterson, Heather; Watson, Christopher D; Dignan, Mark; Cheney, Lydia C; Pisu, Maria; Liwo, Amandiy; Hullett, Sandral

2011-01-01

to identify the information and stress-management topics of most interest to low-income, predominantly African American cancer survivors. descriptive, cross sectional. outpatient oncology clinic in a public hospital in Birmingham, Alabama. 25 patients with cancer; 12 were men, 22 were African Americans, and 16 had a 12th-grade education or less. patients ranked potential topics to be included in an educational curriculum. quantitative rankings of information and stress-management priorities. learning about cancer, understanding cancer treatments, relieving cancer pain, and keeping well in mind and body were the most highly ranked topics among those offered within the American Cancer Society's I Can Cope curriculum, which also included supportive topics such as mobilizing social support. The preferred stress-management topics were humor therapy, music therapy, meditation, and relaxation; lower-ranked topics included pet therapy and art as therapy. cancer survivors appear most interested in topics specific to their illness and treatment versus supportive topics. Stress management also received high rankings. nurses have a key role in providing patient education and support. Tailoring education programs may better target specific needs and improve the quality of cancer care of underserved patients.

A discrepancy in objective and subjective measures of knowledge: do some medical students with learning problems delude themselves?

PubMed

Anthoney, T R

1986-01-01

In general, the rankings of first-year medical students on a written test of long-term neuroscience retention (RET) correlated strongly with how many of three neuroscience research presentations given within the following 2 days the students reported understanding. The lowest-ranking sixth of the class on RET, however, reported understanding almost every lecture, even more than the highest-ranking RET students did. Some of these low-ranking students were aware that they had areas of weakness, but simply tolerated more of them without reporting overall lack of understanding. Other low-ranking students, however, seemed genuinely unaware that they had any areas of weakness. This interpretation was further supported by data on small-group problem-solving performance during the first-year neuroscience course, on use of human resources during the final first-year neuroscience take-home examination, and on performance during the third-year clinical clerkships. Persistence of the problem, even after 5 months of instruction specifically designed to improve such information-processing skills, suggests that correction may be difficult to achieve. The need for specific valid evaluative instruments and effective correctional techniques is noted.

Integrating 360° behavior-orientated feedback in communication skills training for medical undergraduates: concept, acceptance and students' self-ratings of communication competence.

PubMed

Engerer, Cosima; Berberat, Pascal O; Dinkel, Andreas; Rudolph, Baerbel; Sattel, Heribert; Wuensch, Alexander

2016-10-18

Feedback is considered a key didactic element in medical education, especially for teaching of communication skills. This study investigates the impact of a best evidence-based practice feedback concept within the context of communication skills training (CST). We evaluate this concept for acceptance and changes in students self-ratings of communication competence. Our CST integrating feedback process comprises a short theoretical introduction presenting standards for good communication and a constructive 360° feedback from three perspectives: feedback from peers, from standardized patients (SPs), and from a trainer. Feed-forward process was facilitated for documenting suggestions for improvements based on observable behaviors to maximize learning benefits. Our CST was applied to four groups of eight or nine students. We assessed the data on students' acceptance using a 6-point scale ranging from very good (1) to poor (6), applied a forced choice question to rank didactic items, and assessed changes in student' self-ratings of their communication competence on a 10-cm visual analogue scale (VAS). Thirty-four medical undergraduates (82 % female, 18 % male) in their first clinical year, with an average age of 21.4 years (SD = 1.0), participated in the new training. The concept achieved high acceptance from good to very good: overall impression (M = 1.56), sufficient interaction for discussion (M = 1.15), and constructive learning atmosphere (M = 1.18). Specific elements, such as practical training with SPs (M = 1.18) and feedback by SPs (M = 1.12), showed highest acceptance. The forced choice ranking placed all feedback elements at the top of the list (feedback (FB) by SPs, rank 2; FB by trainer, rank 3; FB by colleagues, rank 4), whereas theoretical elements were at the bottom (theoretical introduction, rank 7; memory card, rank 9). Overall, student self-ratings of communication competence significantly improved in nine of the ten communication items assessed by VAS and showed a pre-post effect size of ES = 0.74 on a global rating. This study demonstrates that the training concept based on 360° behavioral feedback was well accepted and generated significant changes in student self-ratings of their communication competence. Further research is needed to determine the effects on objective communication performance.

An Efficient Rank Based Approach for Closest String and Closest Substring

PubMed Central

2012-01-01

This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings. The two NP-hard problems we are trying to solve are closest string and closest substring. For each problem we build a genetic algorithm and we describe the genetic operations involved. Both genetic algorithms use a fitness function based on rank distance. We compare our algorithms with other genetic algorithms that use different distance measures, such as Hamming distance or Levenshtein distance, on real DNA sequences. Our experiments show that the genetic algorithms based on rank distance have the best results. PMID:22675483

Exponential Family Functional data analysis via a low-rank model.

PubMed

Li, Gen; Huang, Jianhua Z; Shen, Haipeng

2018-05-08

In many applications, non-Gaussian data such as binary or count are observed over a continuous domain and there exists a smooth underlying structure for describing such data. We develop a new functional data method to deal with this kind of data when the data are regularly spaced on the continuous domain. Our method, referred to as Exponential Family Functional Principal Component Analysis (EFPCA), assumes the data are generated from an exponential family distribution, and the matrix of the canonical parameters has a low-rank structure. The proposed method flexibly accommodates not only the standard one-way functional data, but also two-way (or bivariate) functional data. In addition, we introduce a new cross validation method for estimating the latent rank of a generalized data matrix. We demonstrate the efficacy of the proposed methods using a comprehensive simulation study. The proposed method is also applied to a real application of the UK mortality study, where data are binomially distributed and two-way functional across age groups and calendar years. The results offer novel insights into the underlying mortality pattern. © 2018, The International Biometric Society.

Power and sample size evaluation for the Cochran-Mantel-Haenszel mean score (Wilcoxon rank sum) test and the Cochran-Armitage test for trend.

PubMed

Lachin, John M

2011-11-10

The power of a chi-square test, and thus the required sample size, are a function of the noncentrality parameter that can be obtained as the limiting expectation of the test statistic under an alternative hypothesis specification. Herein, we apply this principle to derive simple expressions for two tests that are commonly applied to discrete ordinal data. The Wilcoxon rank sum test for the equality of distributions in two groups is algebraically equivalent to the Mann-Whitney test. The Kruskal-Wallis test applies to multiple groups. These tests are equivalent to a Cochran-Mantel-Haenszel mean score test using rank scores for a set of C-discrete categories. Although various authors have assessed the power function of the Wilcoxon and Mann-Whitney tests, herein it is shown that the power of these tests with discrete observations, that is, with tied ranks, is readily provided by the power function of the corresponding Cochran-Mantel-Haenszel mean scores test for two and R > 2 groups. These expressions yield results virtually identical to those derived previously for rank scores and also apply to other score functions. The Cochran-Armitage test for trend assesses whether there is an monotonically increasing or decreasing trend in the proportions with a positive outcome or response over the C-ordered categories of an ordinal independent variable, for example, dose. Herein, it is shown that the power of the test is a function of the slope of the response probabilities over the ordinal scores assigned to the groups that yields simple expressions for the power of the test. Copyright © 2011 John Wiley & Sons, Ltd.

Robust Multi Sensor Classification via Jointly Sparse Representation

DTIC Science & Technology

2016-03-14

rank, sensor network, dictionary learning REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S REPORT NUMBER(S) 10. SPONSOR/MONITOR’S ACRONYM(S) ARO 8...with ultrafast laser pulses, Optics Express, (04 2015): 10521. doi: Xiaoxia Sun, Nasser M. Nasrabadi, Trac D. Tran. Task-Driven Dictionary Learning...in dictionary design, compressed sensors design, and optimization in sparse recovery also helps. We are able to advance the state of the art

DNorm: disease name normalization with pairwise learning to rank.

PubMed

Leaman, Robert; Islamaj Dogan, Rezarta; Lu, Zhiyong

2013-11-15

Despite the central role of diseases in biomedical research, there have been much fewer attempts to automatically determine which diseases are mentioned in a text-the task of disease name normalization (DNorm)-compared with other normalization tasks in biomedical text mining research. In this article we introduce the first machine learning approach for DNorm, using the NCBI disease corpus and the MEDIC vocabulary, which combines MeSH® and OMIM. Our method is a high-performing and mathematically principled framework for learning similarities between mentions and concept names directly from training data. The technique is based on pairwise learning to rank, which has not previously been applied to the normalization task but has proven successful in large optimization problems for information retrieval. We compare our method with several techniques based on lexical normalization and matching, MetaMap and Lucene. Our algorithm achieves 0.782 micro-averaged F-measure and 0.809 macro-averaged F-measure, an increase over the highest performing baseline method of 0.121 and 0.098, respectively. The source code for DNorm is available at http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/DNorm, along with a web-based demonstration and links to the NCBI disease corpus. Results on PubMed abstracts are available in PubTator: http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/PubTator .

Competence and the Evolutionary Origins of Status and Power in Humans.

PubMed

Chapais, Bernard

2015-06-01

In this paper I propose an evolutionary model of human status that expands upon an earlier model proposed by Henrich and Gil-White Evolution and Human Behavior, 22,165-196 (2001). According to their model, there are two systems of status attainment in humans-"two ways to the top": the dominance route, which involves physical intimidation, a psychology of fear and hubristic pride, and provides coercive power, and the prestige route, which involves skills and knowledge (competence), a psychology of attraction to experts and authentic pride, and translates mainly into influence. The two systems would have evolved in response to different selective pressures, with attraction to experts serving a social learning function and coinciding with the evolution of cumulative culture. In this paper I argue that (1) the only one way to the top is competence because dominance itself involves competence and confers prestige, so there is no such thing as pure dominance status; (2) dominance in primates has two components: a competitive one involving physical coercion and a cooperative one involving competence-based attraction to high-ranking individuals (proto-prestige); (3) competence grants the same general type of power (dependence-based) in humans and other primates; (4) the attractiveness of high rank in primates is homologous with the admiration of experts in humans; (5) upon the evolution of cumulative culture, the attractiveness of high rank was co-opted to generate status differentials in a vast number of culturally generated domains of activity. I also discuss, in this perspective, the origins of hubristic pride, authentic pride, and nonauthoritarian leadership.

Laboratory Class Project: Using a Cichlid Fish Display Tank to Teach Students about Complex Behavioral Systems.

PubMed

Nolan, Brian C

2010-01-01

Laboratory activities serve several important functions in undergraduate science education. For neuroscience majors, an important and sometimes underemphasized tool is the use of behavioral observations to help inform us about the consequences of changes that are occurring on a neuronal level. To help address this concern, the following laboratory exercise is presented. The current project tested the prediction that the most dominant fish in a tank of cichlids will have gained the most benefits of its position resulting in the greatest growth and hence, become the largest fish. More specifically: (1) is there evidence that a social hierarchy exists among the fish in our tank based on the number of aggressive acts among the four largest fish; (2) if so, does the apparent rank correspond to the size of the fish as predicted by previous studies? Focal sampling and behavior sampling of aggressive acts between fish were utilized in the data collection. Collectively, the data suggest a social dominance hierarchy may be in place with the following rank order from highest to lowest: Fish A > Fish B > Fish D > Fish C. While the largest (Fish A) seems to be at the top, Fish C ended up being ranked lower than Fish D despite the fact that Fish C is larger. Overall, the project was considered a success by the instructor and students. The students offered several suggestions that could improve future versions of this type of project, in particular concerning the process of constructing a poster about the project. The implications of the data and student learning outcomes are discussed.

Constant size descriptors for accurate machine learning models of molecular properties

NASA Astrophysics Data System (ADS)

Collins, Christopher R.; Gordon, Geoffrey J.; von Lilienfeld, O. Anatole; Yaron, David J.

2018-06-01

Two different classes of molecular representations for use in machine learning of thermodynamic and electronic properties are studied. The representations are evaluated by monitoring the performance of linear and kernel ridge regression models on well-studied data sets of small organic molecules. One class of representations studied here counts the occurrence of bonding patterns in the molecule. These require only the connectivity of atoms in the molecule as may be obtained from a line diagram or a SMILES string. The second class utilizes the three-dimensional structure of the molecule. These include the Coulomb matrix and Bag of Bonds, which list the inter-atomic distances present in the molecule, and Encoded Bonds, which encode such lists into a feature vector whose length is independent of molecular size. Encoded Bonds' features introduced here have the advantage of leading to models that may be trained on smaller molecules and then used successfully on larger molecules. A wide range of feature sets are constructed by selecting, at each rank, either a graph or geometry-based feature. Here, rank refers to the number of atoms involved in the feature, e.g., atom counts are rank 1, while Encoded Bonds are rank 2. For atomization energies in the QM7 data set, the best graph-based feature set gives a mean absolute error of 3.4 kcal/mol. Inclusion of 3D geometry substantially enhances the performance, with Encoded Bonds giving 2.4 kcal/mol, when used alone, and 1.19 kcal/mol, when combined with graph features.

The relationship between English language learning strategies and proficiency of pre-university students: A study case of UMS

NASA Astrophysics Data System (ADS)

Kiram, Johannah Jamalul; Sulaiman, Jumat; Swanto, Suyansah; Din, Wardatul Akmam

2014-07-01

This paper seeks to investigate the relationship between language learning strategies and proficiency in English. Fifty-six pre-university students (22 males, 34 females) of University Malaysia Sabah participated in this study. Oxford's Strategy Inventory for Language Learning (SILL) self-report questionnaire was adopted to identify the students' language learning strategies, whereas their proficiencies were judged based on their Malaysian University English Test (MUET) Results. Pearson's correlation coefficient, Spearman's rank correlation coefficient and the t-test were utilized to make statistical interpretation about the relationship. The knowledge obtained from this study will be helpful for future studies on how to improve the quality of learning and proficiency in English.

Hazard Screening Methods for Nanomaterials: A Comparative Study

PubMed Central

Murphy, Finbarr; Mullins, Martin; Furxhi, Irini; Costa, Anna L.; Simeone, Felice C.

2018-01-01

Hazard identification is the key step in risk assessment and management of manufactured nanomaterials (NM). However, the rapid commercialisation of nano-enabled products continues to out-pace the development of a prudent risk management mechanism that is widely accepted by the scientific community and enforced by regulators. However, a growing body of academic literature is developing promising quantitative methods. Two approaches have gained significant currency. Bayesian networks (BN) are a probabilistic, machine learning approach while the weight of evidence (WoE) statistical framework is based on expert elicitation. This comparative study investigates the efficacy of quantitative WoE and Bayesian methodologies in ranking the potential hazard of metal and metal-oxide NMs—TiO2, Ag, and ZnO. This research finds that hazard ranking is consistent for both risk assessment approaches. The BN and WoE models both utilize physico-chemical, toxicological, and study type data to infer the hazard potential. The BN exhibits more stability when the models are perturbed with new data. The BN has the significant advantage of self-learning with new data; however, this assumes all input data is equally valid. This research finds that a combination of WoE that would rank input data along with the BN is the optimal hazard assessment framework. PMID:29495342

A novel deep learning algorithm for incomplete face recognition: Low-rank-recovery network.

PubMed

Zhao, Jianwei; Lv, Yongbiao; Zhou, Zhenghua; Cao, Feilong

2017-10-01

There have been a lot of methods to address the recognition of complete face images. However, in real applications, the images to be recognized are usually incomplete, and it is more difficult to realize such a recognition. In this paper, a novel convolution neural network frame, named a low-rank-recovery network (LRRNet), is proposed to conquer the difficulty effectively inspired by matrix completion and deep learning techniques. The proposed LRRNet first recovers the incomplete face images via an approach of matrix completion with the truncated nuclear norm regularization solution, and then extracts some low-rank parts of the recovered images as the filters. With these filters, some important features are obtained by means of the binaryzation and histogram algorithms. Finally, these features are classified with the classical support vector machines (SVMs). The proposed LRRNet method has high face recognition rate for the heavily corrupted images, especially for the images in the large databases. The proposed LRRNet performs well and efficiently for the images with heavily corrupted, especially in the case of large databases. Extensive experiments on several benchmark databases demonstrate that the proposed LRRNet performs better than some other excellent robust face recognition methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Objective criteria ranking framework for renewable energy policy decisions in Nigeria

NASA Astrophysics Data System (ADS)

K, Nwofor O.; N, Dike V.

2016-08-01

We present a framework that seeks to improve the objectivity of renewable energy policy decisions in Nigeria. It consists of expert ranking of resource abundance, resource efficiency and resource environmental comfort in the choice of renewable energy options for large scale power generation. The rankings are converted to a more objective function called Resource Appraisal Function (RAF) using dependence operators derived from logical relationships amongst the various criteria. The preferred option is that with the highest average RAF coupled with the least RAF variance. The method can be extended to more options, more criteria, and more opinions and can be adapted for similar decisions in education, environment and health sectors.

Low-rank canonical-tensor decomposition of potential energy surfaces: application to grid-based diagrammatic vibrational Green's function theory

NASA Astrophysics Data System (ADS)

Rai, Prashant; Sargsyan, Khachik; Najm, Habib; Hermes, Matthew R.; Hirata, So

2017-09-01

A new method is proposed for a fast evaluation of high-dimensional integrals of potential energy surfaces (PES) that arise in many areas of quantum dynamics. It decomposes a PES into a canonical low-rank tensor format, reducing its integral into a relatively short sum of products of low-dimensional integrals. The decomposition is achieved by the alternating least squares (ALS) algorithm, requiring only a small number of single-point energy evaluations. Therefore, it eradicates a force-constant evaluation as the hotspot of many quantum dynamics simulations and also possibly lifts the curse of dimensionality. This general method is applied to the anharmonic vibrational zero-point and transition energy calculations of molecules using the second-order diagrammatic vibrational many-body Green's function (XVH2) theory with a harmonic-approximation reference. In this application, high dimensional PES and Green's functions are both subjected to a low-rank decomposition. Evaluating the molecular integrals over a low-rank PES and Green's functions as sums of low-dimensional integrals using the Gauss-Hermite quadrature, this canonical-tensor-decomposition-based XVH2 (CT-XVH2) achieves an accuracy of 0.1 cm-1 or higher and nearly an order of magnitude speedup as compared with the original algorithm using force constants for water and formaldehyde.

Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering.

PubMed

Peng, Xi; Yu, Zhiding; Yi, Zhang; Tang, Huajin

2017-04-01

Under the framework of graph-based learning, the key to robust subspace clustering and subspace learning is to obtain a good similarity graph that eliminates the effects of errors and retains only connections between the data points from the same subspace (i.e., intrasubspace data points). Recent works achieve good performance by modeling errors into their objective functions to remove the errors from the inputs. However, these approaches face the limitations that the structure of errors should be known prior and a complex convex problem must be solved. In this paper, we present a novel method to eliminate the effects of the errors from the projection space (representation) rather than from the input space. We first prove that l 1 -, l 2 -, l ∞ -, and nuclear-norm-based linear projection spaces share the property of intrasubspace projection dominance, i.e., the coefficients over intrasubspace data points are larger than those over intersubspace data points. Based on this property, we introduce a method to construct a sparse similarity graph, called L2-graph. The subspace clustering and subspace learning algorithms are developed upon L2-graph. We conduct comprehensive experiment on subspace learning, image clustering, and motion segmentation and consider several quantitative benchmarks classification/clustering accuracy, normalized mutual information, and running time. Results show that L2-graph outperforms many state-of-the-art methods in our experiments, including L1-graph, low rank representation (LRR), and latent LRR, least square regression, sparse subspace clustering, and locally linear representation.

Automatically identifying health outcome information in MEDLINE records.

PubMed

Demner-Fushman, Dina; Few, Barbara; Hauser, Susan E; Thoma, George

2006-01-01

Understanding the effect of a given intervention on the patient's health outcome is one of the key elements in providing optimal patient care. This study presents a methodology for automatic identification of outcomes-related information in medical text and evaluates its potential in satisfying clinical information needs related to health care outcomes. An annotation scheme based on an evidence-based medicine model for critical appraisal of evidence was developed and used to annotate 633 MEDLINE citations. Textual, structural, and meta-information features essential to outcome identification were learned from the created collection and used to develop an automatic system. Accuracy of automatic outcome identification was assessed in an intrinsic evaluation and in an extrinsic evaluation, in which ranking of MEDLINE search results obtained using PubMed Clinical Queries relied on identified outcome statements. The accuracy and positive predictive value of outcome identification were calculated. Effectiveness of the outcome-based ranking was measured using mean average precision and precision at rank 10. Automatic outcome identification achieved 88% to 93% accuracy. The positive predictive value of individual sentences identified as outcomes ranged from 30% to 37%. Outcome-based ranking improved retrieval accuracy, tripling mean average precision and achieving 389% improvement in precision at rank 10. Preliminary results in outcome-based document ranking show potential validity of the evidence-based medicine-model approach in timely delivery of information critical to clinical decision support at the point of service.

Thermolysis of phenethyl phenyl ether: A model of ether linkages in low rank coal

DOE Office of Scientific and Technical Information (OSTI.GOV)

Britt, P.F.; Buchanan, A.C. III; Malcolm, E.A.

Currently, an area of interest and frustration for coal chemists has been the direct liquefaction of low rank coal. Although low rank coals are more reactive than bituminous coals, they are more difficult to liquefy and offer lower liquefaction yields under conditions optimized for bituminous coals. Solomon, Serio, and co-workers have shown that: in the pyrolysis and liquefaction of low rank coals, a low temperature cross-linking reaction associated with oxygen functional groups occurs before tar evolution. A variety of pretreatments (demineralization, alkylation, and ion-exchange) have been shown to reduce these retrogressive reactions and increase tar yields, but the actual chemicalmore » reactions responsible for these processes have not been defined. In order to gain insight into the thermochemical reactions leading to cross-linking in low rank coal, we have undertaken a study of the pyrolysis of oxygen containing coal model compounds. Solid state NMR studies suggest that the alkyl aryl ether linkage may be present in modest amounts in low rank coal. Therefore, in this paper, we will investigate the thermolysis of phenethyl phenyl ether (PPE) as a model of 0-aryl ether linkages found in low rank coal, lignites, and lignin, an evolutionary precursor of coal. Our results have uncovered a new reaction channel that can account for 25% of the products formed. The impact of reaction conditions, including restricted mass transport, on this new reaction pathway and the role of oxygen functional groups in cross-linking reactions will be investigated.« less

Reconsidering the use of rankings in the valuation of health states: a model for estimating cardinal values from ordinal data

PubMed Central

Salomon, Joshua A

2003-01-01

Background In survey studies on health-state valuations, ordinal ranking exercises often are used as precursors to other elicitation methods such as the time trade-off (TTO) or standard gamble, but the ranking data have not been used in deriving cardinal valuations. This study reconsiders the role of ordinal ranks in valuing health and introduces a new approach to estimate interval-scaled valuations based on aggregate ranking data. Methods Analyses were undertaken on data from a previously published general population survey study in the United Kingdom that included rankings and TTO values for hypothetical states described using the EQ-5D classification system. The EQ-5D includes five domains (mobility, self-care, usual activities, pain/discomfort and anxiety/depression) with three possible levels on each. Rank data were analysed using a random utility model, operationalized through conditional logit regression. In the statistical model, probabilities of observed rankings were related to the latent utilities of different health states, modeled as a linear function of EQ-5D domain scores, as in previously reported EQ-5D valuation functions. Predicted valuations based on the conditional logit model were compared to observed TTO values for the 42 states in the study and to predictions based on a model estimated directly from the TTO values. Models were evaluated using the intraclass correlation coefficient (ICC) between predictions and mean observations, and the root mean squared error of predictions at the individual level. Results Agreement between predicted valuations from the rank model and observed TTO values was very high, with an ICC of 0.97, only marginally lower than for predictions based on the model estimated directly from TTO values (ICC = 0.99). Individual-level errors were also comparable in the two models, with root mean squared errors of 0.503 and 0.496 for the rank-based and TTO-based predictions, respectively. Conclusions Modeling health-state valuations based on ordinal ranks can provide results that are similar to those obtained from more widely analyzed valuation techniques such as the TTO. The information content in aggregate ranking data is not currently exploited to full advantage. The possibility of estimating cardinal valuations from ordinal ranks could also simplify future data collection dramatically and facilitate wider empirical study of health-state valuations in diverse settings and population groups. PMID:14687419

Exact p-values for pairwise comparison of Friedman rank sums, with application to comparing classifiers.

PubMed

Eisinga, Rob; Heskes, Tom; Pelzer, Ben; Te Grotenhuis, Manfred

2017-01-25

The Friedman rank sum test is a widely-used nonparametric method in computational biology. In addition to examining the overall null hypothesis of no significant difference among any of the rank sums, it is typically of interest to conduct pairwise comparison tests. Current approaches to such tests rely on large-sample approximations, due to the numerical complexity of computing the exact distribution. These approximate methods lead to inaccurate estimates in the tail of the distribution, which is most relevant for p-value calculation. We propose an efficient, combinatorial exact approach for calculating the probability mass distribution of the rank sum difference statistic for pairwise comparison of Friedman rank sums, and compare exact results with recommended asymptotic approximations. Whereas the chi-squared approximation performs inferiorly to exact computation overall, others, particularly the normal, perform well, except for the extreme tail. Hence exact calculation offers an improvement when small p-values occur following multiple testing correction. Exact inference also enhances the identification of significant differences whenever the observed values are close to the approximate critical value. We illustrate the proposed method in the context of biological machine learning, were Friedman rank sum difference tests are commonly used for the comparison of classifiers over multiple datasets. We provide a computationally fast method to determine the exact p-value of the absolute rank sum difference of a pair of Friedman rank sums, making asymptotic tests obsolete. Calculation of exact p-values is easy to implement in statistical software and the implementation in R is provided in one of the Additional files and is also available at http://www.ru.nl/publish/pages/726696/friedmanrsd.zip .

Podium: Ranking Data Using Mixed-Initiative Visual Analytics.

PubMed

Wall, Emily; Das, Subhajit; Chawla, Ravish; Kalidindi, Bharath; Brown, Eli T; Endert, Alex

2018-01-01

People often rank and order data points as a vital part of making decisions. Multi-attribute ranking systems are a common tool used to make these data-driven decisions. Such systems often take the form of a table-based visualization in which users assign weights to the attributes representing the quantifiable importance of each attribute to a decision, which the system then uses to compute a ranking of the data. However, these systems assume that users are able to quantify their conceptual understanding of how important particular attributes are to a decision. This is not always easy or even possible for users to do. Rather, people often have a more holistic understanding of the data. They form opinions that data point A is better than data point B but do not necessarily know which attributes are important. To address these challenges, we present a visual analytic application to help people rank multi-variate data points. We developed a prototype system, Podium, that allows users to drag rows in the table to rank order data points based on their perception of the relative value of the data. Podium then infers a weighting model using Ranking SVM that satisfies the user's data preferences as closely as possible. Whereas past systems help users understand the relationships between data points based on changes to attribute weights, our approach helps users to understand the attributes that might inform their understanding of the data. We present two usage scenarios to describe some of the potential uses of our proposed technique: (1) understanding which attributes contribute to a user's subjective preferences for data, and (2) deconstructing attributes of importance for existing rankings. Our proposed approach makes powerful machine learning techniques more usable to those who may not have expertise in these areas.

What Is Instrumented Learning? Part 1

ERIC Educational Resources Information Center

Blake, Robert; Mouton, Jane

1972-01-01

Although article is directed specifically towards improving sales techniques through self evaluation, it discusses various autoinstructional aids that could be applied to other fields. These include self-ranking against an objectives" grid, forced and multiple choice quizzes and the sentence-completion approach. (PD)

Machine learning shows association between genetic variability in PPARG and cerebral connectivity in preterm infants

PubMed Central

Krishnan, Michelle L.; Wang, Zi; Aljabar, Paul; Ball, Gareth; Mirza, Ghazala; Saxena, Alka; Counsell, Serena J.; Hajnal, Joseph V.; Montana, Giovanni

2017-01-01

Preterm infants show abnormal structural and functional brain development, and have a high risk of long-term neurocognitive problems. The molecular and cellular mechanisms involved are poorly understood, but novel methods now make it possible to address them by examining the relationship between common genetic variability and brain endophenotype. We addressed the hypothesis that variability in the Peroxisome Proliferator Activated Receptor (PPAR) pathway would be related to brain development. We employed machine learning in an unsupervised, unbiased, combined analysis of whole-brain diffusion tractography together with genomewide, single-nucleotide polymorphism (SNP)-based genotypes from a cohort of 272 preterm infants, using Sparse Reduced Rank Regression (sRRR) and correcting for ethnicity and age at birth and imaging. Empirical selection frequencies for SNPs associated with cerebral connectivity ranged from 0.663 to zero, with multiple highly selected SNPs mapping to genes for PPARG (six SNPs), ITGA6 (four SNPs), and FXR1 (two SNPs). SNPs in PPARG were significantly overrepresented (ranked 7–11 and 67 of 556,000 SNPs; P < 2.2 × 10−7), and were mostly in introns or regulatory regions with predicted effects including protein coding and nonsense-mediated decay. Edge-centric graph-theoretic analysis showed that highly selected white-matter tracts were consistent across the group and important for information transfer (P < 2.2 × 10−17); they most often connected to the insula (P < 6 × 10−17). These results suggest that the inhibited brain development seen in humans exposed to the stress of a premature extrauterine environment is modulated by genetic factors, and that PPARG signaling has a previously unrecognized role in cerebral development. PMID:29229843

Optimizing area under the ROC curve using semi-supervised learning

PubMed Central

Wang, Shijun; Li, Diana; Petrick, Nicholas; Sahiner, Berkman; Linguraru, Marius George; Summers, Ronald M.

2014-01-01

Receiver operating characteristic (ROC) analysis is a standard methodology to evaluate the performance of a binary classification system. The area under the ROC curve (AUC) is a performance metric that summarizes how well a classifier separates two classes. Traditional AUC optimization techniques are supervised learning methods that utilize only labeled data (i.e., the true class is known for all data) to train the classifiers. In this work, inspired by semi-supervised and transductive learning, we propose two new AUC optimization algorithms hereby referred to as semi-supervised learning receiver operating characteristic (SSLROC) algorithms, which utilize unlabeled test samples in classifier training to maximize AUC. Unlabeled samples are incorporated into the AUC optimization process, and their ranking relationships to labeled positive and negative training samples are considered as optimization constraints. The introduced test samples will cause the learned decision boundary in a multidimensional feature space to adapt not only to the distribution of labeled training data, but also to the distribution of unlabeled test data. We formulate the semi-supervised AUC optimization problem as a semi-definite programming problem based on the margin maximization theory. The proposed methods SSLROC1 (1-norm) and SSLROC2 (2-norm) were evaluated using 34 (determined by power analysis) randomly selected datasets from the University of California, Irvine machine learning repository. Wilcoxon signed rank tests showed that the proposed methods achieved significant improvement compared with state-of-the-art methods. The proposed methods were also applied to a CT colonography dataset for colonic polyp classification and showed promising results.1 PMID:25395692

Optimizing area under the ROC curve using semi-supervised learning.

PubMed

Wang, Shijun; Li, Diana; Petrick, Nicholas; Sahiner, Berkman; Linguraru, Marius George; Summers, Ronald M

2015-01-01

Receiver operating characteristic (ROC) analysis is a standard methodology to evaluate the performance of a binary classification system. The area under the ROC curve (AUC) is a performance metric that summarizes how well a classifier separates two classes. Traditional AUC optimization techniques are supervised learning methods that utilize only labeled data (i.e., the true class is known for all data) to train the classifiers. In this work, inspired by semi-supervised and transductive learning, we propose two new AUC optimization algorithms hereby referred to as semi-supervised learning receiver operating characteristic (SSLROC) algorithms, which utilize unlabeled test samples in classifier training to maximize AUC. Unlabeled samples are incorporated into the AUC optimization process, and their ranking relationships to labeled positive and negative training samples are considered as optimization constraints. The introduced test samples will cause the learned decision boundary in a multidimensional feature space to adapt not only to the distribution of labeled training data, but also to the distribution of unlabeled test data. We formulate the semi-supervised AUC optimization problem as a semi-definite programming problem based on the margin maximization theory. The proposed methods SSLROC1 (1-norm) and SSLROC2 (2-norm) were evaluated using 34 (determined by power analysis) randomly selected datasets from the University of California, Irvine machine learning repository. Wilcoxon signed rank tests showed that the proposed methods achieved significant improvement compared with state-of-the-art methods. The proposed methods were also applied to a CT colonography dataset for colonic polyp classification and showed promising results.

Learning basic laparoscopic skills: a randomized controlled study comparing box trainer, virtual reality simulator, and mental training.

PubMed

Mulla, Mubashir; Sharma, Davendra; Moghul, Masood; Kailani, Obeda; Dockery, Judith; Ayis, Salma; Grange, Philippe

2012-01-01

The objectives of this study were (1) to compare different methods of learning basic laparoscopic skills using box trainer (BT), virtual reality simulator (VRS) and mental training (MT); and (2) to determine the most effective method of learning laparoscopic skills. Randomized controlled trial. King's College, London. 41 medical students were included in the study. After randomization, they were divided into 5 groups. Group 1 was the control group without training; group 2 was box trained; group 3 was also box trained with an additional practice session; group 4 was VRS trained; and group 5 was solely mentally trained. The task was to cut out a circle marked on a stretchable material. All groups were assessed after 1 week on both BT and VRS. Four main parameters were assessed, namely time, precision, accuracy, and performance. Time: On BT assessment, the box-trained group with additional practice group 3 was the fastest, and the mental-trained group 5 was the slowest. On VRS assessment, the time difference between group 3 and the control group 1 was statistically significant. Precision: On BT assessment, the box-trained groups 2 and 3 scored high, and mental trained were low on precision. On VRS assessment, the VRS-trained group ranked at the top, and the MT group was at the bottom on precision. Accuracy: On BT assessment, the box-trained group 3 was best and the mental-trained group was last. On VRS assessment, the VRS-trained group 4 scored high closely followed by box-trained groups 2 and 3. Performance: On BT assessment, the box-trained group 3 ranked above all the other groups, and the mental-trained group ranked last. On VRS assessment, the VRS group 4 scored best, followed closely by box-trained groups 2 and 3. The skills learned on box training were reproducible on both VRS and BT. However, not all the skills learned on VRS were transferable to BT. Furthermore, VRS was found to be a reliable and the most convenient method of assessment. MT alone cannot replace conventional training. Copyright © 2012 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

Identification of symptom and functional domains that fibromyalgia patients would like to see improved: a cluster analysis.

PubMed

Bennett, Robert M; Russell, Jon; Cappelleri, Joseph C; Bushmakin, Andrew G; Zlateva, Gergana; Sadosky, Alesia

2010-06-28

The purpose of this study was to determine whether some of the clinical features of fibromyalgia (FM) that patients would like to see improved aggregate into definable clusters. Seven hundred and eighty-eight patients with clinically confirmed FM and baseline pain > or =40 mm on a 100 mm visual analogue scale ranked 5 FM clinical features that the subjects would most like to see improved after treatment (one for each priority quintile) from a list of 20 developed during focus groups. For each subject, clinical features were transformed into vectors with rankings assigned values 1-5 (lowest to highest ranking). Logistic analysis was used to create a distance matrix and hierarchical cluster analysis was applied to identify cluster structure. The frequency of cluster selection was determined, and cluster importance was ranked using cluster scores derived from rankings of the clinical features. Multidimensional scaling was used to visualize and conceptualize cluster relationships. Six clinical features clusters were identified and named based on their key characteristics. In order of selection frequency, the clusters were Pain (90%; 4 clinical features), Fatigue (89%; 4 clinical features), Domestic (42%; 4 clinical features), Impairment (29%; 3 functions), Affective (21%; 3 clinical features), and Social (9%; 2 functional). The "Pain Cluster" was ranked of greatest importance by 54% of subjects, followed by Fatigue, which was given the highest ranking by 28% of subjects. Multidimensional scaling mapped these clusters to two dimensions: Status (bounded by Physical and Emotional domains), and Setting (bounded by Individual and Group interactions). Common clinical features of FM could be grouped into 6 clusters (Pain, Fatigue, Domestic, Impairment, Affective, and Social) based on patient perception of relevance to treatment. Furthermore, these 6 clusters could be charted in the 2 dimensions of Status and Setting, thus providing a unique perspective for interpretation of FM symptomatology.

Learning of Multimodal Representations With Random Walks on the Click Graph.

PubMed

Wu, Fei; Lu, Xinyan; Song, Jun; Yan, Shuicheng; Zhang, Zhongfei Mark; Rui, Yong; Zhuang, Yueting

2016-02-01

In multimedia information retrieval, most classic approaches tend to represent different modalities of media in the same feature space. With the click data collected from the users' searching behavior, existing approaches take either one-to-one paired data (text-image pairs) or ranking examples (text-query-image and/or image-query-text ranking lists) as training examples, which do not make full use of the click data, particularly the implicit connections among the data objects. In this paper, we treat the click data as a large click graph, in which vertices are images/text queries and edges indicate the clicks between an image and a query. We consider learning a multimodal representation from the perspective of encoding the explicit/implicit relevance relationship between the vertices in the click graph. By minimizing both the truncated random walk loss as well as the distance between the learned representation of vertices and their corresponding deep neural network output, the proposed model which is named multimodal random walk neural network (MRW-NN) can be applied to not only learn robust representation of the existing multimodal data in the click graph, but also deal with the unseen queries and images to support cross-modal retrieval. We evaluate the latent representation learned by MRW-NN on a public large-scale click log data set Clickture and further show that MRW-NN achieves much better cross-modal retrieval performance on the unseen queries/images than the other state-of-the-art methods.

Self-supervised online metric learning with low rank constraint for scene categorization.

PubMed

Cong, Yang; Liu, Ji; Yuan, Junsong; Luo, Jiebo

2013-08-01

Conventional visual recognition systems usually train an image classifier in a bath mode with all training data provided in advance. However, in many practical applications, only a small amount of training samples are available in the beginning and many more would come sequentially during online recognition. Because the image data characteristics could change over time, it is important for the classifier to adapt to the new data incrementally. In this paper, we present an online metric learning method to address the online scene recognition problem via adaptive similarity measurement. Given a number of labeled data followed by a sequential input of unseen testing samples, the similarity metric is learned to maximize the margin of the distance among different classes of samples. By considering the low rank constraint, our online metric learning model not only can provide competitive performance compared with the state-of-the-art methods, but also guarantees convergence. A bi-linear graph is also defined to model the pair-wise similarity, and an unseen sample is labeled depending on the graph-based label propagation, while the model can also self-update using the more confident new samples. With the ability of online learning, our methodology can well handle the large-scale streaming video data with the ability of incremental self-updating. We evaluate our model to online scene categorization and experiments on various benchmark datasets and comparisons with state-of-the-art methods demonstrate the effectiveness and efficiency of our algorithm.

Regularized Embedded Multiple Kernel Dimensionality Reduction for Mine Signal Processing.

PubMed

Li, Shuang; Liu, Bing; Zhang, Chen

2016-01-01

Traditional multiple kernel dimensionality reduction models are generally based on graph embedding and manifold assumption. But such assumption might be invalid for some high-dimensional or sparse data due to the curse of dimensionality, which has a negative influence on the performance of multiple kernel learning. In addition, some models might be ill-posed if the rank of matrices in their objective functions was not high enough. To address these issues, we extend the traditional graph embedding framework and propose a novel regularized embedded multiple kernel dimensionality reduction method. Different from the conventional convex relaxation technique, the proposed algorithm directly takes advantage of a binary search and an alternative optimization scheme to obtain optimal solutions efficiently. The experimental results demonstrate the effectiveness of the proposed method for supervised, unsupervised, and semisupervised scenarios.

Time-Aware Service Ranking Prediction in the Internet of Things Environment

PubMed Central

Huang, Yuze; Huang, Jiwei; Cheng, Bo; He, Shuqing; Chen, Junliang

2017-01-01

With the rapid development of the Internet of things (IoT), building IoT systems with high quality of service (QoS) has become an urgent requirement in both academia and industry. During the procedures of building IoT systems, QoS-aware service selection is an important concern, which requires the ranking of a set of functionally similar services according to their QoS values. In reality, however, it is quite expensive and even impractical to evaluate all geographically-dispersed IoT services at a single client to obtain such a ranking. Nevertheless, distributed measurement and ranking aggregation have to deal with the high dynamics of QoS values and the inconsistency of partial rankings. To address these challenges, we propose a time-aware service ranking prediction approach named TSRPred for obtaining the global ranking from the collection of partial rankings. Specifically, a pairwise comparison model is constructed to describe the relationships between different services, where the partial rankings are obtained by time series forecasting on QoS values. The comparisons of IoT services are formulated by random walks, and thus, the global ranking can be obtained by sorting the steady-state probabilities of the underlying Markov chain. Finally, the efficacy of TSRPred is validated by simulation experiments based on large-scale real-world datasets. PMID:28448451

Time-Aware Service Ranking Prediction in the Internet of Things Environment.

PubMed

Huang, Yuze; Huang, Jiwei; Cheng, Bo; He, Shuqing; Chen, Junliang

2017-04-27

With the rapid development of the Internet of things (IoT), building IoT systems with high quality of service (QoS) has become an urgent requirement in both academia and industry. During the procedures of building IoT systems, QoS-aware service selection is an important concern, which requires the ranking of a set of functionally similar services according to their QoS values. In reality, however, it is quite expensive and even impractical to evaluate all geographically-dispersed IoT services at a single client to obtain such a ranking. Nevertheless, distributed measurement and ranking aggregation have to deal with the high dynamics of QoS values and the inconsistency of partial rankings. To address these challenges, we propose a time-aware service ranking prediction approach named TSRPred for obtaining the global ranking from the collection of partial rankings. Specifically, a pairwise comparison model is constructed to describe the relationships between different services, where the partial rankings are obtained by time series forecasting on QoS values. The comparisons of IoT services are formulated by random walks, and thus, the global ranking can be obtained by sorting the steady-state probabilities of the underlying Markov chain. Finally, the efficacy of TSRPred is validated by simulation experiments based on large-scale real-world datasets.

UET: a database of evolutionarily-predicted functional determinants of protein sequences that cluster as functional sites in protein structures.

PubMed

Lua, Rhonald C; Wilson, Stephen J; Konecki, Daniel M; Wilkins, Angela D; Venner, Eric; Morgan, Daniel H; Lichtarge, Olivier

2016-01-04

The structure and function of proteins underlie most aspects of biology and their mutational perturbations often cause disease. To identify the molecular determinants of function as well as targets for drugs, it is central to characterize the important residues and how they cluster to form functional sites. The Evolutionary Trace (ET) achieves this by ranking the functional and structural importance of the protein sequence positions. ET uses evolutionary distances to estimate functional distances and correlates genotype variations with those in the fitness phenotype. Thus, ET ranks are worse for sequence positions that vary among evolutionarily closer homologs but better for positions that vary mostly among distant homologs. This approach identifies functional determinants, predicts function, guides the mutational redesign of functional and allosteric specificity, and interprets the action of coding sequence variations in proteins, people and populations. Now, the UET database offers pre-computed ET analyses for the protein structure databank, and on-the-fly analysis of any protein sequence. A web interface retrieves ET rankings of sequence positions and maps results to a structure to identify functionally important regions. This UET database integrates several ways of viewing the results on the protein sequence or structure and can be found at http://mammoth.bcm.tmc.edu/uet/. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Defining Tailored Training Approaches for Army Institutional Training

DTIC Science & Technology

2013-03-01

teachers object to being assigned to the lower ranking groups, which may further depress academic growth. Finally, critics say that ability grouping...for research, theory, and applications. In D. S. Gorfein and R. R. Hoffman (Eds.), Memory and learning: The Ebbinghaus centennial conference

A solution to Schroder's equation in several variables

DOE PAGES

Bridges, Robert A.

2016-03-04

For this paper, let φ be an analytic self-map of the n -ball, having 0 as the attracting fixed point and having full-rank near 0. We consider the generalized Schroder's equation, F °φ=φ'(0) kF with ka positive integer and prove there is always a solution F with linearly independent component functions, but that such an F cannot have full rank except possibly when k=1. Furthermore, when k=1 (Schroder's equation), necessary and sufficient conditions on φ are given to ensure F has full rank near 0 without the added assumption of diagonalizability as needed in the 2003 Cowen/MacCluer paper. In responsemore » to Enoch's 2007 paper, it is proven that any formal power series solution indeed represents an analytic function on the whole unit ball. Finally, how exactly resonance can lead to an obstruction of a full rank solution is discussed as well as some consequences of having solutions to Schroder's equation.« less

Robust subspace clustering via joint weighted Schatten-p norm and Lq norm minimization

NASA Astrophysics Data System (ADS)

Zhang, Tao; Tang, Zhenmin; Liu, Qing

2017-05-01

Low-rank representation (LRR) has been successfully applied to subspace clustering. However, the nuclear norm in the standard LRR is not optimal for approximating the rank function in many real-world applications. Meanwhile, the L21 norm in LRR also fails to characterize various noises properly. To address the above issues, we propose an improved LRR method, which achieves low rank property via the new formulation with weighted Schatten-p norm and Lq norm (WSPQ). Specifically, the nuclear norm is generalized to be the Schatten-p norm and different weights are assigned to the singular values, and thus it can approximate the rank function more accurately. In addition, Lq norm is further incorporated into WSPQ to model different noises and improve the robustness. An efficient algorithm based on the inexact augmented Lagrange multiplier method is designed for the formulated problem. Extensive experiments on face clustering and motion segmentation clearly demonstrate the superiority of the proposed WSPQ over several state-of-the-art methods.

A Class of Manifold Regularized Multiplicative Update Algorithms for Image Clustering.

PubMed

Yang, Shangming; Yi, Zhang; He, Xiaofei; Li, Xuelong

2015-12-01

Multiplicative update algorithms are important tools for information retrieval, image processing, and pattern recognition. However, when the graph regularization is added to the cost function, different classes of sample data may be mapped to the same subspace, which leads to the increase of data clustering error rate. In this paper, an improved nonnegative matrix factorization (NMF) cost function is introduced. Based on the cost function, a class of novel graph regularized NMF algorithms is developed, which results in a class of extended multiplicative update algorithms with manifold structure regularization. Analysis shows that in the learning, the proposed algorithms can efficiently minimize the rank of the data representation matrix. Theoretical results presented in this paper are confirmed by simulations. For different initializations and data sets, variation curves of cost functions and decomposition data are presented to show the convergence features of the proposed update rules. Basis images, reconstructed images, and clustering results are utilized to present the efficiency of the new algorithms. Last, the clustering accuracies of different algorithms are also investigated, which shows that the proposed algorithms can achieve state-of-the-art performance in applications of image clustering.

Application of Machine Learning in Postural Control Kinematics for the Diagnosis of Alzheimer's Disease

PubMed Central

Yelshyna, Darya; Bicho, Estela

2016-01-01

The use of wearable devices to study gait and postural control is a growing field on neurodegenerative disorders such as Alzheimer's disease (AD). In this paper, we investigate if machine-learning classifiers offer the discriminative power for the diagnosis of AD based on postural control kinematics. We compared Support Vector Machines (SVMs), Multiple Layer Perceptrons (MLPs), Radial Basis Function Neural Networks (RBNs), and Deep Belief Networks (DBNs) on 72 participants (36 AD patients and 36 healthy subjects) exposed to seven increasingly difficult postural tasks. The decisional space was composed of 18 kinematic variables (adjusted for age, education, height, and weight), with or without neuropsychological evaluation (Montreal cognitive assessment (MoCA) score), top ranked in an error incremental analysis. Classification results were based on threefold cross validation of 50 independent and randomized runs sets: training (50%), test (40%), and validation (10%). Having a decisional space relying solely on postural kinematics, accuracy of AD diagnosis ranged from 71.7 to 86.1%. Adding the MoCA variable, the accuracy ranged between 91 and 96.6%. MLP classifier achieved top performance in both decisional spaces. Having comprehended the interdynamic interaction between postural stability and cognitive performance, our results endorse machine-learning models as a useful tool for computer-aided diagnosis of AD based on postural control kinematics. PMID:28074090

Application of Machine Learning in Postural Control Kinematics for the Diagnosis of Alzheimer's Disease.

PubMed

Costa, Luís; Gago, Miguel F; Yelshyna, Darya; Ferreira, Jaime; David Silva, Hélder; Rocha, Luís; Sousa, Nuno; Bicho, Estela

2016-01-01

The use of wearable devices to study gait and postural control is a growing field on neurodegenerative disorders such as Alzheimer's disease (AD). In this paper, we investigate if machine-learning classifiers offer the discriminative power for the diagnosis of AD based on postural control kinematics. We compared Support Vector Machines (SVMs), Multiple Layer Perceptrons (MLPs), Radial Basis Function Neural Networks (RBNs), and Deep Belief Networks (DBNs) on 72 participants (36 AD patients and 36 healthy subjects) exposed to seven increasingly difficult postural tasks. The decisional space was composed of 18 kinematic variables (adjusted for age, education, height, and weight), with or without neuropsychological evaluation (Montreal cognitive assessment (MoCA) score), top ranked in an error incremental analysis. Classification results were based on threefold cross validation of 50 independent and randomized runs sets: training (50%), test (40%), and validation (10%). Having a decisional space relying solely on postural kinematics, accuracy of AD diagnosis ranged from 71.7 to 86.1%. Adding the MoCA variable, the accuracy ranged between 91 and 96.6%. MLP classifier achieved top performance in both decisional spaces. Having comprehended the interdynamic interaction between postural stability and cognitive performance, our results endorse machine-learning models as a useful tool for computer-aided diagnosis of AD based on postural control kinematics.

Incorporating Functional Genomic Information in Genetic Association Studies Using an Empirical Bayes Approach.

PubMed

Spencer, Amy V; Cox, Angela; Lin, Wei-Yu; Easton, Douglas F; Michailidou, Kyriaki; Walters, Kevin

2016-04-01

There is a large amount of functional genetic data available, which can be used to inform fine-mapping association studies (in diseases with well-characterised disease pathways). Single nucleotide polymorphism (SNP) prioritization via Bayes factors is attractive because prior information can inform the effect size or the prior probability of causal association. This approach requires the specification of the effect size. If the information needed to estimate a priori the probability density for the effect sizes for causal SNPs in a genomic region isn't consistent or isn't available, then specifying a prior variance for the effect sizes is challenging. We propose both an empirical method to estimate this prior variance, and a coherent approach to using SNP-level functional data, to inform the prior probability of causal association. Through simulation we show that when ranking SNPs by our empirical Bayes factor in a fine-mapping study, the causal SNP rank is generally as high or higher than the rank using Bayes factors with other plausible values of the prior variance. Importantly, we also show that assigning SNP-specific prior probabilities of association based on expert prior functional knowledge of the disease mechanism can lead to improved causal SNPs ranks compared to ranking with identical prior probabilities of association. We demonstrate the use of our methods by applying the methods to the fine mapping of the CASP8 region of chromosome 2 using genotype data from the Collaborative Oncological Gene-Environment Study (COGS) Consortium. The data we analysed included approximately 46,000 breast cancer case and 43,000 healthy control samples. © 2016 The Authors. *Genetic Epidemiology published by Wiley Periodicals, Inc.

Fuzzy bi-objective linear programming for portfolio selection problem with magnitude ranking function

NASA Astrophysics Data System (ADS)

Kusumawati, Rosita; Subekti, Retno

2017-04-01

Fuzzy bi-objective linear programming (FBOLP) model is bi-objective linear programming model in fuzzy number set where the coefficients of the equations are fuzzy number. This model is proposed to solve portfolio selection problem which generate an asset portfolio with the lowest risk and the highest expected return. FBOLP model with normal fuzzy numbers for risk and expected return of stocks is transformed into linear programming (LP) model using magnitude ranking function.

Low-rank canonical-tensor decomposition of potential energy surfaces: application to grid-based diagrammatic vibrational Green's function theory

DOE PAGES

Rai, Prashant; Sargsyan, Khachik; Najm, Habib; ...

2017-03-07

Here, a new method is proposed for a fast evaluation of high-dimensional integrals of potential energy surfaces (PES) that arise in many areas of quantum dynamics. It decomposes a PES into a canonical low-rank tensor format, reducing its integral into a relatively short sum of products of low-dimensional integrals. The decomposition is achieved by the alternating least squares (ALS) algorithm, requiring only a small number of single-point energy evaluations. Therefore, it eradicates a force-constant evaluation as the hotspot of many quantum dynamics simulations and also possibly lifts the curse of dimensionality. This general method is applied to the anharmonic vibrationalmore » zero-point and transition energy calculations of molecules using the second-order diagrammatic vibrational many-body Green's function (XVH2) theory with a harmonic-approximation reference. In this application, high dimensional PES and Green's functions are both subjected to a low-rank decomposition. Evaluating the molecular integrals over a low-rank PES and Green's functions as sums of low-dimensional integrals using the Gauss–Hermite quadrature, this canonical-tensor-decomposition-based XVH2 (CT-XVH2) achieves an accuracy of 0.1 cm -1 or higher and nearly an order of magnitude speedup as compared with the original algorithm using force constants for water and formaldehyde.« less

Low-rank canonical-tensor decomposition of potential energy surfaces: application to grid-based diagrammatic vibrational Green's function theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rai, Prashant; Sargsyan, Khachik; Najm, Habib

Here, a new method is proposed for a fast evaluation of high-dimensional integrals of potential energy surfaces (PES) that arise in many areas of quantum dynamics. It decomposes a PES into a canonical low-rank tensor format, reducing its integral into a relatively short sum of products of low-dimensional integrals. The decomposition is achieved by the alternating least squares (ALS) algorithm, requiring only a small number of single-point energy evaluations. Therefore, it eradicates a force-constant evaluation as the hotspot of many quantum dynamics simulations and also possibly lifts the curse of dimensionality. This general method is applied to the anharmonic vibrationalmore » zero-point and transition energy calculations of molecules using the second-order diagrammatic vibrational many-body Green's function (XVH2) theory with a harmonic-approximation reference. In this application, high dimensional PES and Green's functions are both subjected to a low-rank decomposition. Evaluating the molecular integrals over a low-rank PES and Green's functions as sums of low-dimensional integrals using the Gauss–Hermite quadrature, this canonical-tensor-decomposition-based XVH2 (CT-XVH2) achieves an accuracy of 0.1 cm -1 or higher and nearly an order of magnitude speedup as compared with the original algorithm using force constants for water and formaldehyde.« less

Multivariable and Bayesian Network Analysis of Outcome Predictors in Acute Aneurysmal Subarachnoid Hemorrhage: Review of a Pure Surgical Series in the Post-International Subarachnoid Aneurysm Trial Era.

PubMed

Zador, Zsolt; Huang, Wendy; Sperrin, Matthew; Lawton, Michael T

2018-06-01

Following the International Subarachnoid Aneurysm Trial (ISAT), evolving treatment modalities for acute aneurysmal subarachnoid hemorrhage (aSAH) has changed the case mix of patients undergoing urgent surgical clipping. To update our knowledge on outcome predictors by analyzing admission parameters in a pure surgical series using variable importance ranking and machine learning. We reviewed a single surgeon's case series of 226 patients suffering from aSAH treated with urgent surgical clipping. Predictions were made using logistic regression models, and predictive performance was assessed using areas under the receiver operating curve (AUC). We established variable importance ranking using partial Nagelkerke R2 scores. Probabilistic associations between variables were depicted using Bayesian networks, a method of machine learning. Importance ranking showed that World Federation of Neurosurgical Societies (WFNS) grade and age were the most influential outcome prognosticators. Inclusion of only these 2 predictors was sufficient to maintain model performance compared to when all variables were considered (AUC = 0.8222, 95% confidence interval (CI): 0.7646-0.88 vs 0.8218, 95% CI: 0.7616-0.8821, respectively, DeLong's P = .992). Bayesian networks showed that age and WFNS grade were associated with several variables such as laboratory results and cardiorespiratory parameters. Our study is the first to report early outcomes and formal predictor importance ranking following aSAH in a post-ISAT surgical case series. Models showed good predictive power with fewer relevant predictors than in similar size series. Bayesian networks proved to be a powerful tool in visualizing the widespread association of the 2 key predictors with admission variables, explaining their importance and demonstrating the potential for hypothesis generation.

Critical Assessment of Small Molecule Identification 2016: automated methods.

PubMed

Schymanski, Emma L; Ruttkies, Christoph; Krauss, Martin; Brouard, Céline; Kind, Tobias; Dührkop, Kai; Allen, Felicity; Vaniya, Arpana; Verdegem, Dries; Böcker, Sebastian; Rousu, Juho; Shen, Huibin; Tsugawa, Hiroshi; Sajed, Tanvir; Fiehn, Oliver; Ghesquière, Bart; Neumann, Steffen

2017-03-27

The fourth round of the Critical Assessment of Small Molecule Identification (CASMI) Contest ( www.casmi-contest.org ) was held in 2016, with two new categories for automated methods. This article covers the 208 challenges in Categories 2 and 3, without and with metadata, from organization, participation, results and post-contest evaluation of CASMI 2016 through to perspectives for future contests and small molecule annotation/identification. The Input Output Kernel Regression (CSI:IOKR) machine learning approach performed best in "Category 2: Best Automatic Structural Identification-In Silico Fragmentation Only", won by Team Brouard with 41% challenge wins. The winner of "Category 3: Best Automatic Structural Identification-Full Information" was Team Kind (MS-FINDER), with 76% challenge wins. The best methods were able to achieve over 30% Top 1 ranks in Category 2, with all methods ranking the correct candidate in the Top 10 in around 50% of challenges. This success rate rose to 70% Top 1 ranks in Category 3, with candidates in the Top 10 in over 80% of the challenges. The machine learning and chemistry-based approaches are shown to perform in complementary ways. The improvement in (semi-)automated fragmentation methods for small molecule identification has been substantial. The achieved high rates of correct candidates in the Top 1 and Top 10, despite large candidate numbers, open up great possibilities for high-throughput annotation of untargeted analysis for "known unknowns". As more high quality training data becomes available, the improvements in machine learning methods will likely continue, but the alternative approaches still provide valuable complementary information. Improved integration of experimental context will also improve identification success further for "real life" annotations. The true "unknown unknowns" remain to be evaluated in future CASMI contests. Graphical abstract .

German dental faculty attitudes towards computer-assisted learning and their correlation with personal and professional profiles.

PubMed

Welk, A; Rosin, M; Seyer, D; Splieth, C; Siemer, M; Meyer, G

2005-08-01

Compared with its potential, computer technology use is still lacking in medical/dental education. To investigate the primary advantages of computer-assisted learning (CAL) systems in German dental education, as well as the reasons for their relatively low degree of use correlated with personal and professional profiles of respondents. A questionnaire was mailed to heads in the departments of conservative dentistry and prosthetic dentistry in all dental schools in Germany. Besides investigating the advantages and barriers to the use of computer technology, the questionnaire also contained questions regarding each respondent's gender, age, academic rank, experience in academia and computer skills. The response rate to the questionnaire was 90% (112 of 125). The results indicated a distinct discrepancy between the desire for and actual occurrence of lectures, seminars, etc. to instruct students in ways to search for and acquire knowledge, especially using computer technology. The highest-ranked advantages of CAL systems in order, as seen by respondents, were the possibilities for individual learning, increased motivation, and both objective theoretical tests and practical tests. The highest-ranked reasons for the low degree of usage of CAL systems in order were the inability to finance, followed equally by a lack of studies of CAL and poor cost-advantage ratio, and too much effort required to integrate CAL into the curriculum. Moreover, the higher the computer skills of the respondents, the more they noted insufficient quality of CAL systems (r = 0.200, P = 0.035) and content differences from their own dental faculty's expert opinions (r = 0.228, P = 0.016) as reasons for low use. The correlations of the attitudes towards CAL with the personal and professional profiles showed not only statistical significant reinforcements of, but also interesting deviations from, the average responses.

Military Education: DOD Needs To Develop Performance Goals and Metrics for Advanced Distributed Learning in Professional Military Education. Report to the Ranking Minority Member Committee on Armed Services, House of Representatives. GAO-04-873

ERIC Educational Resources Information Center

US Government Accountability Office, 2004

2004-01-01

As part of its transformation to prepare the armed forces to meet current and future challenges, the Department of Defense (DOD) is expanding its use of advanced distributed learning (ADL) techniques in senior- and intermediate-level officer professional military education (PME).To determine whether DOD uses a systematic process for evaluating the…

DNorm: disease name normalization with pairwise learning to rank

PubMed Central

Leaman, Robert; Islamaj Doğan, Rezarta; Lu, Zhiyong

2013-01-01

Motivation: Despite the central role of diseases in biomedical research, there have been much fewer attempts to automatically determine which diseases are mentioned in a text—the task of disease name normalization (DNorm)—compared with other normalization tasks in biomedical text mining research. Methods: In this article we introduce the first machine learning approach for DNorm, using the NCBI disease corpus and the MEDIC vocabulary, which combines MeSH® and OMIM. Our method is a high-performing and mathematically principled framework for learning similarities between mentions and concept names directly from training data. The technique is based on pairwise learning to rank, which has not previously been applied to the normalization task but has proven successful in large optimization problems for information retrieval. Results: We compare our method with several techniques based on lexical normalization and matching, MetaMap and Lucene. Our algorithm achieves 0.782 micro-averaged F-measure and 0.809 macro-averaged F-measure, an increase over the highest performing baseline method of 0.121 and 0.098, respectively. Availability: The source code for DNorm is available at http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/DNorm, along with a web-based demonstration and links to the NCBI disease corpus. Results on PubMed abstracts are available in PubTator: http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/PubTator Contact: zhiyong.lu@nih.gov PMID:23969135

An Electromagnetically-Controlled Precision Orbital Tracking Vehicle (POTV)

DTIC Science & Technology

1992-12-01

assume that C > B > A. Then 0 1(t) is purely sinusoidal. tk2 (t) is also sinusoidal because the forcing function z(t) is sinusoidal. 03 (t) is more...an unpredictable -manner. The problem arises from the rank deficiency of the G input matrix as shown below. Remember we have shown already that its...rank can never exceed five because rows two, four, and six are linearly dependent. The rank deficiency arises from the "translational part" of the input

BJUT at TREC 2015 Microblog Track: Real Time Filtering Using Knowledge Base

DTIC Science & Technology

2015-11-20

learning to rank of tweets. In Proceedings of the 23rd International Conference on Computational Linguistics , pages 295–303. Association for Computational... Linguistics , 2010. Thorsten Joachims. Optimizing search engines using clickthrough data. In Proceedings of the eighth ACM SIGKDD international

Spaceborne power systems preference analyses. Volume 1: Summary

NASA Technical Reports Server (NTRS)

Smith, J. H.; Feinberg, A.; Miles, R. F., Jr.

1985-01-01

Sixteen alternative spaceborne nuclear power system concepts were ranked using multiattribute decision analysis to identify promising concepts for further technology development. Four groups interviewed were: safety, systems definition and design, technology assessment, and mission analysis. The ranking results were consistent from group and for different utility function models for individuals.

Molecular recognition in a diverse set of protein-ligand interactions studied with molecular dynamics simulations and end-point free energy calculations.

PubMed

Wang, Bo; Li, Liwei; Hurley, Thomas D; Meroueh, Samy O

2013-10-28

End-point free energy calculations using MM-GBSA and MM-PBSA provide a detailed understanding of molecular recognition in protein-ligand interactions. The binding free energy can be used to rank-order protein-ligand structures in virtual screening for compound or target identification. Here, we carry out free energy calculations for a diverse set of 11 proteins bound to 14 small molecules using extensive explicit-solvent MD simulations. The structure of these complexes was previously solved by crystallography and their binding studied with isothermal titration calorimetry (ITC) data enabling direct comparison to the MM-GBSA and MM-PBSA calculations. Four MM-GBSA and three MM-PBSA calculations reproduced the ITC free energy within 1 kcal·mol(-1) highlighting the challenges in reproducing the absolute free energy from end-point free energy calculations. MM-GBSA exhibited better rank-ordering with a Spearman ρ of 0.68 compared to 0.40 for MM-PBSA with dielectric constant (ε = 1). An increase in ε resulted in significantly better rank-ordering for MM-PBSA (ρ = 0.91 for ε = 10), but larger ε significantly reduced the contributions of electrostatics, suggesting that the improvement is due to the nonpolar and entropy components, rather than a better representation of the electrostatics. The SVRKB scoring function applied to MD snapshots resulted in excellent rank-ordering (ρ = 0.81). Calculations of the configurational entropy using normal-mode analysis led to free energies that correlated significantly better to the ITC free energy than the MD-based quasi-harmonic approach, but the computed entropies showed no correlation with the ITC entropy. When the adaptation energy is taken into consideration by running separate simulations for complex, apo, and ligand (MM-PBSAADAPT), there is less agreement with the ITC data for the individual free energies, but remarkably good rank-ordering is observed (ρ = 0.89). Interestingly, filtering MD snapshots by prescoring protein-ligand complexes with a machine learning-based approach (SVMSP) resulted in a significant improvement in the MM-PBSA results (ε = 1) from ρ = 0.40 to ρ = 0.81. Finally, the nonpolar components of MM-GBSA and MM-PBSA, but not the electrostatic components, showed strong correlation to the ITC free energy; the computed entropies did not correlate with the ITC entropy.

Molecular Recognition in a Diverse Set of Protein-Ligand Interactions Studied with Molecular Dynamics Simulations and End-Point Free Energy Calculations

PubMed Central

Wang, Bo; Li, Liwei; Hurley, Thomas D.; Meroueh, Samy O.

2014-01-01

End-point free energy calculations using MM-GBSA and MM-PBSA provide a detailed understanding of molecular recognition in protein-ligand interactions. The binding free energy can be used to rank-order protein-ligand structures in virtual screening for compound or target identification. Here, we carry out free energy calculations for a diverse set of 11 proteins bound to 14 small molecules using extensive explicit-solvent MD simulations. The structure of these complexes was previously solved by crystallography and their binding studied with isothermal titration calorimetry (ITC) data enabling direct comparison to the MM-GBSA and MM-PBSA calculations. Four MM-GBSA and three MM-PBSA calculations reproduced the ITC free energy within 1 kcal•mol−1 highlighting the challenges in reproducing the absolute free energy from end-point free energy calculations. MM-GBSA exhibited better rank-ordering with a Spearman ρ of 0.68 compared to 0.40 for MM-PBSA with dielectric constant (ε = 1). An increase in ε resulted in significantly better rank-ordering for MM-PBSA (ρ = 0.91 for ε = 10). But larger ε significantly reduced the contributions of electrostatics, suggesting that the improvement is due to the non-polar and entropy components, rather than a better representation of the electrostatics. SVRKB scoring function applied to MD snapshots resulted in excellent rank-ordering (ρ = 0.81). Calculations of the configurational entropy using normal mode analysis led to free energies that correlated significantly better to the ITC free energy than the MD-based quasi-harmonic approach, but the computed entropies showed no correlation with the ITC entropy. When the adaptation energy is taken into consideration by running separate simulations for complex, apo and ligand (MM-PBSAADAPT), there is less agreement with the ITC data for the individual free energies, but remarkably good rank-ordering is observed (ρ = 0.89). Interestingly, filtering MD snapshots by pre-scoring protein-ligand complexes with a machine learning-based approach (SVMSP) resulted in a significant improvement in the MM-PBSA results (ε = 1) from ρ = 0.40 to ρ = 0.81. Finally, the non-polar components of MM-GBSA and MM-PBSA, but not the electrostatic components, showed strong correlation to the ITC free energy; the computed entropies did not correlate with the ITC entropy. PMID:24032517

Support vector methods for survival analysis: a comparison between ranking and regression approaches.

PubMed

Van Belle, Vanya; Pelckmans, Kristiaan; Van Huffel, Sabine; Suykens, Johan A K

2011-10-01

To compare and evaluate ranking, regression and combined machine learning approaches for the analysis of survival data. The literature describes two approaches based on support vector machines to deal with censored observations. In the first approach the key idea is to rephrase the task as a ranking problem via the concordance index, a problem which can be solved efficiently in a context of structural risk minimization and convex optimization techniques. In a second approach, one uses a regression approach, dealing with censoring by means of inequality constraints. The goal of this paper is then twofold: (i) introducing a new model combining the ranking and regression strategy, which retains the link with existing survival models such as the proportional hazards model via transformation models; and (ii) comparison of the three techniques on 6 clinical and 3 high-dimensional datasets and discussing the relevance of these techniques over classical approaches fur survival data. We compare svm-based survival models based on ranking constraints, based on regression constraints and models based on both ranking and regression constraints. The performance of the models is compared by means of three different measures: (i) the concordance index, measuring the model's discriminating ability; (ii) the logrank test statistic, indicating whether patients with a prognostic index lower than the median prognostic index have a significant different survival than patients with a prognostic index higher than the median; and (iii) the hazard ratio after normalization to restrict the prognostic index between 0 and 1. Our results indicate a significantly better performance for models including regression constraints above models only based on ranking constraints. This work gives empirical evidence that svm-based models using regression constraints perform significantly better than svm-based models based on ranking constraints. Our experiments show a comparable performance for methods including only regression or both regression and ranking constraints on clinical data. On high dimensional data, the former model performs better. However, this approach does not have a theoretical link with standard statistical models for survival data. This link can be made by means of transformation models when ranking constraints are included. Copyright © 2011 Elsevier B.V. All rights reserved.

Sign rank versus Vapnik-Chervonenkis dimension

NASA Astrophysics Data System (ADS)

Alon, N.; Moran, Sh; Yehudayoff, A.

2017-12-01

This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

Sex-ratio biasing towards daughters among lower-ranking co-wives in Rwanda.

PubMed

Pollet, Thomas V; Fawcett, Tim W; Buunk, Abraham P; Nettle, Daniel

2009-12-23

There is considerable debate as to whether human females bias the sex ratio of their offspring as a function of their own condition. We apply the Trivers-Willard prediction-that mothers in poor condition will overproduce daughters-to a novel measure of condition, namely wife rank within a polygynous marriage. Using a large-scale sample of over 95 000 Rwandan mothers, we show that lower-ranking polygynous wives do indeed have significantly more daughters than higher-ranking polygynous wives and monogamously married women. This effect remains when controlling for potential confounds such as maternal age. We discuss these results in reference to previous work on sex-ratio adjustment in humans.

The significance of the choice of radiobiological (NTCP) models in treatment plan objective functions.

PubMed

Miller, J; Fuller, M; Vinod, S; Suchowerska, N; Holloway, L

2009-06-01

A Clinician's discrimination between radiation therapy treatment plans is traditionally a subjective process, based on experience and existing protocols. A more objective and quantitative approach to distinguish between treatment plans is to use radiobiological or dosimetric objective functions, based on radiobiological or dosimetric models. The efficacy of models is not well understood, nor is the correlation of the rank of plans resulting from the use of models compared to the traditional subjective approach. One such radiobiological model is the Normal Tissue Complication Probability (NTCP). Dosimetric models or indicators are more accepted in clinical practice. In this study, three radiobiological models, Lyman NTCP, critical volume NTCP and relative seriality NTCP, and three dosimetric models, Mean Lung Dose (MLD) and the Lung volumes irradiated at 10Gy (V10) and 20Gy (V20), were used to rank a series of treatment plans using, harm to normal (Lung) tissue as the objective criterion. None of the models considered in this study showed consistent correlation with the Radiation Oncologists plan ranking. If radiobiological or dosimetric models are to be used in objective functions for lung treatments, based on this study it is recommended that the Lyman NTCP model be used because it will provide most consistency with traditional clinician ranking.

Robust Principal Component Analysis Regularized by Truncated Nuclear Norm for Identifying Differentially Expressed Genes.

PubMed

Wang, Ya-Xuan; Gao, Ying-Lian; Liu, Jin-Xing; Kong, Xiang-Zhen; Li, Hai-Jun

2017-09-01

Identifying differentially expressed genes from the thousands of genes is a challenging task. Robust principal component analysis (RPCA) is an efficient method in the identification of differentially expressed genes. RPCA method uses nuclear norm to approximate the rank function. However, theoretical studies showed that the nuclear norm minimizes all singular values, so it may not be the best solution to approximate the rank function. The truncated nuclear norm is defined as the sum of some smaller singular values, which may achieve a better approximation of the rank function than nuclear norm. In this paper, a novel method is proposed by replacing nuclear norm of RPCA with the truncated nuclear norm, which is named robust principal component analysis regularized by truncated nuclear norm (TRPCA). The method decomposes the observation matrix of genomic data into a low-rank matrix and a sparse matrix. Because the significant genes can be considered as sparse signals, the differentially expressed genes are viewed as the sparse perturbation signals. Thus, the differentially expressed genes can be identified according to the sparse matrix. The experimental results on The Cancer Genome Atlas data illustrate that the TRPCA method outperforms other state-of-the-art methods in the identification of differentially expressed genes.

English Language Learning: Diverse Federal and State Efforts to Support Adult English Language Learning Could Benefit from More Coordination. Report to the Ranking Member, Subcommittee on Children and Families, Committee on Health, Education, Labor, and Pensions, U.S. Senate. GAO-09-575

ERIC Educational Resources Information Center

Ashby, Cornelia M.

2009-01-01

Millions of adults in the U.S. report that they speak limited English, and English language ability appears linked to multiple dimensions of adult life, such as civic participation and workforce participation and mobility. The US Government Accountability Office (GAO) examined: (1) the trends in the need for and enrollment in federally funded…

Performance Reviews for the Orchestral Musician

ERIC Educational Resources Information Center

Watson, Amanda; Forrest, David

2014-01-01

Musicians are appointed to positions in professional symphony orchestras--both rank and file and section principals--following a blind audition process. They perform set repertoire works and orchestral excerpts behind a screen. In many higher education programs, musicians focus on learning the orchestral excerpts and instrumental repertoire that…

Assessment through the Student's Eyes

ERIC Educational Resources Information Center

Stiggins, Rick

2007-01-01

Traditional assessments--which detect and highlight differences in student learning and rank students according to their achievement--inevitably produce winners and losers. Because today's schools cannot afford to leave any child behind, educators need to embrace a new vision of assessment--one that enables all students to become winners. The…

A Needs Assessment of Medical School Faculty: Caring for the Caretakers.

ERIC Educational Resources Information Center

Pololi, Linda H.; Dennis, Kay; Winn, Gloria M.; Mitchell, Jim

2003-01-01

In administrator interviews and a survey of 395 medical school faculty (72% responded), faculty prioritized the following learning needs: sustaining vitality, life balance, meaningful work, relationships, and personal growth. Administrators ranked the following needs for faculty: time management, teamwork, and improved performance. Junior faculty…

Perceptions About Competing Psychosocial Problems and Treatment Priorities Among Older Adults With Depression

PubMed Central

Proctor, Enola K.; Hasche, Leslie; Morrow-Howell, Nancy; Shumway, Martha; Snell, Grace

2009-01-01

Objective Depression often co-occurs with other conditions that may pose competing demands to depression care, particularly in later life. This study examined older adults’ perceptions of depression among cooccurring social, medical, and functional problems and compared the priority of depression with that of other problems. Methods The study’s purposeful sample comprised 49 adults age 60 or older with a history of depression and in publicly funded community long-term care. Fourpart, mixed-methods interviews sought to capture participants’ perceptions of life problems as well as the priority they placed on depression. Methods included standardized depression screening, semistructured qualitative interviews, listing of problems, and qualitative and quantitative analysis of problem rankings. Results Most participants identified health, functional, and psychosocial problems co-occurring with depressive symptoms. Depression was ranked low among the co-occurring conditions; 6% ranked depression as the most important of their problems, whereas 45% ranked it last. Relative rank scores for problems were remarkably similar, with the notable exception of depression, which was ranked lowest of all problems. Participants did not see depression as a high priority compared with co-occurring problems, particularly psychosocial ones. Conclusions Effective and durable improvements to mental health care must be shaped by an understanding of client perceptions and priorities. Motivational interviewing, health education, and assessment of treatment priorities may be necessary in helping older adults value and accept depression care. Nonspecialty settings of care may effectively link depression treatment to other services, thereby increasing receptivity to mental health services. PMID:18511588

Efficiently Selecting the Best Web Services

NASA Astrophysics Data System (ADS)

Goncalves, Marlene; Vidal, Maria-Esther; Regalado, Alfredo; Yacoubi Ayadi, Nadia

Emerging technologies and linking data initiatives have motivated the publication of a large number of datasets, and provide the basis for publishing Web services and tools to manage the available data. This wealth of resources opens a world of possibilities to satisfy user requests. However, Web services may have similar functionality and assess different performance; therefore, it is required to identify among the Web services that satisfy a user request, the ones with the best quality. In this paper we propose a hybrid approach that combines reasoning tasks with ranking techniques to aim at the selection of the Web services that best implement a user request. Web service functionalities are described in terms of input and output attributes annotated with existing ontologies, non-functionality is represented as Quality of Services (QoS) parameters, and user requests correspond to conjunctive queries whose sub-goals impose restrictions on the functionality and quality of the services to be selected. The ontology annotations are used in different reasoning tasks to infer service implicit properties and to augment the size of the service search space. Furthermore, QoS parameters are considered by a ranking metric to classify the services according to how well they meet a user non-functional condition. We assume that all the QoS parameters of the non-functional condition are equally important, and apply the Top-k Skyline approach to select the k services that best meet this condition. Our proposal relies on a two-fold solution which fires a deductive-based engine that performs different reasoning tasks to discover the services that satisfy the requested functionality, and an efficient implementation of the Top-k Skyline approach to compute the top-k services that meet the majority of the QoS constraints. Our Top-k Skyline solution exploits the properties of the Skyline Frequency metric and identifies the top-k services by just analyzing a subset of the services that meet the non-functional condition. We report on the effects of the proposed reasoning tasks, the quality of the top-k services selected by the ranking metric, and the performance of the proposed ranking techniques. Our results suggest that the number of services can be augmented by up two orders of magnitude. In addition, our ranking techniques are able to identify services that have the best values in at least half of the QoS parameters, while the performance is improved.

Curriculum development for a national cardiotocography education program: a Delphi survey to obtain consensus on learning objectives.

PubMed

Thellesen, Line; Hedegaard, Morten; Bergholt, Thomas; Colov, Nina P; Hoegh, Stinne; Sorensen, Jette L

2015-08-01

To define learning objectives for a national cardiotocography (CTG) education program based on expert consensus. A three-round Delphi survey. One midwife and one obstetrician from each maternity unit in Denmark were appointed based on CTG teaching experience and clinical obstetric experience. Following national and international guidelines, the research group determined six topics as important when using CTG: fetal physiology, equipment, indication, interpretation, clinical management, and communication/responsibility. In the first Delphi round, participants listed one to five learning objectives within the predefined topics. Responses were analyzed by a directed approach to content analysis. Phrasing was modified in accordance with Bloom's taxonomy. In the second and third Delphi rounds, participants rated each objective on a five-point relevance scale. Consensus was predefined as objectives with a mean rating value of ≥ 3. A prioritized list of CTG learning objectives. A total of 42 midwives and obstetricians from 21 maternity units were invited to participate, of whom 26 completed all three Delphi rounds, representing 18 maternity units. The final prioritized list included 40 objectives. The highest ranked objectives emphasized CTG interpretation and clinical management. The lowest ranked objectives emphasized fetal physiology. Mean ratings of relevance ranged from 3.15 to 5.00. National consensus on CTG learning objectives was achieved using the Delphi methodology. This was an initial step in developing a valid CTG education program. A prioritized list of objectives will clarify which topics to emphasize in a CTG education program. © 2015 Nordic Federation of Societies of Obstetrics and Gynecology.

A multiplicative process for generating a beta-like survival function with application to the UK 2016 EU referendum results

NASA Astrophysics Data System (ADS)

Fenner, Trevor; Kaufmann, Eric; Levene, Mark; Loizou, George

Human dynamics and sociophysics suggest statistical models that may explain and provide us with better insight into social phenomena. Contextual and selection effects tend to produce extreme values in the tails of rank-ordered distributions of both census data and district-level election outcomes. Models that account for this nonlinearity generally outperform linear models. Fitting nonlinear functions based on rank-ordering census and election data therefore improves the fit of aggregate voting models. This may help improve ecological inference, as well as election forecasting in majoritarian systems. We propose a generative multiplicative decrease model that gives rise to a rank-order distribution and facilitates the analysis of the recent UK EU referendum results. We supply empirical evidence that the beta-like survival function, which can be generated directly from our model, is a close fit to the referendum results, and also may have predictive value when covariate data are available.

VE at Scope Time (VEST): Three construction examples

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sperling, R.B.

1991-04-01

Value Engineering at Scope Time (VEST)'' was published in Value World, January-February-March 1991. That article describes VEST as a four-phase process utilizing the heart'' of VE methodology, which is designed to be used with members of construction design teams to help them focus on the scope of work by doing cost modeling, function analysis, brainstorming and evaluation of ideas. With minimal training designers, architects and engineers can become energized to find creative design solutions and learn an effective, synergistic team approach to facilities design projects using VEST. If time is available, the team can begin the development of some highermore » ranked ideas into preliminary proposals. This paper is an expansion of that article, adding a brief section on training and presenting three examples of VEST on construction projects at a federally-funded research Laboratory.« less

Effect of mating activity and dominance rank on male masturbation among free-ranging male rhesus macaques

PubMed Central

Dubuc, Constance; Coyne, Sean P.; Maestripieri, Dario

2013-01-01

The adaptive function of male masturbation is still poorly understood, despite its high prevalence in humans and other animals. In non-human primates, male masturbation is most frequent among anthropoid monkeys and apes living in multimale-multifemale groups with a promiscuous mating system. In these species, male masturbation may be a non-functional by-product of high sexual arousal or be adaptive by providing advantages in terms of sperm competition or by decreasing the risk of sexually transmitted infections. We investigated the possible functional significance of male masturbation using behavioral data collected on 21 free-ranging male rhesus macaques (Macaca mulatta) at the peak of the mating season. We found some evidence that masturbation is linked to low mating opportunities: regardless of rank, males were most likely to be observed masturbating on days in which they were not observed mating, and lower-ranking males mated less and tended to masturbate more frequently than higher-ranking males. These results echo the findings obtained for two other species of macaques, but contrast those obtained in red colobus monkeys (Procolobus badius) and Cape ground squirrels (Xerus inauris). Interestingly, however, male masturbation events ended with ejaculation in only 15% of the observed masturbation time, suggesting that new hypotheses are needed to explain masturbation in this species. More studies are needed to establish whether male masturbation is adaptive and whether it serves similar or different functions in different sexually promiscuous species. PMID:24187414

Effect of mating activity and dominance rank on male masturbation among free-ranging male rhesus macaques.

PubMed

Dubuc, Constance; Coyne, Sean P; Maestripieri, Dario

2013-11-01

The adaptive function of male masturbation is still poorly understood, despite its high prevalence in humans and other animals. In non-human primates, male masturbation is most frequent among anthropoid monkeys and apes living in multimale-multifemale groups with a promiscuous mating system. In these species, male masturbation may be a non-functional by-product of high sexual arousal or be adaptive by providing advantages in terms of sperm competition or by decreasing the risk of sexually transmitted infections. We investigated the possible functional significance of male masturbation using behavioral data collected on 21 free-ranging male rhesus macaques ( Macaca mulatta ) at the peak of the mating season. We found some evidence that masturbation is linked to low mating opportunities: regardless of rank, males were most likely to be observed masturbating on days in which they were not observed mating, and lower-ranking males mated less and tended to masturbate more frequently than higher-ranking males. These results echo the findings obtained for two other species of macaques, but contrast those obtained in red colobus monkeys ( Procolobus badius ) and Cape ground squirrels ( Xerus inauris ). Interestingly, however, male masturbation events ended with ejaculation in only 15% of the observed masturbation time, suggesting that new hypotheses are needed to explain masturbation in this species. More studies are needed to establish whether male masturbation is adaptive and whether it serves similar or different functions in different sexually promiscuous species.

Evaluation of new multimedia formats for cancer communications.

PubMed

Bader, Judith L; Strickman-Stein, Nancy

2003-01-01

Providing quality, current cancer information to cancer patients and their families is a key function of the National Cancer Institute (NCI) Web site. This information is now provided in predominantly-text format, but could be provided in formats using multimedia, including animation and sound. Since users have many choices about where to get their information, it is important to provide the information in a format that is helpful and that they prefer. To pilot and evaluate multimedia strategies for future cancer-information program formats for lay users, the National Cancer Institute created new multimedia versions of existing text programs. We sought to evaluate user performance and preference on these 3 new formats and on the 2 existing text formats. The National Cancer Institute's "What You Need to Know About Lung Cancer" program was the test vehicle. There were 5 testing sessions, 1 dedicated to each format. Each session lasted about 1 hour, with 9 participants per session and 45 users overall. Users were exposed to the assigned cancer program from beginning to end in 1 of 5 formats: text paperback booklet, paperback booklet formatted in HTML on the Web, spoken audio alone, spoken audio synchronized with a text Web page, and Flash multimedia (animation, spoken audio, and text). Immediately thereafter, the features and design of the 4 alternative formats were demonstrated in detail. A multiple-choice pre-test and post-test quiz on the cancer content was used to assess user learning (performance) before and after experiencing the assigned program. The quiz was administered using an Authorware software interface writing to an Access database. Users were asked to rank from 1 to 5 their preference for the 5 program formats, and provide structured and open-ended comments about usability of the 5 formats. Significant improvement in scores from pre-test to post-test was seen for the total study population. Average scores for users in each of the 5 format groups improved significantly. Increments in improvement, however, were not statistically different between any of the format groups. Significant improvements in quiz scores were seen irrespective of age group or education level. Of the users, 71.1% ranked the Flash program first among the 5 formats, and 84.4% rated Flash as their first or second choice. Audio was the least-preferred format, ranking fifth among 46.7% of users and first among none. Flash was ranked first among users regardless of education level, age group, or format group to which the user was assigned. Under the pilot study conditions, users overwhelmingly preferred the Flash format to the other 4 formats. Learning occurred equally in all formats. Use of multimedia should be considered as communication strategies are developed for updating cancer content and attracting new users.

Evaluation of New Multimedia Formats for Cancer Communications

PubMed Central

Strickman-Stein, Nancy

2003-01-01

Background Providing quality, current cancer information to cancer patients and their families is a key function of the National Cancer Institute (NCI) Web site. This information is now provided in predominantly-text format, but could be provided in formats using multimedia, including animation and sound. Since users have many choices about where to get their information, it is important to provide the information in a format that is helpful and that they prefer. Objective To pilot and evaluate multimedia strategies for future cancer-information program formats for lay users, the National Cancer Institute created new multimedia versions of existing text programs. We sought to evaluate user performance and preference on these 3 new formats and on the 2 existing text formats. Methods The National Cancer Institute's "What You Need to Know About Lung Cancer" program was the test vehicle. There were 5 testing sessions, 1 dedicated to each format. Each session lasted about 1 hour, with 9 participants per session and 45 users overall. Users were exposed to the assigned cancer program from beginning to end in 1 of 5 formats: text paperback booklet, paperback booklet formatted in HTML on the Web, spoken audio alone, spoken audio synchronized with a text Web page, and Flash multimedia (animation, spoken audio, and text). Immediately thereafter, the features and design of the 4 alternative formats were demonstrated in detail. A multiple-choice pre-test and post-test quiz on the cancer content was used to assess user learning (performance) before and after experiencing the assigned program. The quiz was administered using an Authorware software interface writing to an Access database. Users were asked to rank from 1 to 5 their preference for the 5 program formats, and provide structured and open-ended comments about usability of the 5 formats. Results Significant improvement in scores from pre-test to post-test was seen for the total study population. Average scores for users in each of the 5 format groups improved significantly. Increments in improvement, however, were not statistically different between any of the format groups. Significant improvements in quiz scores were seen irrespective of age group or education level. Of the users, 71.1% ranked the Flash program first among the 5 formats, and 84.4% rated Flash as their first or second choice. Audio was the least-preferred format, ranking fifth among 46.7% of users and first among none. Flash was ranked first among users regardless of education level, age group, or format group to which the user was assigned. Conclusions Under the pilot study conditions, users overwhelmingly preferred the Flash format to the other 4 formats. Learning occurred equally in all formats. Use of multimedia should be considered as communication strategies are developed for updating cancer content and attracting new users. PMID:14517107

Ranking of critical species to preserve the functionality of mutualistic networks using the k-core decomposition

PubMed Central

García-Algarra, Javier; Pastor, Juan Manuel; Iriondo, José María

2017-01-01

Background Network analysis has become a relevant approach to analyze cascading species extinctions resulting from perturbations on mutualistic interactions as a result of environmental change. In this context, it is essential to be able to point out key species, whose stability would prevent cascading extinctions, and the consequent loss of ecosystem function. In this study, we aim to explain how the k-core decomposition sheds light on the understanding the robustness of bipartite mutualistic networks. Methods We defined three k-magnitudes based on the k-core decomposition: k-radius, k-degree, and k-risk. The first one, k-radius, quantifies the distance from a node to the innermost shell of the partner guild, while k-degree provides a measure of centrality in the k-shell based decomposition. k-risk is a way to measure the vulnerability of a network to the loss of a particular species. Using these magnitudes we analyzed 89 mutualistic networks involving plant pollinators or seed dispersers. Two static extinction procedures were implemented in which k-degree and k-risk were compared against other commonly used ranking indexes, as for example MusRank, explained in detail in Material and Methods. Results When extinctions take place in both guilds, k-risk is the best ranking index if the goal is to identify the key species to preserve the giant component. When species are removed only in the primary class and cascading extinctions are measured in the secondary class, the most effective ranking index to identify the key species to preserve the giant component is k-degree. However, MusRank index was more effective when the goal is to identify the key species to preserve the greatest species richness in the second class. Discussion The k-core decomposition offers a new topological view of the structure of mutualistic networks. The new k-radius, k-degree and k-risk magnitudes take advantage of its properties and provide new insight into the structure of mutualistic networks. The k-risk and k-degree ranking indexes are especially effective approaches to identify key species to preserve when conservation practitioners focus on the preservation of ecosystem functionality over species richness. PMID:28533969

Ranking of critical species to preserve the functionality of mutualistic networks using the k-core decomposition.

PubMed

García-Algarra, Javier; Pastor, Juan Manuel; Iriondo, José María; Galeano, Javier

2017-01-01

Network analysis has become a relevant approach to analyze cascading species extinctions resulting from perturbations on mutualistic interactions as a result of environmental change. In this context, it is essential to be able to point out key species, whose stability would prevent cascading extinctions, and the consequent loss of ecosystem function. In this study, we aim to explain how the k -core decomposition sheds light on the understanding the robustness of bipartite mutualistic networks. We defined three k -magnitudes based on the k -core decomposition: k -radius, k -degree, and k -risk. The first one, k -radius, quantifies the distance from a node to the innermost shell of the partner guild, while k -degree provides a measure of centrality in the k -shell based decomposition. k -risk is a way to measure the vulnerability of a network to the loss of a particular species. Using these magnitudes we analyzed 89 mutualistic networks involving plant pollinators or seed dispersers. Two static extinction procedures were implemented in which k -degree and k -risk were compared against other commonly used ranking indexes, as for example MusRank, explained in detail in Material and Methods. When extinctions take place in both guilds, k -risk is the best ranking index if the goal is to identify the key species to preserve the giant component. When species are removed only in the primary class and cascading extinctions are measured in the secondary class, the most effective ranking index to identify the key species to preserve the giant component is k -degree. However, MusRank index was more effective when the goal is to identify the key species to preserve the greatest species richness in the second class. The k -core decomposition offers a new topological view of the structure of mutualistic networks. The new k -radius, k -degree and k -risk magnitudes take advantage of its properties and provide new insight into the structure of mutualistic networks. The k -risk and k -degree ranking indexes are especially effective approaches to identify key species to preserve when conservation practitioners focus on the preservation of ecosystem functionality over species richness.

Cross-organism learning method to discover new gene functionalities.

PubMed

Domeniconi, Giacomo; Masseroli, Marco; Moro, Gianluca; Pinoli, Pietro

2016-04-01

Knowledge of gene and protein functions is paramount for the understanding of physiological and pathological biological processes, as well as in the development of new drugs and therapies. Analyses for biomedical knowledge discovery greatly benefit from the availability of gene and protein functional feature descriptions expressed through controlled terminologies and ontologies, i.e., of gene and protein biomedical controlled annotations. In the last years, several databases of such annotations have become available; yet, these valuable annotations are incomplete, include errors and only some of them represent highly reliable human curated information. Computational techniques able to reliably predict new gene or protein annotations with an associated likelihood value are thus paramount. Here, we propose a novel cross-organisms learning approach to reliably predict new functionalities for the genes of an organism based on the known controlled annotations of the genes of another, evolutionarily related and better studied, organism. We leverage a new representation of the annotation discovery problem and a random perturbation of the available controlled annotations to allow the application of supervised algorithms to predict with good accuracy unknown gene annotations. Taking advantage of the numerous gene annotations available for a well-studied organism, our cross-organisms learning method creates and trains better prediction models, which can then be applied to predict new gene annotations of a target organism. We tested and compared our method with the equivalent single organism approach on different gene annotation datasets of five evolutionarily related organisms (Homo sapiens, Mus musculus, Bos taurus, Gallus gallus and Dictyostelium discoideum). Results show both the usefulness of the perturbation method of available annotations for better prediction model training and a great improvement of the cross-organism models with respect to the single-organism ones, without influence of the evolutionary distance between the considered organisms. The generated ranked lists of reliably predicted annotations, which describe novel gene functionalities and have an associated likelihood value, are very valuable both to complement available annotations, for better coverage in biomedical knowledge discovery analyses, and to quicken the annotation curation process, by focusing it on the prioritized novel annotations predicted. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Faculty Rank System, Research Motivation, and Faculty Research Productivity: Measure Refinement and Theory Testing.

ERIC Educational Resources Information Center

Tien, Flora F.; Blackburn, Robert T.

1996-01-01

A study explored the relationship between the traditional system of college faculty rank and faculty research productivity from the perspectives of behavioral reinforcement theory and selection function. Six hypotheses were generated and tested, using data from a 1989 national faculty survey. Results failed to support completely either the…

Automated high-grade prostate cancer detection and ranking on whole slide images

NASA Astrophysics Data System (ADS)

Huang, Chao-Hui; Racoceanu, Daniel

2017-03-01

Recently, digital pathology (DP) has been largely improved due to the development of computer vision and machine learning. Automated detection of high-grade prostate carcinoma (HG-PCa) is an impactful medical use-case showing the paradigm of collaboration between DP and computer science: given a field of view (FOV) from a whole slide image (WSI), the computer-aided system is able to determine the grade by classifying the FOV. Various approaches have been reported based on this approach. However, there are two reasons supporting us to conduct this work: first, there is still room for improvement in terms of detection accuracy of HG-PCa; second, a clinical practice is more complex than the operation of simple image classification. FOV ranking is also an essential step. E.g., in clinical practice, a pathologist usually evaluates a case based on a few FOVs from the given WSI. Then, makes decision based on the most severe FOV. This important ranking scenario is not yet being well discussed. In this work, we introduce an automated detection and ranking system for PCa based on Gleason pattern discrimination. Our experiments suggested that the proposed system is able to perform high-accuracy detection ( 95:57% +/- 2:1%) and excellent performance of ranking. Hence, the proposed system has a great potential to support the daily tasks in the medical routine of clinical pathology.

Fast Component Pursuit for Large-Scale Inverse Covariance Estimation.

PubMed

Han, Lei; Zhang, Yu; Zhang, Tong

2016-08-01

The maximum likelihood estimation (MLE) for the Gaussian graphical model, which is also known as the inverse covariance estimation problem, has gained increasing interest recently. Most existing works assume that inverse covariance estimators contain sparse structure and then construct models with the ℓ 1 regularization. In this paper, different from existing works, we study the inverse covariance estimation problem from another perspective by efficiently modeling the low-rank structure in the inverse covariance, which is assumed to be a combination of a low-rank part and a diagonal matrix. One motivation for this assumption is that the low-rank structure is common in many applications including the climate and financial analysis, and another one is that such assumption can reduce the computational complexity when computing its inverse. Specifically, we propose an efficient COmponent Pursuit (COP) method to obtain the low-rank part, where each component can be sparse. For optimization, the COP method greedily learns a rank-one component in each iteration by maximizing the log-likelihood. Moreover, the COP algorithm enjoys several appealing properties including the existence of an efficient solution in each iteration and the theoretical guarantee on the convergence of this greedy approach. Experiments on large-scale synthetic and real-world datasets including thousands of millions variables show that the COP method is faster than the state-of-the-art techniques for the inverse covariance estimation problem when achieving comparable log-likelihood on test data.

Individual Differences in Learning Computer Programming: A Social Cognitive Approach

ERIC Educational Resources Information Center

Akar, Sacide Guzin Mazman; Altun, Arif

2017-01-01

The purpose of this study is to investigate and conceptualize the ranks of importance of social cognitive variables on university students' computer programming performances. Spatial ability, working memory, self-efficacy, gender, prior knowledge and the universities students attend were taken as variables to be analyzed. The study has been…

Democracy and Higher Education: The Nature of the Relationship

ERIC Educational Resources Information Center

Holland, Lauren

2009-01-01

This study examines the pedagogical conditions that contribute to political learning in American National Government courses, using data from classes taught at universities and colleges in Utah. The purpose of this research is to assess the relative effect of course content, classroom climate, textbook, institutional ranking and class size on…

Nutrition and Learning: The Breakfast Role.

ERIC Educational Resources Information Center

Stein, Annette; And Others

A pilot study examined the effects of improved breakfast nutrition on students' academic achievement. Participants were 142 intermediate school children who usually ate breakfast in school. All children were given the Gates-MacGinitie Reading Tests, Form 1, Levels A-D, and were ranked according to their total reading scores. The experimental and…

Training Top 125

ERIC Educational Resources Information Center

Training, 2011

2011-01-01

Top companies realize how vital training is to their success and continue to invest in it, even in trying times. This article presents "Training" magazine's 11th annual ranking of the top companies with employee-sponsored workforce training and development. First-time No. 1 winner Farmers Insurance puts such a premium on learning that its new…

Small Learning Communities Meet School-to-Work: Whole-School Restructuring for Urban Comprehensive High Schools. Report No. 31.

ERIC Educational Resources Information Center

Legters, Nettie E.

This report describes specific reform practices schools are implementing to realize the vision set forth in the National Association of Secondary School Principals document, "Breaking Ranks," which calls for changes in curriculum, instruction, assessment, school organization, professional development, community partnerships, and…

Confusion in the Ranks: How Good Are England's Schools?

ERIC Educational Resources Information Center

Smithers, Alan

2013-01-01

Understanding how well English education performs compared with other countries is a valuable exercise, particularly because the information can help England and other countries learn from successful systems. The most recent international league tables of pupil performance differ considerably. England languishes well down the list in PISA 2009,…

Automated Assessment in a Programming Tools Course

ERIC Educational Resources Information Center

Fernandez Aleman, J. L.

2011-01-01

Automated assessment systems can be useful for both students and instructors. Ranking and immediate feedback can have a strongly positive effect on student learning. This paper presents an experience using automatic assessment in a programming tools course. The proposal aims at extending the traditional use of an online judging system with a…

Transformative Research-Based Pedagogy Workshops for Chemistry Graduate Students and Postdocs

ERIC Educational Resources Information Center

Bauer, Christopher; Libby, R. Daniel; Scharberg, Maureen; Reider, David

2013-01-01

One-day professional development workshops for graduate students and postdocs were held at top National Research Council--ranked chemistry research departments. Attendees intend to pursue academic careers, yet their experience and knowledge about teaching and learning were small. Postsurveys indicated that despite the short duration, the workshop…

How to Start a STEM Team

ERIC Educational Resources Information Center

Hughes, Bill

2009-01-01

The United States' poor performance in teaching math and science eliminates many of the best and brightest school children from the ranks of future scientists and engineers. With little chance to learn in school how science and math skills might translate into professionally useful knowledge, students are unable to make informed choices about…

Cautions about Inferences from International Assessments: The Case of PISA 2009

ERIC Educational Resources Information Center

Ercikan, Kadriye; Roth, Wolff-Michael; Asil, Mustafa

2015-01-01

Background/Context: Two key uses of international assessments of achievement have been (a) comparing country performances for identifying the countries with the best education systems and (2) generating insights about effective policy and practice strategies that are associated with higher learning outcomes. Do country rankings really reflect the…

Middle Grade Students' Interpretations of Contourmaps

ERIC Educational Resources Information Center

Carter, Glenda; Cook, Michelle; Park, John C.; Wiebe, Eric N.; Butler, Susan M.

2008-01-01

This study examined eighth graders' approach to three tasks implemented to assist students with learning to interpret contour maps. Students' approach to and interpretation of these three tasks were analyzed qualitatively. When students were rank ordered according to their scores on a standardized test of spatial ability, the Minnesota Paper Form…

Rating Teacher-Preparation Programs

ERIC Educational Resources Information Center

Von Hippel, Paul T.; Bellows, Laura

2018-01-01

Recent policies intended to improve teacher quality have focused on the preparation that teachers receive before entering the classroom. A short-lived federal rule would have required every state to assess and rank teacher-preparation programs by their graduates' impact on student learning. Though the federal rule was repealed, last year some 21…

Home-School Relationships: A School Management Perspective

ERIC Educational Resources Information Center

Stringer, Patricia; Hourani, Rida Blaik

2013-01-01

Abu Dhabi, United Arab Emirates (UAE) is in the process of initiating major education reform designed to improve schools. Parental involvement in support of student learning ranks high on the reform agenda. This study explores managerial aspects of implementing home-school relationships in seven primary Public Private Partnership (PPP) schools in…

"Breaking Ranks" in Action: Flexibility Required

ERIC Educational Resources Information Center

Hartzman, Marlene; Mero, Dianne

2011-01-01

Much like the MetLife Foundation-NASSP Breakthrough Schools that came before them, the honoree schools this year are remarkable. In addition to offering students safe and challenging learning environments, the schools also afford their adult members a respectful, collaborative place to work and grow, and they give their diverse communities an…

Effects of Professorial Tenure on Undergraduate Ratings of Teaching Performance

ERIC Educational Resources Information Center

Cheng, Dorothy A.

2015-01-01

This study estimates the effect of professorial tenure on undergraduate ratings of learning, instructor quality, and course quality at the University of California, San Diego from Summer 2004 to Spring 2012. During this eight-year period, 120 assistant professors received tenure and 83 associate professors attained full rank. A…

Developing a Faculty Learning Community for Non-Tenure Track Professors

ERIC Educational Resources Information Center

Bond, Nathan

2015-01-01

Non-tenure track faculty vary greatly in terms of their ranks, teaching abilities, workloads, and motivational levels and have unique professional development needs. In response, universities are differentiating professional development for these professors. This case study examined an emerging research university's efforts to provide a faculty…

Autonomy Support for Online Students

ERIC Educational Resources Information Center

Lee, Eunbae; Pate, Joseph A.; Cozart, Deanna

2015-01-01

Despite the rapid growth of online learning in higher education, the dropout rates for online courses has reached 50 percent. Lack of student engagement rank as a critical reason for frequent online course dropout. This article discusses autonomy support as a strategy to enhance online students' intrinsic motivation and engagement. Drawing from…

Successful Leadership in High Poverty, Urban Schools. Implications from UCEA

ERIC Educational Resources Information Center

Jacobson, Stephen; Terry Orr, M.; Young, Michelle D.

2008-01-01

Research shows that leadership matters in improving student achievement. In fact, among school-related factors over which policy makers have some control, effective leadership practices rank second only to the quality of teaching in influencing student learning (Leithwood, Louis, Anderson & Wahlstrom, 2004). Quality leadership is particularly…

Ranking by Medians

ERIC Educational Resources Information Center

Martin, Brian

2016-01-01

Brian Martin describes a difficult committee meeting he once attended which consisted of one representative from each department. When the meeting ended it left a bitter taste for many who participated. Having learned from this experience, Martin became a chair of the committee and tried a new system that overcame many of the previous problems.…

Spectral Regularization Algorithms for Learning Large Incomplete Matrices.

PubMed

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-03-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 10(6) × 10(6) incomplete matrix with 10(5) observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques.

Spectral Regularization Algorithms for Learning Large Incomplete Matrices

PubMed Central

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-01-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 106 × 106 incomplete matrix with 105 observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques. PMID:21552465

Evaluation of a residency program's experience with a one-week emergency medicine resident rotation at a medical liability insurance company.

PubMed

Houry, D; Shockley, L W

2001-07-01

The authors' residency program implemented a one-week rotation at the office of a medical liability insurance company. Residents examined 30 closed malpractice claims cases and sat in on settlement discussions. To review the residents' evaluations of their experiences and to determine whether this was a worthwhile addition to the emergency medicine (EM) residency curriculum. This was a five-year retrospective study that reviewed residents' annual evaluations from 1994 to 1999 regarding the medical liability rotation. A five-point scale was used to score specific categories in the rotation and an open-ended section was used to collect general comments. A total of 179 resident evaluations were reviewed. The quality of teaching ranked in the 80th percentile, the clinical caseload ranked in the 85th percentile, and level of responsibility ranked in the 79th percentile for all EM rotations. Specific comments included "All MDs should do this in their training"; "Quite an eye opener"; and "Good exposure to legal aspects of EM." Overall, EM residents found the one-week rotation to be invaluable and a good learning experience. This rotation ranked above average when compared with all of our other EM residency rotations.

Real-time learning of predictive recognition categories that chunk sequences of items stored in working memory

PubMed Central

Kazerounian, Sohrob; Grossberg, Stephen

2014-01-01

How are sequences of events that are temporarily stored in a cognitive working memory unitized, or chunked, through learning? Such sequential learning is needed by the brain in order to enable language, spatial understanding, and motor skills to develop. In particular, how does the brain learn categories, or list chunks, that become selectively tuned to different temporal sequences of items in lists of variable length as they are stored in working memory, and how does this learning process occur in real time? The present article introduces a neural model that simulates learning of such list chunks. In this model, sequences of items are temporarily stored in an Item-and-Order, or competitive queuing, working memory before learning categorizes them using a categorization network, called a Masking Field, which is a self-similar, multiple-scale, recurrent on-center off-surround network that can weigh the evidence for variable-length sequences of items as they are stored in the working memory through time. A Masking Field hereby activates the learned list chunks that represent the most predictive item groupings at any time, while suppressing less predictive chunks. In a network with a given number of input items, all possible ordered sets of these item sequences, up to a fixed length, can be learned with unsupervised or supervised learning. The self-similar multiple-scale properties of Masking Fields interacting with an Item-and-Order working memory provide a natural explanation of George Miller's Magical Number Seven and Nelson Cowan's Magical Number Four. The article explains why linguistic, spatial, and action event sequences may all be stored by Item-and-Order working memories that obey similar design principles, and thus how the current results may apply across modalities. Item-and-Order properties may readily be extended to Item-Order-Rank working memories in which the same item can be stored in multiple list positions, or ranks, as in the list ABADBD. Comparisons with other models, including TRACE, MERGE, and TISK, are made. PMID:25339918

Workflows and performances in the ranking prediction of 2016 D3R Grand Challenge 2: lessons learned from a collaborative effort.

PubMed

Gao, Ying-Duo; Hu, Yuan; Crespo, Alejandro; Wang, Deping; Armacost, Kira A; Fells, James I; Fradera, Xavier; Wang, Hongwu; Wang, Huijun; Sherborne, Brad; Verras, Andreas; Peng, Zhengwei

2018-01-01

The 2016 D3R Grand Challenge 2 includes both pose and affinity or ranking predictions. This article is focused exclusively on affinity predictions submitted to the D3R challenge from a collaborative effort of the modeling and informatics group. Our submissions include ranking of 102 ligands covering 4 different chemotypes against the FXR ligand binding domain structure, and the relative binding affinity predictions of the two designated free energy subsets of 15 and 18 compounds. Using all the complex structures prepared in the same way allowed us to cover many types of workflows and compare their performances effectively. We evaluated typical workflows used in our daily structure-based design modeling support, which include docking scores, force field-based scores, QM/MM, MMGBSA, MD-MMGBSA, and MacroModel interaction energy estimations. The best performing methods for the two free energy subsets are discussed. Our results suggest that affinity ranking still remains very challenging; that the knowledge of more structural information does not necessarily yield more accurate predictions; and that visual inspection and human intervention are considerably important for ranking. Knowledge of the mode of action and protein flexibility along with visualization tools that depict polar and hydrophobic maps are very useful for visual inspection. QM/MM-based workflows were found to be powerful in affinity ranking and are encouraged to be applied more often. The standardized input and output enable systematic analysis and support methodology development and improvement for high level blinded predictions.