Abstract and associatively based representations in human sequence learning

We give an analysis of performance in an artificial neural network for which the claim had been made that it could learn abstract representations. Our argument is that this network is associative in nature, and cannot develop abstract representations. The network thus converges to a solution that is solely based on the statistical regularities of the training set. Inspired by human experiments that have shown that humans can engage in both associative (statistical) and abstract learning, we present a new, hybrid computational model that combines associative and more abstract, cognitive processes. To cross-validate the model we attempted to predict human behaviour in further experiments. One of these experiments reveals some evidence for the use of abstract representations, whereas the others provide evidence for associatively based performance. The predictions of the hybrid model stand in line with our empirical data.     

Complete probabilistic analysis of RNA shapes

Background  

Soon after the first algorithms for RNA folding became available, it was recognised that the prediction of only one energetically optimal structure is insufficient to achieve reliable results. An in-depth analysis of the folding space as a whole appeared necessary to deduce the structural properties of a given RNA molecule reliably. Folding space analysis comprises various methods such as suboptimal folding, computation of base pair probabilities, sampling procedures and abstract shape analysis. Common to many approaches is the idea of partitioning the folding space into classes of structures, for which certain properties can be derived.     

Using rule-based machine learning for candidate disease gene prioritization and sample classification of cancer gene expression data

Microarray data analysis has been shown to provide an effective tool for studying cancer and genetic diseases. Although classical machine learning techniques have successfully been applied to find informative genes and to predict class labels for new samples, common restrictions of microarray analysis such as small sample sizes, a large attribute space and high noise levels still limit its scientific and clinical applications. Increasing the interpretability of prediction models while retaining a high accuracy would help to exploit the information content in microarray data more effectively. For this purpose, we evaluate our rule-based evolutionary machine learning systems, BioHEL and GAssist, on three public microarray cancer datasets, obtaining simple rule-based models for sample classification. A comparison with other benchmark microarray sample classifiers based on three diverse feature selection algorithms suggests that these evolutionary learning techniques can compete with state-of-the-art methods like support vector machines. The obtained models reach accuracies above 90% in two-level external cross-validation, with the added value of facilitating interpretation by using only combinations of simple if-then-else rules. As a further benefit, a literature mining analysis reveals that prioritizations of informative genes extracted from BioHEL's classification rule sets can outperform gene rankings obtained from a conventional ensemble feature selection in terms of the pointwise mutual information between relevant disease terms and the standardized names of top-ranked genes.     

Gene clustering by latent semantic indexing of MEDLINE abstracts

MOTIVATION: A major challenge in the interpretation of high-throughput genomic data is understanding the functional associations between genes. Previously, several approaches have been described to extract gene relationships from various biological databases using term-matching methods. However, more flexible automated methods are needed to identify functional relationships (both explicit and implicit) between genes from the biomedical literature. In this study, we explored the utility of Latent Semantic Indexing (LSI), a vector space model for information retrieval, to automatically identify conceptual gene relationships from titles and abstracts in MEDLINE citations. RESULTS: We found that LSI identified gene-to-gene and keyword-to-gene relationships with high average precision. In addition, LSI identified implicit gene relationships based on word usage patterns in the gene abstract documents. Finally, we demonstrate here that pairwise distances derived from the vector angles of gene abstract documents can be effectively used to functionally group genes by hierarchical clustering. Our results provide proof-of-principle that LSI is a robust automated method to elucidate both known (explicit) and unknown (implicit) gene relationships from the biomedical literature. These features make LSI particularly useful for the analysis of novel associations discovered in genomic experiments. AVAILABILITY: The 50-gene document collection used in this study can be interactively queried at http://shad.cs.utk.edu/sgo/sgo.html.     

Formation of a direction map by projection learning using Kohonen's self-organization map

 In this paper, we propose a modification of Kohonen's self-organization map (SOM) algorithm. When the input signal space is not convex, some reference vectors of SOM can protrude from it. The input signal space must be convex to keep all the reference vectors fixed on it for any updates. Thus, we introduce a projection learning method that fixes the reference vectors onto the input signal space. This version of SOM can be applied to a non-convex input signal space. We applied SOM with projection learning to a direction map observed in the primary visual cortex of area 17 of ferrets, and area 18 of cats. Neurons in those areas responded selectively to the orientation of edges or line segments, and their directions of motion. Some iso-orientation domains were subdivided into selective regions for the opposite direction of motion. The abstract input signal space of the direction map described in the manner proposed by Obermayer and Blasdel [(1993) J Neurosci 13: 4114–4129] is not convex. We successfully used SOM with projection learning to reproduce a direction-orientation joint map. Received: 29 September 2000 / Accepted: 7 March 2001     

