메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 681-688

Concept boundary detection for speeding up SVMs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; PROGRAM PROCESSORS; TESTING; VECTORS;

EID: 33749266370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (19)
  • 2
    • 0030211964 scopus 로고    scopus 로고
    • Bagging predictors
    • Breiman, L. (1996). Bagging predictors. Machine Learning, 24, 123-140.
    • (1996) Machine Learning , vol.24 , pp. 123-140
    • Breiman, L.1
  • 5
    • 0041494125 scopus 로고    scopus 로고
    • Efficient SVM training using low-rank kernel representation
    • Fine, S., & Scheinberg, K. (2001). Efficient SVM Training Using Low-Rank Kernel Representation. Journal of Machine Learning Research, 243-264.
    • (2001) Journal of Machine Learning Research , pp. 243-264
    • Fine, S.1    Scheinberg, K.2
  • 6
    • 15044355327 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • Gionis, A., Indyk, P., & Motwani, R. (1999). Similarity search in high dimensions via hashing. The VLDB Journal (pp. 518-529).
    • (1999) The VLDB Journal , pp. 518-529
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 10
    • 80053225881 scopus 로고    scopus 로고
    • Fast sparse gaussian process methods: The informative vector machine
    • S. Becker, S. Thrun and K. Obermayer (eds). MIT Press
    • Lawrence, N. D., Seeger, M., & Herbrich, R. (2003). Fast sparse gaussian process methods: the informative vector machine. S. Becker, S. Thrun and K. Obermayer (eds) Advances in Neural Information Processing Systems. MIT Press.
    • (2003) Advances in Neural Information Processing Systems
    • Lawrence, N.D.1    Seeger, M.2    Herbrich, R.3
  • 11
    • 0032203257 scopus 로고    scopus 로고
    • Gradient-based learning applied to document recognition
    • LeCun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998). Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86, 2278-2324.
    • (1998) Proceedings of the IEEE , vol.86 , pp. 2278-2324
    • LeCun, Y.1    Bottou, L.2    Bengio, Y.3    Haffner, P.4
  • 12
    • 84898977963 scopus 로고    scopus 로고
    • An investigation of practical approximate nearest neighbor algorithms
    • L. K. Saul, Y. Weiss and L. Bottou (Eds.). Cambridge, MA: MIT Press
    • Liu, T., Moore, A. W., Gray, A., & Yang, K. (2005). An investigation of practical approximate nearest neighbor algorithms. In L. K. Saul, Y. Weiss and L. Bottou (Eds.), Advances in neural information processing systems 17, 825-832. Cambridge, MA: MIT Press.
    • (2005) Advances in Neural Information Processing Systems , vol.17 , pp. 825-832
    • Liu, T.1    Moore, A.W.2    Gray, A.3    Yang, K.4
  • 14
    • 0034593060 scopus 로고    scopus 로고
    • Towards scalable support vector machines using squashing
    • Pavlov, D., Chudova, D., & Smyth, P. (2000). Towards scalable support vector machines using squashing. ACM SIGKDD (pp. 295-299).
    • (2000) ACM SIGKDD , pp. 295-299
    • Pavlov, D.1    Chudova, D.2    Smyth, P.3
  • 16
    • 0002493574 scopus 로고    scopus 로고
    • Sparse greedy matrix approximation for machine learning
    • Smola, A. J., & Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. ICML.
    • (2000) ICML
    • Smola, A.J.1    Schölkopf, B.2
  • 17
    • 23044525572 scopus 로고    scopus 로고
    • Scaling kernel-based systems to large data sets
    • Tresp, V. (2001). Scaling kernel-based systems to large data sets. Data Min. Knowl. Discov., 5, 197-211.
    • (2001) Data Min. Knowl. Discov. , vol.5 , pp. 197-211
    • Tresp, V.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.