Biblio Discovery — Demo Discovery Service

685 results for machine learning

Showing 141–160 · 0.45 seconds · RSS

  1. Journal Article Full text

    Systematic Learning of Gene Functional Classes From DNA Array Expression Data by Using Multilayer Perceptrons

    Mateos, Alvaro; Dopazo, Joaquín; Jansen, Ronald et al.

    Genome Res · 2002 · English · PubMed Central

    …clustering of co-expressed genes and, more importantly, by supervised learning algorithms. Using prior knowledge, these algorithms can assign functional annotations based on more complex expression signatures found in existing functional classes. Previously, support vector machines (SVMs) and other…

  2. Journal Article Full text

    A Comparative Study of Supervised Learning as Applied to Acronym Expansion in Clinical Reports

    Joshi, Mahesh; Pakhomov, Serguei; Pedersen, Ted et al.

    AMIA Annu Symp Proc · 2006 · English · PubMed Central

    …acronym disambiguation in a corpus of clinical notes, using three machine learning algorithms: the naïve Bayes classifier, decision trees and Support Vector Machines (SVMs). Our training features include part-of-speech tags, unigrams and bigrams in the context of the ambiguous acronym. We find that…

  3. Preprint Full text

    ABL: Alignment-Based Learning

    van Zaanen, Menno

    arXiv · 2001 · English · arXiv

    This paper introduces a new type of grammar learning algorithm, inspired by string edit distance (Wagner and Fischer, 1974). The algorithm takes a corpus of flat sentences as input and returns a corpus of labelled, bracketed sentences. The method works on pairs of unstructured sentences that have…

  4. Preprint Full text

    Defensive Universal Learning with Experts

    Poland, Jan; Hutter, Marcus

    arXiv · 2005 · English · arXiv

    This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedback from the actions actually chosen (bandit setup), (b) it can be applied with countably infinite expert classes, and…

  5. Journal Article

    PreBIND and Textomy – mining the biomedical literature for protein-protein interactions using a support vector machine

    Baskin Berivan; Zhang Shudong; Tuekam Brigitte et al.

    BMC Bioinformatics, Vol. 4 No. 1 · 2003 · English · DOAJ Scopus

    …interaction network database (BIND) seeks to capture these data in a machine-readable format. We hypothesized that the formidable task-size of backfilling the database could be reduced by using Support Vector Machine technology to first locate interaction information in the literature. We present…

  6. Journal Article Full text

    Establishing glucose- and ABA-regulated transcription networks in Arabidopsis by microarray analysis and promoter classification using a Relevance Vector Machine

    Li, Yunhai; Lee, Kee Khoon; Walsh, Sean et al.

    Genome Res · 2006 · English · PubMed Central

    …developed a novel promoter classification method using a Relevance Vector Machine (RVM) and Bayesian statistical principles to identify discriminatory features in the promoter sequences of genes that can correctly classify transcriptional responses. The method was applied to microarray data…

  7. Journal Article

    A First Step towards Learning which uORFs Regulate Gene Expression

    Selpi; Bryant Christopher H.; Kemp Graham J.L. et al.

    Journal of Integrative Bioinformatics, Vol. 3 No. 2 · 2006 · English · DOAJ Scopus

    We have taken a first step towards learning which upstream Open Reading Frames (uORFs) regulate gene expression (i.e., which uORFs are functional) in the yeast Saccharomyces cerevisiae. We do this by integrating data from several resources and combining a bioinformatics tool, ORF Finder, with a…

  8. Preprint Full text

    Concept of E-machine: How does a "dynamical" brain learn to process "symbolic" information? Part I

    Eliashberg, Victor

    arXiv · 2004 · English · arXiv

    …of these characteristics are the brain's broad universality as a learning system and its mysterious ability to dynamically change (reconfigure) its behavior depending on a combinatorial number of different contexts. This paper discusses a class of hypothetically brain-like dynamically…

  9. Journal Article

    Computer-Assisted Language Learning and the Revolution in Computational Linguistics

    Pius ten Hacken

    Linguistik Online, Vol. 17 No. 5 · 2003 · Italian · DOAJ

    For a long period, Computational Linguistics (CL) and Computer-Assisted Language Learning (CALL) have developed almost entirely independently of each other. A brief historical survey shows that the main reason for this state of affairs was the long preoccupation in CL with the general problem of…

  10. Preprint Full text

    Learning for Adaptive Real-time Search

    Bulitko, Vadim

    arXiv · 2004 · English · arXiv

    Real-time heuristic search is a popular model of acting and learning in intelligent autonomous agents. Learning real-time search agents improve their performance over time by acquiring and refining a value function guiding the application of their actions. As computing the perfect value function is…

  11. Preprint Full text

    Universal Learning of Repeated Matrix Games

    Poland, Jan; Hutter, Marcus

    arXiv · 2005 · English · arXiv

    We study and compare the learning dynamics of two universal learning algorithms, one based on Bayesian learning and the other on prediction with expert advice. Both approaches have strong asymptotic performance guarantees. When confronted with the task of finding good long-term strategies in…

  12. Preprint Full text

    On Learning by Exchanging Advice

    Nunes, L.; Oliveira, E.

    arXiv · 2002 · English · arXiv

    One of the main questions concerning learning in Multi-Agent Systems is: (How) can agents benefit from mutual interaction during the learning process?. This paper describes the study of an interactive advice-exchange mechanism as a possible way to improve agents' learning performance. The…

  13. Journal Article

    Instance-based concept learning from multiclass DNA microarray data

    Dubitzky Werner; Bradbury Ian; Berrar Daniel

    BMC Bioinformatics, Vol. 7 No. 1 · 2006 · English · DOAJ Scopus

    Abstract Background Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as nearest neighbor (NN) approaches perform remarkably well in comparison to more complex models, and are…

  14. Journal Article Full text

    UNSUPERVISED LEARNING WITH INDEPENDENT COMPONENT ANALYSIS CAN IDENTIFY PATTERNS OF GLAUCOMATOUS VISUAL FIELD DEFECTS

    Goldbaum, Michael Henry

    Trans Am Ophthalmol Soc · 2005 · English · PubMed Central

    PURPOSE: We previously reported the use of clustering by unsupervised learning with machine learning classifiers to segment clusters of patterns in standard automated perimetry (SAP) for glaucoma. In this study, the process of unsupervised learning by independent component analysis decomposed SAP…

  15. Preprint Full text

    Lazy Transformation-Based Learning

    Samuel, Ken

    arXiv · 1998 · English · arXiv

    We introduce a significant improvement for a relatively new machine learning method called Transformation-Based Learning. By applying a Monte Carlo strategy to randomly sample from the space of rules, rather than exhaustively analyzing all possible rules, we drastically reduce the memory and time…

  16. Preprint Full text

    Learning from Scarce Experience

    Peshkin, Leonid; Shelton, Christian R.

    arXiv · 2002 · English · arXiv

    Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each change of the target policy, its value is estimated from the results of following that very policy. This requires a…

  17. Preprint Full text

    Improved Bounds on Quantum Learning Algorithms

    Atici, Alp; Servedio, Rocco A.

    arXiv · 2004 · English · arXiv

    …We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the…