The comparison of motor learning performance with and without feedback

Ten individuals were divided into two feedback and no-feedback groups. The effect of abstract visual feedback was investigated in these two groups. Using eight electroencephalography (EEG) electrodes, the induced event-related desynchronization/synchronization of the EEG of three motor imagery tasks (left hand, right hand, and right foot) was analyzed by wavelet and spatial filtering methods. Linear discriminant analysis was used to classify the three imagery tasks. Each imagery task's total length was set to 3?s and 1?s of it was used for the classification. The classification result was shown to the subjects of the feedback group in a real-time manner as an abstract visual feedback. While the paired t-test of the first and third sessions of the training days confirmed the improvement of the motor imagery learning in the feedback group (p?<?0.01), the motor imagery learning of the no-feedback group was not significant.     

Representing contrast detection as an eigenvalue problem.

Contrast detection can be formulated as an eigenvalue problem. One of the simplest resulting models has only two parameters. The model is space variant and employs the Hermite functions as eigenfunctions. Computing the response to a sinusoidal acuity grating yields the observer's contrast response. The model itself, however, is developed within an abstract mathematical framework which is general enough to include Fourier analysis as a special case. Consequently, the methods of Fourier analysis are generalized to those of eigenfunction expansion and the spectral theory of linear operators.     

On the use of cartographic projections in visualizing phylo-genetic tree space

Phylogenetic analysis is becoming an increasingly important tool for biological research. Applications include epidemiological studies, drug development, and evolutionary analysis. Phylogenetic search is a known NP-Hard problem. The size of the data sets which can be analyzed is limited by the exponential growth in the number of trees that must be considered as the problem size increases. A better understanding of the problem space could lead to better methods, which in turn could lead to the feasible analysis of more data sets. We present a definition of phylogenetic tree space and a visualization of this space that shows significant exploitable structure. This structure can be used to develop search methods capable of handling much larger data sets.     

Predicting protein subcellular location with network embedding and enrichment features

The subcellular location of a protein is highly related to its function. Identifying the location of a given protein is an essential step for investigating its related problems. Traditional experimental methods can produce solid determination. However, their limitations, such as high cost and low efficiency, are evident. Computational methods provide an alternative means to address these problems. Most previous methods constantly extract features from protein sequences or structures for building prediction models. In this study, we use two types of features and combine them to construct the model. The first feature type is extracted from a protein–protein interaction network to abstract the relationship between the encoded protein and other proteins. The second type is obtained from gene ontology and biological pathways to indicate the existing functions of the encoded protein. These features are analyzed using some feature selection methods. The final optimum features are adopted to build the model with recurrent neural network as the classification algorithm. Such model yields good performance with Matthews correlation coefficient of 0.844. A decision tree is used as a rule learning classifier to extract decision rules. Although the performance of decision rules is poor, they are valuable in revealing the molecular mechanism of proteins with different subcellular locations. The final analysis confirms the reliability of the extracted rules. The source code of the propose method is freely available at https://github.com/xypan1232/rnnloc     

Creating abstract topographic representations: Implications for coding,learning and reasoning

Topographic maps are a fundamental and ubiquitous feature of the sensory and motor regions of the brain. There is less evidence for the existence of conventional topographic maps in associational areas of the brain such as the prefrontal cortex and parietal cortex. The existence of topographically arranged anatomical projections is far more widespread and occurs in associational regions of the brain as well as sensory and motor regions: this points to a more widespread existence of topographically organised maps within associational cortex than currently recognised. Indeed, there is increasing evidence that abstract topographic representations may also occur in these regions. For example, a topographic mnemonic map of visual space has been described in the dorsolateral prefrontal cortex and topographically arranged visuospatial attentional signals have been described in parietal association cortex. This article explores how abstract representations might be extracted from sensory topographic representations and subsequently code abstract information. Finally a simple model is presented that shows how abstract topographic representations could be integrated with other information within the brain to solve problems or form abstract associations. The model uses correlative firing to detect associations between different types of stimuli. It is flexible because it can produce correlations between information represented in a topographic or non-topographic coordinate system. It is proposed that a similar process could be used in high-level cognitive operations such as learning and reasoning.     

A machine learning information retrieval approach to protein fold recognition

MOTIVATION: Recognizing proteins that have similar tertiary structure is the key step of template-based protein structure prediction methods. Traditionally, a variety of alignment methods are used to identify similar folds, based on sequence similarity and sequence-structure compatibility. Although these methods are complementary, their integration has not been thoroughly exploited. Statistical machine learning methods provide tools for integrating multiple features, but so far these methods have been used primarily for protein and fold classification, rather than addressing the retrieval problem of fold recognition-finding a proper template for a given query protein. RESULTS: Here we present a two-stage machine learning, information retrieval, approach to fold recognition. First, we use alignment methods to derive pairwise similarity features for query-template protein pairs. We also use global profile-profile alignments in combination with predicted secondary structure, relative solvent accessibility, contact map and beta-strand pairing to extract pairwise structural compatibility features. Second, we apply support vector machines to these features to predict the structural relevance (i.e. in the same fold or not) of the query-template pairs. For each query, the continuous relevance scores are used to rank the templates. The FOLDpro approach is modular, scalable and effective. Compared with 11 other fold recognition methods, FOLDpro yields the best results in almost all standard categories on a comprehensive benchmark dataset. Using predictions of the top-ranked template, the sensitivity is approximately 85, 56, and 27% at the family, superfamily and fold levels respectively. Using the 5 top-ranked templates, the sensitivity increases to 90, 70, and 48%.     

基于CiteSpace生物化学实验教学动态与热点可视化分析

生物化学是生物学和医学学科非常重要的基础课程,是进入21世纪以来发展最为迅速和最具活力的学科之一.生物化学理论教学极具抽象性,所以其实验教学是理解相关理论与掌握实际技能的重要环节.在生物化学实验教学过程中,及时掌握新的教学理念,新的教学方法,新的教学热点,紧跟教学发展趋势一直是教师们关注的重点问题.本文以中国学术期刊网...     

The learning skills of primates: The rhesus macaque in comparative perspective

Twenty-month-old rhesus monkeys were tested in a modified discrimination-reversal paradigm, which was designed to distinguish abstract learning from stimulus-response associational learning. Previous studies indicate that talapoin monkeys learn associationally and great apes via forming abstract concepts. Adult rhesus monkeys are apparently capable of forming simple abstractions, but learn primarily through associational process. The results of this study show the adolescent rhesus monkeys to be associational learners, with their response patterns indicating more complexity than the talapoins but less than the adult rhesus monkeys. The data suggest that rhesus monkeys develop their low-level capacity of abstract learning with maturation.     

基于空间生态特性的景观图式语言研究方法与方法论

图式语言是基于景观空间的生态特性而建立的一种表达景观地方性和空间逻辑的新范式,是以图式为基本语言符号研究景观空间由基本空间、复合空间到整体景观空间的基本语汇与基本逻辑关系,并为塑造新景观提供语汇、语法等图式语言体系的支撑。图式语言研究是采用了景观空间原型与高效空间、空间选择与样本分析、空间抽象与图式提取、图式语汇与空间逻辑以及图式语言体系构建与验证的研究方法。图式语言的研究方法是基于结构主义与解构主义、自组织协同理论与逻辑设计、空间生成过程与空间推理以及景观的多重表意与语用学等方法论基础之上的。图式语言的研究方法和方法论基础是景观空间的系统性、有机性和演变性决定的,是多学科研究方法和方法论的综合。     

New deep learning-based methods for visualizing ecosystem properties using environmental DNA metabarcoding data

Environmental DNA (eDNA) metabarcoding provides an efficient approach for documenting biodiversity patterns in marine and terrestrial ecosystems. The complexity of these data prevents current methods from extracting and analyzing all the relevant ecological information they contain, and new methods may provide better dimensionality reduction and clustering. Here we present two new deep learning-based methods that combine different types of neural networks (NNs) to ordinate eDNA samples and visualize ecosystem properties in a two-dimensional space: the first is based on variational autoencoders and the second on deep metric learning. The strength of our new methods lies in the combination of two inputs: the number of sequences found for each molecular operational taxonomic unit (MOTU) detected and their corresponding nucleotide sequence. Using three different datasets, we show that our methods accurately represent several biodiversity indicators in a two-dimensional latent space: MOTU richness per sample, sequence α-diversity per sample, Jaccard's and sequence β-diversity between samples. We show that our nonlinear methods are better at extracting features from eDNA datasets while avoiding the major biases associated with eDNA. Our methods outperform traditional dimension reduction methods such as Principal Component Analysis, t-distributed Stochastic Neighbour Embedding, Nonmetric Multidimensional Scaling and Uniform Manifold Approximation and Projection for dimension reduction. Our results suggest that NNs provide a more efficient way of extracting structure from eDNA metabarcoding data, thereby improving their ecological interpretation and thus biodiversity monitoring.     

