Sciweavers

1427 search results - page 66 / 286
» Kernels for Semi-Structured Data
Sort
View
NIPS
2004
13 years 9 months ago
The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
Robert Jenssen, Deniz Erdogmus, José Carlos...
ICPR
2008
IEEE
14 years 2 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
KDD
2005
ACM
193views Data Mining» more  KDD 2005»
14 years 8 months ago
An approach to spacecraft anomaly detection problem using kernel feature space
Development of advanced anomaly detection and failure diagnosis technologies for spacecraft is a quite significant issue in the space industry, because the space environment is ha...
Ryohei Fujimaki, Takehisa Yairi, Kazuo Machida
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 6 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara