About
Kernel Methods and Structured Domains
Substantial recent work in machine learning has focused on the problem of dealing with inputs and outputs on more complex domains than are provided for in the classical regression/classification setting. Structured representations can give a more informative view of input domains, which is crucial for the development of successful learning algorithms: application areas include determining protein structure and protein-protein interaction; part-of-speech tagging; the organization of web documents into hierarchies; and image segmentation. Likewise, a major research direction is in the use of structured output representations, which have been applied in a broad range of areas including several of the foregoing examples (for instance, the output required of the learning algorithm may be a probabilistic model, a graph, or a ranking).
Large Scale Kernel Machines
Datasets with millions of observations can be gathered by crawling the web, mining business databases, or connecting a cheap video tuner to a laptop. Vastly more ambitious learning systems are theoretically possible. The literature shows no shortage of ideas for sophisticated statistical models. The computational cost of learning algorithms is now the bottleneck. During the last decade, dataset size has outgrown processor speed. Meanwhile, machine learning algorithms became more principled, and also more computationally expensive.
Related categories
Uploaded videos:
Lectures
Working Set Selection Using the Second Order Information for SVMs
Feb 25, 2007
·
5805 Views
Large-scale parallel implementations of SVMs
Feb 25, 2007
·
4803 Views
Online Learning with a Memory Harness
Feb 25, 2007
·
3247 Views
Implementing SVM in an RDBMS: Improved Scalability and Usability
Feb 25, 2007
·
4656 Views
Large Scale Genomic Sequence Support Vector Machines
Feb 25, 2007
·
4333 Views
Improved Fast Gauss Transform
Feb 25, 2007
·
5367 Views
An SMO-like algorithm for Kernel Conditional Random Fields
Feb 25, 2007
·
6462 Views
Object Correspondence as a Machine Learning Problem
Feb 25, 2007
·
5799 Views
The Pyramid Match Kernel: Efficient Learning with Sets of Features
Feb 25, 2007
·
13193 Views
Kernels in Bioinformatics
Feb 25, 2007
·
7176 Views
Spectral Clustering and Transductive Inference for Graph Data
Feb 25, 2007
·
5083 Views
Learning from Network Traffic: Computing Kernels over Connection Content
Feb 25, 2007
·
4589 Views
Exploiting Hyperlinks to Learn a Retrieval Model
Feb 25, 2007
·
3193 Views
Ranking as Learning Structured Outputs
Feb 25, 2007
·
5792 Views
Extensions of Gaussian Processes for Ranking: Semi-Supervised and Active Learnin...
Feb 25, 2007
·
4761 Views
Learning Rankings for Information Retrieval
Feb 25, 2007
·
8316 Views