Sciweavers

144 search results - page 4 / 29
» The Cost of Learning Directed Cuts
Sort
View
JMLR
2006
108views more  JMLR 2006»
13 years 7 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 7 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 1 months ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
CVPR
2009
IEEE
15 years 2 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
CVPR
2008
IEEE
14 years 9 months ago
Who killed the directed model?
Prior distributions are useful for robust low-level vision, and undirected models (e.g. Markov Random Fields) have become a central tool for this purpose. Though sometimes these p...
Justin Domke, Alap Karapurkar, Yiannis Aloimonos