Sciweavers

2512 search results - page 3 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ML
2010
ACM
181views Machine Learning» more  ML 2010»
15 years 6 days ago
Decomposing the tensor kernel support vector machine for neuroscience data with structured labels
Abstract The tensor kernel has been used across the machine learning literature for a number of purposes and applications, due to its ability to incorporate samples from multiple s...
David R. Hardoon, John Shawe-Taylor
89
Voted
ICML
2005
IEEE
16 years 2 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
DAGM
2009
Springer
15 years 8 months ago
Active Structured Learning for High-Speed Object Detection
High-speed smooth and accurate visual tracking of objects in arbitrary, unstructured environments is essential for robotics and human motion analysis. However, building a system th...
Christoph H. Lampert, Jan Peters
ICPR
2008
IEEE
15 years 8 months ago
Semi-supervised marginal discriminant analysis based on QR decomposition
In this paper, a novel subspace learning method, semi-supervised marginal discriminant analysis (SMDA), is proposed for classification. SMDA aims at maintaining the intrinsic neig...
Rui Xiao, Pengfei Shi
91
Voted
EMNLP
2007
15 years 3 months ago
Structural Correspondence Learning for Dependency Parsing
Following (Blitzer et al., 2006), we present an application of structural correspondence learning to non-projective dependency parsing (McDonald et al., 2005). To induce the corre...
Nobuyuki Shimizu, Hiroshi Nakagawa