{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:10:01Z","timestamp":1749575401382,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_8","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"86-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Data Squashing for Boosting Based on a Distribution-Sensitive Distance"],"prefix":"10.1007","author":[{"given":"Yuta","family":"Choki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Einoshin","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"8_CR1","volume-title":"UCI KDD Archive","author":"S. Bay","year":"1999","unstructured":"Bay, S.: UCI KDD Archive, http:\/\/kdd.ics.uci.edu\/, Dept. of Information and Computer Sci., Univ. of California Irvine. (1999)."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-Tree, ACM Computing Surveys, Vol. 11,No. 2, pp. 121\u2013137 (1979).","journal-title":"ACM Computing Surveys"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"DuMouchel, W. et al.: Squashing Flat Files Flatter, Proc. Fifth ACM Int\u2019l Conf. on Knowledge Discovery and Data Mining (KDD), pp. 6\u201315 (1999).","DOI":"10.1145\/312129.312184"},{"key":"8_CR4","unstructured":"Freund, Y. and Schapire, R. E.: Experiments with a New Boosting Algorithm, Proc. Thirteenth Int\u2019l Conf. on Machine Learning (ICML), pp. 148\u2013156 (1996)."},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L. and Rousseeuw, P. J.: Finding Groups in Data, Wiley, New York (1990)."},{"key":"8_CR6","volume-title":"Feature Selection","author":"H. Liu","year":"1998","unstructured":"Liu, H. and Motoda, H.: Feature Selection, Kluwer, Norwell, Mass. (1998)."},{"volume-title":"Instance Selection and Construction for Data Mining","year":"2001","key":"8_CR7","unstructured":"Liu, H. and Motoda, H. (eds.): Instance Selection and Construction for Data Mining, Kluwer, Norwell, Mass. (2001)."},{"key":"8_CR8","first-page":"23","volume":"2","author":"T. Nakayasu","year":"2001","unstructured":"Nakayasu, T., Suematsu, N., and Hayashi, A.: Learning Classification Rules from Large-Scale Databases, Proc. 62th Nat\u2019l Conf. of Information Processing Society of Japan, Vol. 2, pp. 23\u201324 (2001, in Japanese).","journal-title":"Proc. 62th Nat\u2019l Conf. of Information Processing Society of Japan"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Pavlov, D., Chudova, D., and Smyth, P.: Towards Scalable Support Vector Machines Using Squashing, Proc. Sixth ACM Int\u2019l Conf. on Knowledge Discovery and Data Mining (KDD), pp. 295\u2013299 (2000).","DOI":"10.1145\/347090.347155"},{"key":"8_CR10","volume-title":"Numerical Recipes in C","author":"W. H. Press","year":"1992","unstructured":"Press, W. H. et al.: Numerical Recipes in C-Second Edition, Cambridge Univ. Press, Cambridge, U. K. (1992).","edition":"Second Edition"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., and Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases, Proc. 1996 ACM SIGMOD Int\u2019l Conf. on Management of Data (SIGMOD), pp. 103\u2013114 (1996).","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:49Z","timestamp":1749573349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}