Citation Relationships



Shin H, Cho S (2007) Neighborhood property-based pattern selection for support vector machines. Neural Comput 19:816-55 [PubMed]

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 Mach Learn 6:37-66

Almeida MB, Braga A, Braga JP (2000) SVM-KM: Speeding SVMs learning with a priori cluster selection and k-means Proc 6th Brazilian Symposium on Neural Networks :162-167

Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions J ACM 45:891-923

Bartlett P, Ben-david S, Kulkarni S (2000) Learning changing concepts by exploiting the structure of change Mach Learn 41:153-174

Bentley JL (1975) Multidimensional binary search trees used for associative searching Communications Of ACM 18:509-517

Berchtold S, Bohm C, Keim DA, Kriegel HP (1997) A cost model for nearest neighbor search in high-dimensional data space Proc Ann ACM Symposium on Principles Database Systems :78-86

Borodin A, Ostrovsky R, Rabani Y (1999) Lower bound for high dimensional nearest neighbor search and related problems Proc 31st ACM Symposium Theory of Computing :312-321

Brinker K (2003) Incorporating diversity in active learning with support vector machines Proc 20th Intl Conf Mach Learn :59-66

Byun H, Lee S (2002) Applications of support vector machines for pattern recognition: A survey Lecture Notes In Computer Science 2388:213-236

Campbell C, Cristianini N, Smola AJ (2000) Query learning with large margin classifiers Proc 17th Intl Conf Mach Learn :111-118

Cauwenberghs G, Poggio T (2001) Incremental and decremental support vector machine learning Advances in neural information processing systems, Leen TK:Dietterich TG:Tresp V, ed. pp.409

Choi SH, Rockett P (2002) The training of neural classifiers with condensed datasets. IEEE Trans Syst Man Cybern B Cybern 32:202-6 [Journal] [PubMed]

Cristianini N, Shawe-taylor J (2000) An introduction to support vector machines

Dietterich TG (1998) Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms. Neural Comput 10:1895-1923 [PubMed]

Direct Marketing Association () DMEF data set library Available online athttp:--www.the-dma.org-dmef-dmefdset.shtml

Dumais S (1998) Using SVMs for text categorization IEEE Intelligent Systems 13:21-23

Ferri FJ, Albert JV, Vidal E (1999) Considerations about sample-size sensitivity of a family of edited nearest-neighbor rules. IEEE Trans Syst Man Cybern B Cybern 29:667-72 [Journal] [PubMed]

Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time ACM Trans Math Software 3:209-226

Gates GW (1972) The reduced nearest neighbor rule IEEE Trans on Inform Theory 18:431-433

Grother PJ, Candela GT, Blue JL (1997) Fast implementations of nearest neighbor classifiers Pattern Recognition 30:459-465

Guttman A (1984) R-trees: A dynamic index structure for spatial searching Proc ACM SIGMOD Intl Conf Management of Data :47-57

Ha K, Cho S, Maclachlan D (2005) Response models based on bagging neural networks J Interactive Market 19:17-30

Hara K, Nakayama K (2000) A training method with small computation for classification Proc IEEE-INNIS-ENNS Intl Joint Conf 3:543-548

Hart PE (1968) The condensed nearest neighbor rule IEEE Trans On Information Theory 14:515-516

Hearst MA, Scholkopf B, Dumais S, Osuna E, Platt J (1997) Trends and controversies support vector machines IEEE Intelligent Systems 13:18-28

Heisele B, Poggio T, Pontil M (2000) Face detection in still gray images Tech Rep 1687 MIT AI Lab

Helmbold D, Long P (1994) Tracking drifting concepts by minimizing disagreements Mach Learn 14:27-46

Hush D, Kelly P, Scovel C, Steinwart I (2006) QP algorithms with guaranteed accuracy and run time for support vector machines J Mach Learn Res 7:733-769

Indyk P (1998) On approximate nearest neighbors in non-Euclidean spaces Proc IEEE Symposium on Foundations of Computer Science :148-155

Joachims T (2002) Learning to classify text using support vector machines: Methods, theory and algorithms

Johnson MH, Ladner RE, Riskin EA (2000) Fast nearest neighbor search of entropy-constrained vector quantization. IEEE Trans Image Process 9:1435-7 [Journal] [PubMed]

Kernel Machines Organization () Available online at http:--www.kernelmachines.org-

Kleingberg JM (1997) Two algorithms for nearest-neighbor search in high dimensions Proc 29th ACM Symposium on Theory of Computing :599-608

Klinkenberg R (2004) Learning drifting concepts: Example selection vs. example weighting Intelligent Data Analysis 8:281-300

Koggalage R, Halgamuge S (2004) Reducing the number of training samples for fast support vector machine classification Neural Inform Process Lett Rev 2:57-65

Laskov P (2002) Feasible direction decomposition algorithms for training support vector machines Mach Learn 46:315-349

Lee YJ, Mangasarian OL (2001) RSVM: Reduced support vector machines Proc SIAM Intl Conf Data Mining

Liu CL, Nakagawa M (2001) Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition Pattern Recognition 34:601-615

Lyhyaoui A, Martinez M, Mora I, Vaquez M, Sancho JL, Figueiras-Vidal AR (1999) Sample selection via clustering to construct support vector-like classifiers. IEEE Trans Neural Netw 10:1474-81 [Journal] [PubMed]

Malthouse EC (2001) Assessing the performance of direct marketing models J Interactive Market 15:49-62

Malthouse EC (2002) Performance-based variable selection for scoring models J Interactive Market 16:10-23

Masuyama N, Kudo M, Toyama J, Shimbo M (1999) Termination conditions for a fast k-nearest neighbor method Proc 3rd Intl Conf Knowledge Based Intelligent Information Engineering Systems :443-446

MNIST (1998) The MNIST database of handwritten digits Available online athttp:--yann.lecun.com-exdb-mnist-

Moghaddam B, Yang MH (2000) Gender classification with support vector machines Proc Intl Conf Pattern Recognition :306-311

Ong CS, Smola AJ, Williamson RC (2005) Learning the kernel with hyper kernels J Mach Learn Res 6:1045-1071

Osuna E, Freund R, Girosi F (1997) Training support vector machines: An application to face detection Proc IEEE Computer Soc Conf Computer Vision Pattern Recognition :130-136

Platt J (1999) Fast training of support vector machines using sequential minimal optimization Advances in kernel methods: Support vector learning, Scholkopf B:Burges CJC:Smola AJ, ed. pp.185

Pontil M, Verri A (1998) Properties of support vector machines. Neural Comput 10:955-74 [PubMed]

Pratt KB, Tschapek G (2003) Visualizing concept drift Proc 9th ACM SIGKDD Intl Conf Knowledge Discovery Data Mining :735-740

Schohn G, Cohn D (2000) Less is more: Active learning with support vector machines Proc 17th Intl Conf Mach Learn :839-846

Scholkopf B, Burges CJC, Vapnik V (1995) Extracting support data for a given task Proceedings of the First International Conference on Knowledge Discovery and Data Mining , Fayyad UM:Uthurusamy R, ed. pp.252

Scholkopf B, Smola A, Muller KR (1999) Kernel principal component analysis Advances in kernel methods-Support vector learning, Scholkopf B:Burges C:Smola A, ed.

Scholkopf B, Smola AJ (2001) Learning with kernels: Support vector machines, regularization, optimization, and beyond

Shin HJ, Cho S (2001) Pattern selection using the bias and variance of ensemble J Korean Institute Of Industrial Engin 28:112-127

Shin HJ, Cho S (2003) Fast pattern selection algorithm for support vector classifiers Time Complexity analysis :1008-1015

Shin HJ, Cho S (2003) How many neighbors to consider in pattern preselection for support vector classifiers? Proc Intl Joint Conf Neural Netw :565-570

Short RD, Fukunaga K (1981) The optimal distance measure for nearest neighbor classification IEEE Trans Inform Theory 27:622-627

Sohn S, Dagli CH (2001) Advantages of using fuzzy class memberships in self-organizing map and support vector machines Proc Intl Joint Conf Neural Networks

Sonnenburg S, Ratsch G, Schafer S, Scholkopf B (2006) Large scale multiple kernel learning J Mach Learn Res 7:1531-1565

Stanley KO (2003) Learning concept drift with a committee of decision trees Tech Rep UTAI-TR-03-302, Austin Department of Computer Sciences, University of Texas

Tsaparas P (1999) Nearest neighbor search in multidimensional spaces Tech Rep 319-02, Department of Computer Science University of Toronto

UCI (1995) UCI repository of machine learn in databases and domain theories http:--www.ics.uci.edu-mlearn-

Vapnik V (2000) The Nature of statistical learning theory (2nd ed)

Widmer G, Kubat M (1996) Learning in the presence of concept drift and hidden contexts Mach Learn 23:69-101

Zheng SF, Lu XF, Zheng NN, Xu WP (2003) Unsupervised clustering based reduced support vector machines Proc IEEE Intl Conf Acoustics, Speech, and Signal Processing 2:821-824

(65 refs)