메뉴 건너뛰기




Volumn , Issue , 2005, Pages

An application of boosting to graph classification

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL COMPOUNDS; CONVOLUTION; SUPPORT VECTOR MACHINES;

EID: 84898968571     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (12)
  • 1
    • 0000275022 scopus 로고    scopus 로고
    • Prediction games and arching algoritms
    • Leo Breiman. Prediction games and arching algoritms. Neural Computation, 11(7):1493 - 1518, 1999.
    • (1999) Neural Computation , vol.11 , Issue.7 , pp. 1493-1518
    • Breiman, L.1
  • 2
    • 1942419006 scopus 로고    scopus 로고
    • Convolution kernels for natural language
    • Michael Collins and Nigel Duffy. Convolution kernels for natural language. In NIPS 14, Vol.1, pages 625-632, 2001.
    • (2001) NIPS 14 , vol.1 , pp. 625-632
    • Collins, M.1    Duffy, N.2
  • 3
    • 0031211090 scopus 로고    scopus 로고
    • A decision-theoretic generalization of on-line learning and an application to boosting
    • Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sicences, 55(1):119-139, 1996.
    • (1996) Journal of Computer and System Sicences , vol.55 , Issue.1 , pp. 119-139
    • Freund, Y.1    Schapire, R.E.2
  • 4
    • 0004019973 scopus 로고    scopus 로고
    • Convolution kernels on discrete structures
    • UCS-CRL-99-10
    • David Haussler. Convolution kernels on discrete structures. Technical report, UC Santa Cruz (UCS-CRL-99-10), 1999.
    • (1999) Technical Report, UC Santa Cruz
    • Haussler, D.1
  • 5
    • 84873909892 scopus 로고    scopus 로고
    • Svm kernels for semi-structured data
    • Hisashi Kashima and Teruo Koyanagi. Svm kernels for semi-structured data. In Proc. of ICML, pages 291-298, 2002.
    • (2002) Proc. of ICML , pp. 291-298
    • Kashima, H.1    Koyanagi, T.2
  • 6
    • 1942516986 scopus 로고    scopus 로고
    • Marginalized kernels between labeled graphs
    • Hisashi Kashima, Koji Tsuda, and Akihiro Inokuchi. Marginalized kernels between labeled graphs. In Proc. of ICML, pages 321-328, 2003.
    • (2003) Proc. of ICML , pp. 321-328
    • Kashima, H.1    Tsuda, K.2    Inokuchi, A.3
  • 8
    • 0342502195 scopus 로고    scopus 로고
    • Soft margins for adaboost
    • Gunnar Ratsch, Takashi Onoda, and Klaus-Robert Muller. Soft margins for AdaBoost. Machine Learning, 42(3):287-320, 2001.
    • (2001) Machine Learning , vol.42 , Issue.3 , pp. 287-320
    • Ratsch, G.1    Onoda, T.2    Muller, K.-R.3
  • 9
    • 0002595663 scopus 로고    scopus 로고
    • Boosting the margin: A new explanation for the effectiveness of voting methods
    • Robert E. Schapire, Yoav Freund, Peter Bartlett, andWee Sun Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. In Proc. of ICML, pages 322-330, 1997.
    • (1997) Proc. of ICML , pp. 322-330
    • Schapire, R.E.1    Freund, Y.2    Bartlett, P.3    Lee, A.S.4
  • 10
    • 0033905095 scopus 로고    scopus 로고
    • Boostexter: A boosting-based system for text categorization
    • Robert E. Schapire and Yoram Singer. BoosTexter: A boosting-based system for text categorization. Machine Learning, 39(2/3):135-168, 2000.
    • (2000) Machine Learning , vol.39 , Issue.2-3 , pp. 135-168
    • Schapire, R.E.1    Singer, Y.2
  • 12
    • 78149333073 scopus 로고    scopus 로고
    • Gspan: Graph-based substructure pattern mining
    • Xifeng Yan and Jiawei Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, pages 721-724, 2002.
    • (2002) Proc. of ICDM , pp. 721-724
    • Yan, X.1    Han, J.2


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