ACM Home Page
Please provide us with feedback. Feedback
Learning from incomplete data with infinite imputations
Full text PdfPdf (355 KB)
Source ICML; Vol. 307 archive
Proceedings of the 25th international conference on Machine learning table of contents
Helsinki, Finland
Pages 232-239  
Year of Publication: 2008
ISBN:978-1-60558-205-4
Authors
Uwe Dick  Max Planck Institute for Computer Science, Saarbrücken, Germany
Peter Haider  Max Planck Institute for Computer Science, Saarbrücken, Germany
Tobias Scheffer  Max Planck Institute for Computer Science, Saarbrücken, Germany
Sponsors
: Yahoo!
: Xerox
IBM : IBM
: NSF
Microsoft Research : Microsoft Research
: Machine Learning Journal/Springer
: Pascal
: University of Helsinki
: Federation of Finnish Learned Societies
: Intel Corporation
: Google
: Helsinki Institute for Information Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   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/1390156.1390186
What is a DOI?

ABSTRACT

We address the problem of learning decision functions from training data in which some attribute values are unobserved. This problem can arise, for instance, when training data is aggregated from multiple sources, and some sources record only a subset of attributes. We derive a generic joint optimization problem in which the distribution governing the missing values is a free parameter. We show that the optimal solution concentrates the density mass on finitely many imputations, and provide a corresponding algorithm for learning from incomplete data. We report on empirical results on benchmark data, and on the email spam application that motivates our work.


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
Argyriou, A., Micchelli, C., & Pontil, M. (2005). Learning convex combinations of continuously parameterized basic kernels. Proceedings of the 18th Conference on Learning Theory.
 
2
Chechik, G., Heitz, G., Elidan, G., Abbeel, P., & Koller, D. (2007). Max-margin classification of incomplete data. Advances in Neural Information Processing Systems 19.
3
 
4
 
5
 
6
Smola, A., Vishwanathan, S., & Hofmann, T. (2005). Kernel methods for missing variables. Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics.
 
7
Williams, D., & Carin, L. (2005). Analytical kernel matrix completion with incomplete multi-view data. Proceedings of the ICML 2005 Workshop on Learning With Multiple Views.
8

Collaborative Colleagues:
Uwe Dick: colleagues
Peter Haider: colleagues
Tobias Scheffer: colleagues