Sciweavers

1736 search results - page 46 / 348
» String Extension Learning
Sort
View
ICML
2005
IEEE
16 years 2 months ago
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
François Laviolette, Mario Marchand
ICML
2003
IEEE
16 years 2 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
IDA
2001
Springer
15 years 6 months ago
Self-Supervised Chinese Word Segmentation
Abstract. We propose a new unsupervised training method for acquiring probability models that accurately segment Chinese character sequences into words. By constructing a core lexi...
Fuchun Peng, Dale Schuurmans
ALT
2010
Springer
15 years 3 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark
PR
2006
76views more  PR 2006»
15 years 1 months ago
Extending the relevant component analysis algorithm for metric learning using both positive and negative equivalence constraints
Relevant component analysis (RCA) is a recently proposed metric learning method for semi-supervised learning applications. It is a simple and efficient method that has been applie...
Dit-Yan Yeung, Hong Chang