메뉴 건너뛰기




Volumn 46, Issue 2, 2009, Pages 481-491

Using domain-specific knowledge in generalization error bounds for support vector machine learning

Author keywords

Ellipsoid method; Error bounds; Fat shattering dimension; Prior knowledge; Support vector machines

Indexed keywords

CONTROL THEORY; GEARS; IMAGE RETRIEVAL; LEARNING SYSTEMS; MULTILAYER NEURAL NETWORKS; NUMERICAL ANALYSIS; VECTORS;

EID: 57849101999     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2008.09.001     Document Type: Article
Times cited : (21)

References (40)
  • 1
    • 0031176507 scopus 로고    scopus 로고
    • Scale-sensitive dimensions, uniform convergence, and learnability
    • Alon N., Ben-David S., Cesa-Bianchi N., and Haussler D. Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the ACM 44 4 (1997) 615-631
    • (1997) Journal of the ACM , vol.44 , Issue.4 , pp. 615-631
    • Alon, N.1    Ben-David, S.2    Cesa-Bianchi, N.3    Haussler, D.4
  • 2
    • 0033882594 scopus 로고    scopus 로고
    • Estimating the number of vertices of a polyhedron
    • Avis D., and Devroye L. Estimating the number of vertices of a polyhedron. Information Processing Letters 73 137-143 (2001) 137
    • (2001) Information Processing Letters , vol.73 , Issue.137-143 , pp. 137
    • Avis, D.1    Devroye, L.2
  • 3
    • 0032856761 scopus 로고    scopus 로고
    • On domain knowledge and feature selection using a support vector machine
    • Barzilay O., and Brailovsky V.L. On domain knowledge and feature selection using a support vector machine. Pattern Recognition Letters 20 (1999) 475-484
    • (1999) Pattern Recognition Letters , vol.20 , pp. 475-484
    • Barzilay, O.1    Brailovsky, V.L.2
  • 4
    • 0001907967 scopus 로고    scopus 로고
    • Support vector machines: hype or hallelujah
    • Bennett J.C., and Campbel C. Support vector machines: hype or hallelujah. SIGKDD Explorations 2 2 (2000) 1-13
    • (2000) SIGKDD Explorations , vol.2 , Issue.2 , pp. 1-13
    • Bennett, J.C.1    Campbel, C.2
  • 7
    • 36249013642 scopus 로고    scopus 로고
    • A machine learning approach to web page filtering using content and structure analysis
    • Chau M., and Chen H. A machine learning approach to web page filtering using content and structure analysis. Decision Support Systems 44 2 (2008) 482-494
    • (2008) Decision Support Systems , vol.44 , Issue.2 , pp. 482-494
    • Chau, M.1    Chen, H.2
  • 13
    • 19844362533 scopus 로고    scopus 로고
    • Retrieved September 11, 2007 from ftp://math.chtf.stuba.sk/pub/vlado/NN_books_texts/Hritsev_The_ANN_Book.p df
    • Hristev R.M. The ANN Book (1998). ftp://math.chtf.stuba.sk/pub/vlado/NN_books_texts/Hritsev_The_ANN_Book.p df Retrieved September 11, 2007 from ftp://math.chtf.stuba.sk/pub/vlado/NN_books_texts/Hritsev_The_ANN_Book.p df
    • (1998) The ANN Book
    • Hristev, R.M.1
  • 14
    • 2442665617 scopus 로고    scopus 로고
    • Credit rating analysis with support vector machines and neural networks: a market comparative study
    • Huang Z., Chen H., Hsu C., Chen W., and Wu S. Credit rating analysis with support vector machines and neural networks: a market comparative study. Decision Support Systems 37 4 (2004) 543-558
    • (2004) Decision Support Systems , vol.37 , Issue.4 , pp. 543-558
    • Huang, Z.1    Chen, H.2    Hsu, C.3    Chen, W.4    Wu, S.5
  • 15
  • 19
    • 0000564361 scopus 로고
    • A polynomial algorithm for linear programming
    • Khachiyan L.G. A polynomial algorithm for linear programming. Soviet Mathematics Doklady 20 (1979) 191-194
    • (1979) Soviet Mathematics Doklady , vol.20 , pp. 191-194
    • Khachiyan, L.G.1
  • 22
    • 57849167593 scopus 로고    scopus 로고
    • Martens, D., Bruynseels, L., Baesens, B., Willekens, M., & Vanthienen, J., (in press). Predicting Going Concern Opinion with Data Mining. Decision Support Systems
    • Martens, D., Bruynseels, L., Baesens, B., Willekens, M., & Vanthienen, J., (in press). Predicting Going Concern Opinion with Data Mining. Decision Support Systems
  • 23
    • 84976163829 scopus 로고
    • The maximum number of faces of a convex polytope
    • McMullen P. The maximum number of faces of a convex polytope. Mathematika XVII (1970) 179-184
    • (1970) Mathematika , vol.XVII , pp. 179-184
    • McMullen, P.1
  • 29
    • 0342336859 scopus 로고
    • Convergence rate of the gradient descent method with dilatation of the space
    • Shor N.Z. Convergence rate of the gradient descent method with dilatation of the space. translated in Cybernetics 6 2 (1970) 102-108
    • (1970) translated in Cybernetics , vol.6 , Issue.2 , pp. 102-108
    • Shor, N.Z.1
  • 30
    • 34548491642 scopus 로고    scopus 로고
    • An intelligent information agent for document title classification and filtering in document-intensive domains
    • Song D., Lau R.Y.K., Bruza P.D., Wong K., and Chen D. An intelligent information agent for document title classification and filtering in document-intensive domains. Decision Support Systems 44 1 (2007) 251-265
    • (2007) Decision Support Systems , vol.44 , Issue.1 , pp. 251-265
    • Song, D.1    Lau, R.Y.K.2    Bruza, P.D.3    Wong, K.4    Chen, D.5
  • 31
  • 35
    • 0001024505 scopus 로고
    • On the uniform convergence of relative frequencies of events to their probabilities
    • Vapnik N.V., and Chervonenkis A.Y. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications 16 2 (1971) 264-280
    • (1971) Theory of Probability and Its Applications , vol.16 , Issue.2 , pp. 264-280
    • Vapnik, N.V.1    Chervonenkis, A.Y.2
  • 37
    • 0000459352 scopus 로고    scopus 로고
    • The existence of a priori distinctions between learning algorithms
    • Wolpert D.H. The existence of a priori distinctions between learning algorithms. Neural Computation 8 7 (1996) 1391-1420
    • (1996) Neural Computation , vol.8 , Issue.7 , pp. 1391-1420
    • Wolpert, D.H.1
  • 38
    • 0000459353 scopus 로고    scopus 로고
    • The lack of a priori distinctions between learning algorithms
    • Wolpert D.H. The lack of a priori distinctions between learning algorithms. Neural Computation 8 7 (1996) 1341-1390
    • (1996) Neural Computation , vol.8 , Issue.7 , pp. 1341-1390
    • Wolpert, D.H.1
  • 40
    • 0004000055 scopus 로고
    • No free lunch theorems for search
    • Santa Fe Institute SFI-TR-95-02-010
    • Wolpert D.H., and Macready W.G. No free lunch theorems for search. Technical Report (1995), Santa Fe Institute SFI-TR-95-02-010
    • (1995) Technical Report
    • Wolpert, D.H.1    Macready, W.G.2


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