David Haussler

Mathieu Blanchette

Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

2003

The UCSC Genome Browser Database.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2003

Scoring two-species local alignments to try to statistically separate neutrally evolving from selected DNA segments.

[BibT_eX]

[DOI]

Krishna M. Roskin

Mark Diekhans

Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Computational analysis of the human and other mammalian genomes.

[BibT_eX]

[DOI]

Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

Gene structure-based splice variant deconvolution using a microarry platform.

[BibT_eX]

[DOI]

Michael A. Siani-Rose

Manuel Ares

David Kulp

Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology, June 29, 2003

2002

Classifying G-protein coupled receptors with support vector machines.

[BibT_eX]

[DOI]

Rachel Karchin

Kevin Karplus

Bioinform., 2002

2001

Promoter Region-Based Classification of Genes.

[BibT_eX]

[DOI]

Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

2000

A Discriminative Framework for Detecting Remote Protein Homologies.

[BibT_eX]

[DOI]

Mark Diekhans

J. Comput. Biol., 2000

Support vector machine classification and validation of cancer tissue samples using microarray expression data.

[BibT_eX]

[DOI]

Bioinform., 2000

1999

A Probabilistic Approach to a Consensus Multiple Alignment.

[BibT_eX]

[DOI]

Betty Lazareva-Ulitsky

Proceedings of the 4th Pacific Symposium on Biocomputing, 1999

Using the Fisher Kernel Method to Detect Remote Protein Homologies.

[BibT_eX]

[DOI]

Mark Diekhans

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, 1999

Probabilistic kernel regression models.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on Artificial Intelligence and Statistics, 1999

1998

Sequential Prediction of Individual Sequences Under General Loss Functions.

[BibT_eX]

[DOI]

Jyrki Kivinen

IEEE Trans. Inf. Theory, 1998

A Graph-theoretic Generalization of the Sauer-Shelah Lemma.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Discret. Appl. Math., 1998

Exploiting Generative Models in Discriminative Classifiers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

1997

A general minimax result for relative entropy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Improved Splice Site Detection in Genie.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

How to use expert advice.

[BibT_eX]

[DOI]

J. ACM, 1997

Scale-sensitive dimensions, uniform convergence, and learnability.

[BibT_eX]

[DOI]

J. ACM, 1997

A Brief Look at Some Machine Learning Problems in Genomics.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Metric Entropy and Minimax Risk in Classification.

[BibT_eX]

[DOI]

Manfred Opper

Proceedings of the Structures in Logic and Computer Science, 1997

1996

Rigorous Learning Curve Bounds from Statistical Mechanics.

[BibT_eX]

[DOI]

Mach. Learn., 1996

Mining Scientific Data.

[BibT_eX]

[DOI]

Usama M. Fayyad

Paul E. Stolorz

Commun. ACM, 1996

Dirichlet mixtures: a method for improved detection of weak but significant protein sequence homology.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1996

KDD for Science Data Analysis: Issues and Examples.

[BibT_eX]

[DOI]

Usama M. Fayyad

Paul E. Stolorz

Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996

A Generalized Hidden Markov Model for the Recognition of Human Genes in DNA.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, 1996

1995

A Generalization of Sauer's Lemma.

[BibT_eX]

Philip M. Long

J. Comb. Theory, Ser. A, 1995

Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension.

[BibT_eX]

J. Comb. Theory, Ser. A, 1995

Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

The size of k-pseudotrees.

[BibT_eX]

[DOI]

Emanuel Knill

Discret. Math., 1995

Tight worst-case loss bounds for predicting with expert advice.

[BibT_eX]

[DOI]

Jyrki Kivinen

Proceedings of the Computational Learning Theory, Second European Conference, 1995

General Bounds on the Mutual Information Between a Parameter and n Conditionally Independent Observations.

[BibT_eX]

[DOI]

Manfred Opper

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Predicting \0,1\-Functions on Randomly Drawn Points

[BibT_eX]

[DOI]

Nick Littlestone

Inf. Comput., December, 1994

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension.

[BibT_eX]

[DOI]

Michael J. Kearns

Robert E. Schapire

Mach. Learn., 1994

Optimally Parsing a Sequence into Different Classes Based on Multiple Types of Evidence.

[BibT_eX]

[DOI]

Gary D. Stormo

Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, 1994

RNA Modeling Using Gibbs Sampling and Stochastic Context Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, 1994

Stochastic Context-Free Grammars for Modeling RN.

[BibT_eX]

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Using Dirichlet Mixture Priors to Derive Hidden Markov Models for Protein Families.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, 1993

1992

Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications

[BibT_eX]

[DOI]

Inf. Comput., September, 1992

1991

Equivalence of Models for Polynomial Learnability

[BibT_eX]

[DOI]

Inf. Comput., December, 1991

Estimating Average-Case Learning Curves Using Bayesian, Statistical Physics and VC Dimension Methods.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 4, 1991

Unsupervised Learning of Distributions of Binary Vectors Using 2-Layer Networks.

[BibT_eX]

[DOI]

Yoav Freund

Proceedings of the Advances in Neural Information Processing Systems 4, 1991

Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise.

[BibT_eX]

[DOI]

Manfred Opper

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

Boolean Feature Discovery in Empirical Learning.

[BibT_eX]

[DOI]

Giulia Pagallo

Mach. Learn., 1990

Decision Theoretic Generalizations of the PAC Learning Model.

[BibT_eX]

Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990

Probably Approximately Correct Learning.

[BibT_eX]

[DOI]

Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989

A General Lower Bound on the Number of Examples Needed for Learning

[BibT_eX]

[DOI]

Inf. Comput., September, 1989

Learning Decision Trees from Random Examples

[BibT_eX]

[DOI]

Inf. Comput., September, 1989

What Size Net Gives Valid Generalization?

[BibT_eX]

[DOI]

Eric B. Baum

Neural Comput., 1989

Learning Conjunctive Concepts in Structural Domains.

[BibT_eX]

[DOI]

Mach. Learn., 1989

Learnability and the Vapnik-Chervonenkis dimension.

[BibT_eX]

[DOI]

J. ACM, 1989

Average sizes of suffix trees and DAWGs.

[BibT_eX]

[DOI]

Anselm Blumer

Discret. Appl. Math., 1989

Two Algorithms That Learn DNF by Discovering Relevant Features.

[BibT_eX]

Giulia Pagallo

Proceedings of the Sixth International Workshop on Machine Learning (ML 1989), 1989

Generalizing the PAC Model: Sample Size Bounds From Metric Dimension-based Uniform Convergence Results

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Informed Parsimonious Inference of Prototypical Genetic Sequences.

[BibT_eX]

[DOI]

Aleksandar Milosavljevic

Jerzy Jurka

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

A new distance metric on strings computable in linear time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1988

Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework.

[BibT_eX]

[DOI]

Artif. Intell., 1988

Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract)

[BibT_eX]

[DOI]

Nick Littlestone

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Predicting {0, 1}-Functions on Randomly Drawn Points.

[BibT_eX]

[DOI]

Nick Littlestone

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

Applications of an Infinite Square-Free CO-CFL.

[BibT_eX]

[DOI]

Michael G. Main

Walter Bucher

Theor. Comput. Sci., 1987

New Theoretical Directions in Machine Learning.

[BibT_eX]

[DOI]

Mach. Learn., 1987

Complete inverted files for efficient text retrieval and analysis.

[BibT_eX]

[DOI]

J. ACM, 1987

Occam's Razor.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

epsilon-Nets and Simplex Range Queries.

[BibT_eX]

[DOI]

Emo Welzl

Discret. Comput. Geom., 1987

Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Noga Alon

Emo Welzl

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Sequence landscapes.

[BibT_eX]

[DOI]

Nucleic Acids Res., 1986

The complexity of cells in three-dimensional arrangements.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Discret. Math., 1986

Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Quantifying the Inductive Bias in Concept Learning (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985

On Total Regulators Generated by Derivation Relations.

[BibT_eX]

[DOI]

Walter Bucher

Theor. Comput. Sci., 1985

The Smallest Automaton Recognizing the Subwords of a Text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Another generalization of Higman's well quasi order result on Sigma*.

[BibT_eX]

[DOI]

Discret. Math., 1985

Applications of an Infinite Squarefree CO-CFL.

[BibT_eX]

[DOI]

Michael G. Main

Walter Bucher

Proceedings of the Automata, 1985

1984

On the Complexity of Iterated Shuffle.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1984

On Ambiguity in Dos Systems.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

RAIRO Theor. Informatics Appl., 1984

Building a Complete Inverted File for a Set of Text Files in Linear Time

[BibT_eX]

[DOI]

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

On Regularity of Context-Free Languages.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Theor. Comput. Sci., 1983

Insertion languages.

[BibT_eX]

[DOI]

Inf. Sci., 1983

Linear size finite automata for the set of all subwords of a word - an outline of results.

[BibT_eX]

Bull. EATCS, 1983

1982

Conditions Enforcing Regularity of Context-Free Languages.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Proceedings of the Automata, 1982

1980

Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories

[BibT_eX]

[DOI]