{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:06Z","timestamp":1725568626484},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_19","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:40:58Z","timestamp":1288690858000},"page":"266-280","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting Code Redundancies in ECOC"],"prefix":"10.1007","author":[{"given":"Sang-Hyeun","family":"Park","sequence":"first","affiliation":[]},{"given":"Lorenz","family":"Weizs\u00e4cker","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"113","volume":"1","author":"E.L. Allwein","year":"2000","unstructured":"Allwein, E.L., Schapire, R.E., Singer, Y.: Reducing multiclass to binary: A unifying approach for margin classifiers. J. Mach. Learn. Res (JMLR)\u00a01, 113\u2013141 (2000)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"19_CR2","unstructured":"Bifet, A., Holmes, G., Kirkby, R., Pfahringer, B.: MOA: Massive Online Analysis. J. Mach. Learn. Res., JMLR (2010), http:\/\/sourceforge.net\/projects\/moa-datastream\/"},{"key":"19_CR3","first-page":"621","volume":"3","author":"H. Blockeel","year":"2003","unstructured":"Blockeel, H., Struyf, J.: Efficient algorithms for decision tree cross-validation. J. Mach. Learn. Res. (JMLR)\u00a03, 621\u2013650 (2003)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"19_CR4","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines (2001), Software, available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1613\/jair.105","volume":"2","author":"T.G. Dietterich","year":"1995","unstructured":"Dietterich, T.G., Bakiri, G.: Solving multiclass learning problems via error-correcting output codes. J. Artif. Intell. Res. (JAIR)\u00a02, 263\u2013286 (1995)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/347090.347107","volume-title":"KDD","author":"P. Domingos","year":"2000","unstructured":"Domingos, P., Hulten, G.: Mining high-speed data streams. In: KDD, Boston, MA, USA, pp. 71\u201380. ACM, New York (2000)"},{"key":"19_CR7","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010)"},{"key":"19_CR8","unstructured":"Friedman, J.H.: Another approach to polychotomous classification. Technical report, Department of Statistics, Stanford University, Stanford, CA (1996)"},{"key":"19_CR9","first-page":"721","volume":"2","author":"J. F\u00fcrnkranz","year":"2002","unstructured":"F\u00fcrnkranz, J.: Round robin classification. J. Mach. Learn. Res. (JMLR)\u00a02, 721\u2013747 (2002)","journal-title":"J. Mach. Learn. Res. (JMLR)"},{"key":"19_CR10","first-page":"169","volume-title":"Advances in Kernel Methods - Support Vector Learning","author":"T. Joachims","year":"1999","unstructured":"Joachims, T.: Making large-scale SVM learning practical. In: Sch\u00f6lkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning, pp. 169\u2013184. MIT Press, Cambridge (1999)"},{"key":"19_CR11","first-page":"189","volume-title":"ECML\/PKDD-09, Part II","author":"S.-H. Park","year":"2009","unstructured":"Park, S.-H., F\u00fcrnkranz, J.: Efficient decoding of ternary error-correcting output codes for multiclass classification. In: Buntine, W.L., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML\/PKDD-09, Part II, Bled, Slovenia, pp. 189\u2013204. Springer, Heidelberg (2009)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Park, S.-H., Weizs\u00e4cker, L., F\u00fcrnkranz, J.: Exploiting code-redundancies in ECOC for reducing its training complexity using incremental and SVM learners. Technical Report TUD-KE-2010-06, TU Darmstadt (July 2010)","DOI":"10.1007\/978-3-642-16184-1_19"},{"key":"19_CR13","first-page":"622","volume-title":"FLAIRS Conference","author":"E. Pimenta","year":"2007","unstructured":"Pimenta, E., Gama, J., Carvalho, A.: Pursuing the best ecoc dimension for multiclass problems. In: Wilson, D., Sutcliffe, G. (eds.) FLAIRS Conference, pp. 622\u2013627. AAAI Press, Menlo Park (2007)"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R. Wong","year":"1984","unstructured":"Wong, R.: A dual ascent approach for steiner tree problems on a directed graph. Mathematical Programming\u00a028(3), 271\u2013287 (1984)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:04:50Z","timestamp":1559768690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}