Sciweavers

750 search results - page 135 / 150
» Learning SVMs from Sloppily Labeled Data
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Multi-view clustering via canonical correlation analysis
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
Kamalika Chaudhuri, Sham M. Kakade, Karen Livescu,...
WWW
2010
ACM
14 years 5 months ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...
CVPR
2008
IEEE
15 years 23 days ago
Parameterized Kernel Principal Component Analysis: Theory and applications to supervised and unsupervised image alignment
Parameterized Appearance Models (PAMs) (e.g. eigentracking, active appearance models, morphable models) use Principal Component Analysis (PCA) to model the shape and appearance of...
Fernando De la Torre, Minh Hoai Nguyen
ICML
2006
IEEE
14 years 11 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 11 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney