## References and models cited by this paper | ## References and models that cite this paper | |

Aha D, Kibler D, Albert MK (1991) Instance-based learning algorithms Almeida MB, Braga A, Braga JP (2000) SVM-KM: Speeding SVMs learning with a priori cluster selection and k-means Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions Bartlett P, Ben-david S, Kulkarni S (2000) Learning changing concepts by exploiting the structure of change Bentley JL (1975) Multidimensional binary search trees used for associative searching Berchtold S, Bohm C, Keim DA, Kriegel HP (1997) A cost model for nearest neighbor search in high-dimensional data space Borodin A, Ostrovsky R, Rabani Y (1999) Lower bound for high dimensional nearest neighbor search and related problems Brinker K (2003) Incorporating diversity in active learning with support vector machines Byun H, Lee S (2002) Applications of support vector machines for pattern recognition: A survey Campbell C, Cristianini N, Smola AJ (2000) Query learning with large margin classifiers Cauwenberghs G, Poggio T (2001) Incremental and decremental support vector machine learning Choi SH, Rockett P (2002) The training of neural classifiers with condensed datasets. Cristianini N, Shawe-taylor J (2000) Dietterich TG (1998) Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms. Direct Marketing Association () DMEF data set library Dumais S (1998) Using SVMs for text categorization Ferri FJ, Albert JV, Vidal E (1999) Considerations about sample-size sensitivity of a family of edited nearest-neighbor rules. Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time Gates GW (1972) The reduced nearest neighbor rule Grother PJ, Candela GT, Blue JL (1997) Fast implementations of nearest neighbor classifiers Guttman A (1984) R-trees: A dynamic index structure for spatial searching Ha K, Cho S, Maclachlan D (2005) Response models based on bagging neural networks Hara K, Nakayama K (2000) A training method with small computation for classification Hart PE (1968) The condensed nearest neighbor rule Hearst MA, Scholkopf B, Dumais S, Osuna E, Platt J (1997) Trends and controversies support vector machines Heisele B, Poggio T, Pontil M (2000) Face detection in still gray images Helmbold D, Long P (1994) Tracking drifting concepts by minimizing disagreements Hush D, Kelly P, Scovel C, Steinwart I (2006) QP algorithms with guaranteed accuracy and run time for support vector machines Indyk P (1998) On approximate nearest neighbors in non-Euclidean spaces Joachims T (2002) Johnson MH, Ladner RE, Riskin EA (2000) Fast nearest neighbor search of entropy-constrained vector quantization. Kernel Machines Organization () Kleingberg JM (1997) Two algorithms for nearest-neighbor search in high dimensions Klinkenberg R (2004) Learning drifting concepts: Example selection vs. example weighting Koggalage R, Halgamuge S (2004) Reducing the number of training samples for fast support vector machine classification Laskov P (2002) Feasible direction decomposition algorithms for training support vector machines Lee YJ, Mangasarian OL (2001) RSVM: Reduced support vector machines Liu CL, Nakagawa M (2001) Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition Lyhyaoui A, Martinez M, Mora I, Vaquez M, Sancho JL, Figueiras-Vidal AR (1999) Sample selection via clustering to construct support vector-like classifiers. Malthouse EC (2001) Assessing the performance of direct marketing models Malthouse EC (2002) Performance-based variable selection for scoring models Masuyama N, Kudo M, Toyama J, Shimbo M (1999) Termination conditions for a fast k-nearest neighbor method MNIST (1998) The MNIST database of handwritten digits Moghaddam B, Yang MH (2000) Gender classification with support vector machines Ong CS, Smola AJ, Williamson RC (2005) Learning the kernel with hyper kernels Osuna E, Freund R, Girosi F (1997) Training support vector machines: An application to face detection Platt J (1999) Fast training of support vector machines using sequential minimal optimization Pontil M, Verri A (1998) Properties of support vector machines. Pratt KB, Tschapek G (2003) Visualizing concept drift Schohn G, Cohn D (2000) Less is more: Active learning with support vector machines Scholkopf B, Burges CJC, Vapnik V (1995) Extracting support data for a given task Scholkopf B, Smola A, Muller KR (1999) Kernel principal component analysis Scholkopf B, Smola AJ (2001) Shin HJ, Cho S (2001) Pattern selection using the bias and variance of ensemble Shin HJ, Cho S (2003) Fast pattern selection algorithm for support vector classifiers Shin HJ, Cho S (2003) How many neighbors to consider in pattern preselection for support vector classifiers? Short RD, Fukunaga K (1981) The optimal distance measure for nearest neighbor classification Sohn S, Dagli CH (2001) Advantages of using fuzzy class memberships in self-organizing map and support vector machines Sonnenburg S, Ratsch G, Schafer S, Scholkopf B (2006) Large scale multiple kernel learning Stanley KO (2003) Learning concept drift with a committee of decision trees Tsaparas P (1999) Nearest neighbor search in multidimensional spaces UCI (1995) UCI repository of machine learn in databases and domain theories Vapnik V (2000) Widmer G, Kubat M (1996) Learning in the presence of concept drift and hidden contexts Zheng SF, Lu XF, Zheng NN, Xu WP (2003) Unsupervised clustering based reduced support vector machines |