Polynomial runtime bounds for fixed-rank unsupervised least-squares classification
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Documents
- Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification
Final published version, 335 KB, PDF document
Original language | English |
---|---|
Title of host publication | Asian Conference on Machine Learning |
Editors | Cheng Soon Ong, Tu Bao Ho |
Number of pages | 10 |
Volume | 29 |
Publication date | 2013 |
Pages | 62-71 |
Publication status | Published - 2013 |
Event | Asian Conference on Machine Learning (ACML) 2013 - The Australian National University, Canberra, Australia Duration: 13 Nov 2013 → 15 Nov 2013 Conference number: 5 |
Conference
Conference | Asian Conference on Machine Learning (ACML) 2013 |
---|---|
Nummer | 5 |
Location | The Australian National University |
Land | Australia |
By | Canberra |
Periode | 13/11/2013 → 15/11/2013 |
Series | JMLR: Workshop and Conference Proceedings |
---|---|
Volume | 29 |
Links
- http://www.jmlr.org/proceedings/papers/v29/Gieseke13.html
Final published version
Number of downloads are based on statistics from Google Scholar and www.ku.dk
No data available
ID: 168056130