Sciweavers

98 search results - page 5 / 20
» Adaptively Learning the Crowd Kernel
Sort
View
AAAI
2012
11 years 10 months ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo
ECML
2004
Springer
14 years 4 days ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok
EDBT
2009
ACM
195views Database» more  EDBT 2009»
14 years 3 months ago
Anonymizing moving objects: how to hide a MOB in a crowd?
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshm...
ECML
2006
Springer
14 years 2 days ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 8 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