#### Filter Results:

- Full text PDF available (104)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (33)
- Last 10 years (68)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

#### Method

Learn More

- John Shawe-Taylor, Nello Cristianini
- ICTAI
- 2003

In this talk… Review the main ideas of kernel based learning algorithms (already seen some examples yesterday !) Give examples of the diverse types of data and applications they can handle:

- Gert R. G. Lanckriet, Nello Cristianini, Peter L. Bartlett, Laurent El Ghaoui, Michael I. Jordan
- Journal of Machine Learning Research
- 2002

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and… (More)

- John C. Platt, Nello Cristianini, John Shawe-Taylor
- NIPS
- 1999

We present a new learning architecture: the Decision Directed Acyclic Graph (DDAG), which is used to combine many two-class classifiers into a multiclass classifier. For an AE-class problem, the DDAG contains AE´AE ½µ¾ classifiers, one for each pair of classes. We present a VC analysis of the case when the node classifiers are hyperplanes; the resulting… (More)

We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguously. The subsequences are weighted by an exponentially… (More)

We introduce the notion of kernel-alignment, a measure of similarity between two kernel functions or between a kernel and a target function. This quantity captures the degree of agreement between a kernel and a given learning task, and has very natural interpretations in machine learning, leading also to simple algorithms for model selection and learning.… (More)

- M P Brown, W N Grundy, +5 authors D Haussler
- Proceedings of the National Academy of Sciences…
- 2000

We introduce a method of functionally classifying genes by using gene expression data from DNA microarray hybridization experiments. The method is based on the theory of support vector machines (SVMs). SVMs are considered a supervised computer learning method because they exploit prior knowledge of gene function to identify unknown genes of similar function… (More)

- Terrence S. Furey, Nello Cristianini, Nigel Duffy, David W. Bednarski, Michèl Schummer, David Haussler
- Bioinformatics
- 2000

MOTIVATION
DNA microarray experiments generating thousands of gene expression measurements, are being used to gather information from tissue and cell samples regarding gene expression differences that will be useful in diagnosing disease. We have developed a new method to analyse this kind of data using support vector machines (SVMs). This analysis consists… (More)

- Gert R. G. Lanckriet, Tijl De Bie, Nello Cristianini, Michael I. Jordan, William Stafford Noble
- Bioinformatics
- 2004

MOTIVATION
During the past decade, the new focus on genomics has highlighted a particular challenge: to integrate the different views of the genome that are provided by various types of experimental data.
RESULTS
This paper describes a computational framework for integrating and drawing inferences from a collection of genome-wide measurements. Each… (More)

- Gert R. G. Lanckriet, Minghua Deng, Nello Cristianini, Michael I. Jordan, William Stafford Noble
- Pacific Symposium on Biocomputing
- 2004

Kernel methods provide a principled framework in which to represent many types of data, including vectors, strings, trees and graphs. As such, these methods are useful for drawing inferences about biological phenomena. We describe a method for combining multiple kernel representations in an optimal fashion, by formulating the problem as a convex… (More)

The active selection of instances can sig-niicantly improve the generalisation performance of a learning machine. Large margin classiiers such as Support Vector Machines classify data using the most informative instances (the support vectors). This makes them natural candidates for instance selection strategies. In this paper we propose an algorithm for the… (More)