ACM Home Page
Please provide us with feedback. Feedback
Uncertainty sampling and transductive experimental design for active dual supervision
Full text PdfPdf (662 KB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 953-960  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Vikas Sindhwani  IBM T.J. Watson Research Center, Yorktown Heights, NY
Prem Melville  IBM T.J. Watson Research Center, Yorktown Heights, NY
Richard D. Lawrence  IBM T.J. Watson Research Center, Yorktown Heights, NY
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553496
What is a DOI?

ABSTRACT

Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text classification where it is frequently possible to provide domain knowledge in the form of words that associate strongly with a class. In this paper, we consider the novel problem of active dual supervision, or, how to optimally query an example and feature labeling oracle to simultaneously collect two different forms of supervision, with the objective of building the best classifier in the most cost effective manner. We apply classical uncertainty and experimental design based active learning schemes to graph/kernel-based dual supervision models. Empirical studies confirm the potential of these schemes to significantly reduce the cost of acquiring labeled data for training high-quality models.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Belkin, M., Matveeva, I., & Niyogi, P. (2004). Regularization and semi-supervised learning on large graphs. Conference on Learning Theory (COLT) (pp. 486--500).
2
 
3
 
4
 
5
Ho, & Dooren, P. (2005). On the pseudo-inverse of the laplacian of a bipartite graph. Appl. Math. Letters, 8, 917--922.
6
 
7
Melville, P., & Sindhwani, V. (2009). Active dual supervision: Reducing the cost of annotating examples and features. NAACL HLT Workshop on Active Learning for NLP.
8
 
9
 
10
Sindhwani, V., Hu, J., & Mojsilovic, A. (2008). Regularized co-clustering with dual supervision. Neural Information Processing Systems (NIPS) (pp. 976--983).
 
11
Smola, A., & Kondor, R. (2004). Kernels and regularization on graphs. Conf. on Learning Theory (COLT) (pp. 144--158).
 
12
13


Collaborative Colleagues:
Vikas Sindhwani: colleagues
Prem Melville: colleagues
Richard D. Lawrence: colleagues