Sciweavers

661 search results - page 60 / 133
» Generalized clustering, supervised learning, and data assign...
Sort
View
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 4 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
159
Voted
NN
2002
Springer
224views Neural Networks» more  NN 2002»
15 years 3 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa
MLG
2007
Springer
15 years 9 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
125
Voted
ACL
2007
15 years 5 months ago
A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
Feiyu Xu, Hans Uszkoreit, Hong Li
160
Voted
ICML
2007
IEEE
16 years 4 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...