Sciweavers

1945 search results - page 177 / 389
» Speeding up Serpent
Sort
View
NIPS
2007
15 years 7 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 7 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
AAAI
2006
15 years 7 months ago
Cross-Domain Knowledge Transfer Using Structured Representations
Previous work in knowledge transfer in machine learning has been restricted to tasks in a single domain. However, evidence from psychology and neuroscience suggests that humans ar...
Samarth Swarup, Sylvian R. Ray
ACL
2006
15 years 7 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura
CLA
2004
15 years 7 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel