Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification
Cite as
Gieseke, F., Pahikkala, T., & Igel, C. (2013). Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification. In Ong, C., & Ho, T. (Eds.), Asian Conference on Machine Learning, ACML 2013, Canberra, ACT, Australia, November 13-15, 2013 (pp. 62–71). JMLR Workshop and Conference Proceedings: Vol. 29. JMLR.org.Details
Publication type
Research article in proceedings (conference)
Peer reviewed
Yes
Publication status
Published
Year
2013
Conference
Asian Conference on Machine Learning
Venue
Canberra, ACT, Australia
Book title
Asian Conference on Machine Learning, ACML 2013, Canberra, ACT, Australia, November 13-15, 2013
Editor
Ong CS, Ho TB
Start page
62
End page
71
Volume
29
Title of series
JMLR Workshop and Conference Proceedings
Publisher
JMLR.org
Language
English
Full text