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

See more from authors: Shin H · Cho S

References and models cited by this paper

Aha D, Kibler D, Albert MK. (1991). Instance-based learning algorithms Mach Learn. 6

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.

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

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

Bentley JL. (1975). Multidimensional binary search trees used for associative searching Communications Of ACM. 18

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.

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.

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

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

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

Cho S, Shin HJ. (2003). Fast pattern selection algorithm for support vector classifiers Time Complexity analysis.

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

Choi SH, Rockett P. (2002). The training of neural classifiers with condensed datasets. IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. 32 [PubMed]

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

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

Dietterich TG. (1998). Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms. Neural computation. 10 [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

Ferri FJ, Albert JV, Vidal E. (1999). Considerations about sample-size sensitivity of a family of edited nearest-neighbor rules. IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. 29 [PubMed]

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

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

Gates GW. (1972). The reduced nearest neighbor rule IEEE Trans on Inform Theory. 18

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

Grother PJ, Candela GT, Blue JL. (1997). Fast implementations of nearest neighbor classifiers Pattern Recognition. 30

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

Hart PE. (1968). The condensed nearest neighbor rule IEEE Trans On Information Theory. 14

Helmbold D, Long P. (1994). Tracking drifting concepts by minimizing disagreements Mach Learn. 14

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

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 transactions on image processing : a publication of the IEEE Signal Processing Society. 9 [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.

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

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

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

Laskov P. (2002). Feasible direction decomposition algorithms for training support vector machines Mach Learn. 46

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

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

Lyhyaoui A et al. (1999). Sample selection via clustering to construct support vector-like classifiers. IEEE transactions on neural networks. 10 [PubMed]

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

Malthouse EC. (2001). Assessing the performance of direct marketing models J Interactive Market. 15

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

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

Moghaddam B, Yang MH. (2000). Gender classification with support vector machines Proc Intl Conf Pattern Recognition.

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

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

Platt J. (1999). Fast training of support vector machines using sequential minimal optimization Advances in kernel methods: Support vector learning.

Poggio T, Cauwenberghs G. (2001). Incremental and decremental support vector machine learning Advances in neural information processing systems. 13

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

Pontil M, Verri A. (1998). Properties of support vector machines. Neural computation. 10 [PubMed]

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

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

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

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

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

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

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

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.

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.

UC 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).

Vapnik V, Scholkopf B, Burges CJC. (1995). Extracting support data for a given task Proceedings of the First International Conference on Knowledge Discovery and Data Mining .

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

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

References and models that cite this paper
This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.