{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:21Z","timestamp":1725491421424},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751847"},{"type":"electronic","value":"9783540751854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75185-4_8","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T11:47:58Z","timestamp":1188992878000},"page":"83-97","source":"Crossref","is-referenced-by-count":0,"title":["Database Implementation of a Model-Free Classifier"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Morfonios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Agrawal, R., Ghosh, S.P., Imielinski, T., Iyer, B.R., Swami, A.N.: An Interval Classifier for Database Mining Applications. In: VLDB 1992\u00a0 (1992)"},{"issue":"6","key":"8_CR2","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Database Mining: A Performance Perspective. IEEE Trans. Knowl. Data Eng.\u00a05(6), 914\u2013925 (1993)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR3","first-page":"37","volume":"6","author":"D.W. Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D.F., Albert, M.K.: Instance-Based Learning Algorithms. Machine Learning\u00a06, 37\u201366 (1991)","journal-title":"Machine Learning"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT\u201999","author":"K.S. Beyer","year":"1998","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is \u201cNearest Neighbor\u201d Meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, Springer, Heidelberg (1998)"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"C.J.C. Burges","year":"1998","unstructured":"Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data Min. Knowl. Discov.\u00a02(2), 121\u2013167 (1998)","journal-title":"Data Min. Knowl. Discov."},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"M.S. Chen","year":"1996","unstructured":"Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Trans. Knowl. Data Eng.\u00a08(6), 866\u2013883 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR7","unstructured":"Friedman, J.H., Kohavi, R., Yun, Y.: Lazy Decision Trees. In: AAAI\/IAAI, vol.\u00a01, pp. 717\u2013724 (1996)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Gehrke, J., Ganti, V., Ramakrishnan, R., Loh, W.Y.: BOAT-Optimistic Decision Tree Construction. In: SIGMOD 1999 (1999)","DOI":"10.1145\/304182.304197"},{"key":"8_CR9","unstructured":"Gehrke, J., Ramakrishnan, R., Ganti, V.: RainForest - A Framework for Fast Decision Tree Construction of Large Datasets. In: VLDB 1998 (1998)"},{"key":"8_CR10","unstructured":"John, G.H., Lent, B.: SIPping from the Data Firehose. In: KDD 1997 (1997)"},{"key":"8_CR11","unstructured":"Kamber, M., Winstone, L., Gon, W., Han, J.: Generalization and Decision Tree Induction: Efficient Classification in Data Mining. In: RIDE 1997\u00a0(1997)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In: SIGMOD 1997 (1997)","DOI":"10.1145\/253260.253347"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014141","volume-title":"Advances in Database Technology EDBT \u201996","author":"M. Mehta","year":"1996","unstructured":"Mehta, M., Agrawal, R., Rissanen, J.: SLIQ: A Fast Scalable Classifier for Data Mining. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol.\u00a01057, Springer, Heidelberg (1996)"},{"key":"8_CR14","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Methodologies for Knowledge Discovery and Data Mining","author":"G. Melli","year":"1999","unstructured":"Melli, G.: A Lazy Model-Based Algorithm for On-Line Classification. In: Zhong, N., Zhou, L. (eds.) Methodologies for Knowledge Discovery and Data Mining. LNCS (LNAI), vol.\u00a01574, Springer, Heidelberg (1999)"},{"key":"8_CR15","volume-title":"Machine Learning","author":"T. Mitchel","year":"1997","unstructured":"Mitchel, T.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"8_CR16","unstructured":"Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009876119989","volume":"3","author":"F.J. Provost","year":"1999","unstructured":"Provost, F.J., Kolluri, V.: A Survey of Methods for Scaling Up Inductive Algorithms. Data Min. Knowl. Discov.\u00a03(2), 131\u2013169 (1999)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"8_CR18","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of Decision Trees. Machine Learning\u00a01(1), 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"8_CR19","unstructured":"Shafer, J.C., Agrawal, R., Mehta, M.: SPRINT: A Scalable Parallel Classifier for Data Mining. In: VLDB 1996\u00a0(1996)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT 2005","author":"U. Shaft","year":"2004","unstructured":"Shaft, U., Ramakrishnan, R.: When Is Nearest Neighbors Indexable? In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, Springer, Heidelberg (2004)"},{"key":"8_CR21","volume-title":"Pattern Recognition","author":"S. Theodoridis","year":"2005","unstructured":"Theodoridis, S., Koutroumbas, K.: Pattern Recognition, 3rd edn. Academic Press, London (2005)","edition":"3"},{"key":"8_CR22","volume-title":"Data Mining: Practical machine learning tools and techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Yu, H., Yang, J., Han, J.: Classifying large data sets using SVMs with hierarchical clusters. In: KDD 2003 (2003)","DOI":"10.1145\/956750.956786"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: SIGMOD 1996\u00a0(1996)","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75185-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:38Z","timestamp":1619506478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75185-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751847","9783540751854"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75185-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}