Sciweavers

780 search results - page 42 / 156
» Learning Low-Density Separators
Sort
View
UAI
2004
13 years 9 months ago
Factored Latent Analysis for far-field Tracking Data
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
Chris Stauffer
ICML
2008
IEEE
14 years 8 months ago
Accurate max-margin training for structured output spaces
Tsochantaridis et al. (2005) proposed two formulations for maximum margin training of structured spaces: margin scaling and slack scaling. While margin scaling has been extensivel...
Sunita Sarawagi, Rahul Gupta
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 4 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
MLDM
2005
Springer
14 years 1 months ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
13 years 6 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims