{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:26Z","timestamp":1750306466975,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,17]],"date-time":"2015-10-17T00:00:00Z","timestamp":1445040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,17]]},"DOI":"10.1145\/2806416.2806540","type":"proceedings-article","created":{"date-parts":[[2015,10,27]],"date-time":"2015-10-27T13:03:43Z","timestamp":1445951023000},"page":"881-890","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["MF-Tree"],"prefix":"10.1145","author":[{"given":"Lei","family":"Liu","sequence":"first","affiliation":[{"name":"Hewlett Packard Laboratories, Palo Alto, CA, USA"}]},{"given":"Pang-Ning","family":"Tan","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}]},{"given":"Xi","family":"Liu","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"163","volume-title":"Advances in Neural Information Processing Systems (NIPS'2010)","author":"Bengio S.","year":"2010","unstructured":"S. Bengio , J. Weston , and D. Grangier . Label embedding trees for large multi-class tasks . In Advances in Neural Information Processing Systems (NIPS'2010) , pages 163 -- 171 , 2010 . S. Bengio, J. Weston, and D. Grangier. Label embedding trees for large multi-class tasks. In Advances in Neural Information Processing Systems (NIPS'2010), pages 163--171, 2010."},{"key":"e_1_3_2_1_2_1","volume-title":"Information Theory and Application Workshop (ITA'2007)","author":"Beygelzimer A.","year":"2007","unstructured":"A. Beygelzimer , J. Langford , and P. Ravikumar . Multiclass classification with filter trees . In Information Theory and Application Workshop (ITA'2007) , 2007 . A. Beygelzimer, J. Langford, and P. Ravikumar. Multiclass classification with filter trees. In Information Theory and Application Workshop (ITA'2007), 2007."},{"key":"e_1_3_2_1_3_1","first-page":"153","volume-title":"Advances in Neural Information (NIPS'2008)","author":"Blaschko M.","year":"2008","unstructured":"M. Blaschko and A. Gretton . Learning taxonomies by dependence maximization . In Advances in Neural Information (NIPS'2008) , pages 153 -- 160 , 2008 . M. Blaschko and A. Gretton. Learning taxonomies by dependence maximization. In Advances in Neural Information (NIPS'2008), pages 153--160, 2008."},{"key":"e_1_3_2_1_4_1","first-page":"304","volume-title":"Proc of the Machine Learning and Knowledge Discovery in Databases-European Conf. (ECML\/PKDD'2013)","author":"Blaschko M.","unstructured":"M. Blaschko , W. Zaremba , and A. Gretton . Taxonomic prediction with tree-structured covariances . In Proc of the Machine Learning and Knowledge Discovery in Databases-European Conf. (ECML\/PKDD'2013) , pages 304 -- 319 . M. Blaschko, W. Zaremba, and A. Gretton. Taxonomic prediction with tree-structured covariances. In Proc of the Machine Learning and Knowledge Discovery in Databases-European Conf. (ECML\/PKDD'2013), pages 304--319."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1023\/A:1009740529316"},{"key":"e_1_3_2_1_6_1","volume-title":"Symposium on the Birth of Numerical Analysis","author":"Chen D.","year":"2010","unstructured":"D. Chen and R. J. Plemmons . Nonnegativity constraints in numerical analysis. In A. Bultheel and R. Cools, editors , Symposium on the Birth of Numerical Analysis ,, 2010 . D. Chen and R. J. Plemmons. Nonnegativity constraints in numerical analysis. In A. Bultheel and R. Cools, editors, Symposium on the Birth of Numerical Analysis,, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1137\/1.9781611972832.6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2396761.2398622"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/INFCOM.2013.6567003"},{"key":"e_1_3_2_1_10_1","first-page":"567","volume-title":"Advances in Neural Information Processing Systems (NIPS'2011)","author":"Deng J.","year":"2011","unstructured":"J. Deng , S. Satheesh , A. C. Berg , and F. F. F. Li . Fast and balanced: Efficient label tree learning for large scale object recognition . In Advances in Neural Information Processing Systems (NIPS'2011) , pages 567 -- 575 . 2011 . J. Deng, S. Satheesh, A. C. Berg, and F. F. F. Li. Fast and balanced: Efficient label tree learning for large scale object recognition. In Advances in Neural Information Processing Systems (NIPS'2011), pages 567--575. 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/ICCV.2011.6126481"},{"key":"e_1_3_2_1_12_1","volume-title":"Using error-correcting codes for efficient text classification with a large number of categories. Masters thesis","author":"Ghani R.","year":"2001","unstructured":"R. Ghani . Using error-correcting codes for efficient text classification with a large number of categories. Masters thesis , Carnegie Mellon University , 2001 . R. Ghani. Using error-correcting codes for efficient text classification with a large number of categories. Masters thesis, Carnegie Mellon University, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/11564089_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2774225.2774837"},{"key":"e_1_3_2_1_15_1","first-page":"507","volume-title":"Advances in Neural Information Processing Systems (NIPS'1997)","author":"Hastie T.","year":"1997","unstructured":"T. Hastie and R. Tibshirani . Classification by pairwise coupling . In Advances in Neural Information Processing Systems (NIPS'1997) , pages 507 -- 513 , 1997 . T. Hastie and R. Tibshirani. Classification by pairwise coupling. In Advances in Neural Information Processing Systems (NIPS'1997), pages 507--513, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/0304-3975(95)80015-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.neunet.2013.09.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/CVPR.2014.223"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICDE.2015.7113310"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/2487575.2487606"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/11503415_11"},{"key":"e_1_3_2_1_22_1","first-page":"2148","volume-title":"Proc of Int'l Conf. on Pattern Recognition (ICPR'2012)","author":"Liu L.","year":"2012","unstructured":"L. Liu , P. M. Comar , S. Saha , P.-N. Tan , and A. Nucci . Recursive nmf: Efficient label tree learning for large multi-class problems . In Proc of Int'l Conf. on Pattern Recognition (ICPR'2012) , pages 2148 -- 2151 , 2012 . L. Liu, P. M. Comar, S. Saha, P.-N. Tan, and A. Nucci. Recursive nmf: Efficient label tree learning for large multi-class problems. In Proc of Int'l Conf. on Pattern Recognition (ICPR'2012), pages 2148--2151, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/ICDE.2015.7113392"},{"key":"e_1_3_2_1_24_1","volume-title":"The 9th ACM Conference on Recommender System (RecSys 2015)","author":"Liu L.","year":"2015","unstructured":"L. Liu , J. Liu , and S. Wu . Image discovery and insertion for custom publishing . In The 9th ACM Conference on Recommender System (RecSys 2015) , 2015 . L. Liu, J. Liu, and S. Wu. Image discovery and insertion for custom publishing. In The 9th ACM Conference on Recommender System (RecSys 2015), 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/ASONAM.2014.6921576"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/WI-IAT.2010.223"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1137\/120864799"},{"key":"e_1_3_2_1_28_1","first-page":"547","volume-title":"Advances in Neural Information Processing Systems (NIPS'2000)","author":"Platt J. C.","year":"2000","unstructured":"J. C. Platt , N. Cristianini , and J. Shawe-taylor . Large margin dags for multiclass classification . In Advances in Neural Information Processing Systems (NIPS'2000) , pages 547 -- 553 , 2000 . J. C. Platt, N. Cristianini, and J. Shawe-taylor. Large margin dags for multiclass classification. In Advances in Neural Information Processing Systems (NIPS'2000), pages 547--553, 2000."},{"key":"e_1_3_2_1_29_1","first-page":"101","article-title":"In defense of one-vs-all classification","volume":"5","author":"Ryan R.","year":"2004","unstructured":"R. Ryan and K. Aldebaro . In defense of one-vs-all classification . Journal of Machine Learning Research , 5 : 101 -- 141 , December 2004 . R. Ryan and K. Aldebaro. In defense of one-vs-all classification. Journal of Machine Learning Research, 5:101--141, December 2004.","journal-title":"Journal of Machine Learning Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/1273496.1273599"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1142\/S0218001488000157"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM'15","name":"CIKM'15: 24th ACM International Conference on Information and Knowledge Management","location":"Melbourne Australia"},"container-title":["Proceedings of the 24th ACM International on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2806416.2806540","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2806416.2806540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:42Z","timestamp":1750225422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2806416.2806540"}},"subtitle":["Matrix Factorization Tree for Large Multi-Class Learning"],"short-title":[],"issued":{"date-parts":[[2015,10,17]]},"references-count":31,"alternative-id":["10.1145\/2806416.2806540","10.1145\/2806416"],"URL":"https:\/\/doi.org\/10.1145\/2806416.2806540","relation":{},"subject":[],"published":{"date-parts":[[2015,10,17]]},"assertion":[{"value":"2015-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}