Shark detection and classification with machine learning

Suitable shark conservation depends on well-informed population assessments. Direct methods such as scientific surveys and fisheries monitoring are adequate for defining population statuses, but species-specific indices of abundance and distribution coming from these sources are rare for most shark species. We can rapidly fill these information gaps by boosting media-based remote monitoring efforts with machine learning and automation.We created a database of 53,345 shark images covering 219 species of sharks, and packaged object-detection and image classification models into a Shark Detector bundle. The Shark Detector recognizes and classifies sharks from videos and images using transfer learning and convolutional neural networks (CNNs). We applied these models to common data-generation approaches of sharks: collecting occurrence records from photographs taken by the public or citizen scientists, processing baited remote camera footage and online videos, and data-mining Instagram. We examined the accuracy of each model and tested genus and species prediction correctness as a result of training data quantity.The Shark Detector can classify 47 species pertaining to 26 genera. It sorted heterogeneous datasets of images sourced from Instagram with 91% accuracy and classified species with 70% accuracy. It located sharks in baited remote footage and YouTube videos with 89% accuracy, and classified located subjects to the species level with 69% accuracy. All data-generation methods were processed without manual interaction.As media-based remote monitoring appears to dominate methods for observing sharks in nature, we developed an open-source Shark Detector to facilitate common identification applications. Prediction accuracy of the software pipeline increases as more images are added to the training dataset. We provide public access to the software on our GitHub page.     

The geometry of shape space: application to influenza

Shape space was proposed over 20 years ago as a conceptual formalism in which to represent antibody/antigen binding. It has since played a key role in computational immunology. Antigens and antibodies are considered to be points in an abstract "shape space", where coordinates of points in this space represent generalized physico-chemical properties associated with various (unspecified) physical properties related to binding, such as geometric shape, hydrophobicity, charge, etc. Distances in shape space between points representing antibodies and (the shape complement) of antigens are assumed to be related to their affinity, with small distances corresponding to high affinity. In this paper, we provide algorithms, related to metric and ordinal multidimensional scaling algorithms first developed in the mathematical psychology literature, which construct explicit, quantitative coordinates for points in shape space given experimental data such as hemagglutination inhibition assays, or other general affinity assays. Previously, such coordinates had been conceptual constructs and totally implicit. The dimension of shape space deduced from hemagglutination inhibition assays for influenza is low, approximately five dimensional.The deduction of the explicit geometry of shape space given experimental affinity data provides new ways to quantify the similarity of antibodies to antibodies, antigens to antigens, and the affinity of antigens to antibodies. This has potential utility in, e.g. strain selection decisions for annual influenza vaccines, among other applications. The analysis techniques presented here are not restricted to the analysis of antibody-antigen interactions and are generally applicable to affinity data resulting from binding assays.     

Optimal models for social change

By assigning coordinates to the environmental function space comprising all physical and mental stimuli, mathematical interpretations can be based on such terms as adaptability, and reactivity which relate to individuals interacting with their environment within a society. These psychometric concepts are incorporated into a framework of functional analysis, which permits the optimization of social change by maximizing the satisfaction integral through the use of variational or dynamic programming methods in conjunction with some optimal social policy. The approach provides a mathematical connection between psychology and sociology, and further demonstrates that existing forms of government are simulated by differential equations belonging to the same general class. The synthesis of new classes of functional equations describing social progress is visualized as a legitimate objective for abstract mathematical sociology.     

Species Delimitation and Analysis of Cryptic Species Diversity in the XXI Century

The potentials and limitations of different approaches to revealing species boundaries and describing cryptic species are discussed. Both the traditional methods of species delimitation, mostly based on morphological analysis, and the approaches using molecular markers are considered. Besides, the prospects of species identification using digital image recognition and machine learning are briefly considered. It is concluded that molecular markers provide very important material for species delimitation; the value of these data increases manifold if they can be compared with information on morphology, geographic distribution, and ecological preferences of the studied taxa. In many cases, only a practicing taxonomist who knows his or her group thoroughly can correctly interpret the molecular data and incorporate them into the existing knowledge system in order to make a taxonomic decision.