메뉴 건너뛰기




Volumn 3, Issue 4, 2007, Pages 701-713

An application of the nearest correlation matrix on web document classification

Author keywords

Classification; Kernel Matrix; Semidefinite Programming; Support vector machines

Indexed keywords


EID: 57249089431     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2007.3.701     Document Type: Article
Times cited : (7)

References (25)
  • 1
    • 33646249113 scopus 로고    scopus 로고
    • Least-squares covariance matrix adjustment
    • S. Boyd and L, Xiao, Least-squares covariance matrix adjustment, SIAM J. Matrix Anal. Appl., 27 (2005), 532-546.
    • (2005) SIAM J. Matrix Anal. Appl , vol.27 , pp. 532-546
    • Boyd, S.1    Xiao, L.2
  • 2
    • 31744441062 scopus 로고    scopus 로고
    • Approximate Matching of XML document with Regular Hedge Grammar
    • R. Canfield and G. Xing, Approximate Matching of XML document with Regular Hedge Grammar, International Journal of Computer Mathematics, 82 (2005), 1191-1198.
    • (2005) International Journal of Computer Mathematics , vol.82 , pp. 1191-1198
    • Canfield, R.1    Xing, G.2
  • 3
    • 0345861203 scopus 로고    scopus 로고
    • New algorithm for ordered Tree-to-Tree correction problem
    • W. Chen, New algorithm for ordered Tree-to-Tree correction problem, J. of Algorithms, 40 (2001), 135-158.
    • (2001) J. of Algorithms , vol.40 , pp. 135-158
    • Chen, W.1
  • 7
    • 0344153904 scopus 로고    scopus 로고
    • Computing the nearest correlation matrix - a problem from finance
    • N. J. Higham, Computing the nearest correlation matrix - a problem from finance, IMA J. Numer. Analysis, 22 (2002), 329-343.
    • (2002) IMA J. Numer. Analysis , vol.22 , pp. 329-343
    • Higham, N.J.1
  • 9
    • 14544268199 scopus 로고    scopus 로고
    • A dual approach to semidefinite least-squares problems
    • J. Malick, A dual approach to semidefinite least-squares problems, SIAM J. Matrix Anal. Appl., 26 (2004), 272-284.
    • (2004) SIAM J. Matrix Anal. Appl , vol.26 , pp. 272-284
    • Malick, J.1
  • 10
    • 0038336876 scopus 로고    scopus 로고
    • S. McNee, I. Albert, D. Cosley, P. Gopalkrishnan, S. K. Lam, A. M. Rashid, J. A. Konstan and J. Riedl, On the recommending of citations for research papers, in Proceedings of the ACM 2002 Conference on Computer Supported Cooperative Work (CSCW 2002), New Orleans, LA, (2002), 116-125.
    • S. McNee, I. Albert, D. Cosley, P. Gopalkrishnan, S. K. Lam, A. M. Rashid, J. A. Konstan and J. Riedl, On the recommending of citations for research papers, in "Proceedings of the ACM 2002 Conference on Computer Supported Cooperative Work" (CSCW 2002), New Orleans, LA, (2002), 116-125.
  • 13
    • 85036857343 scopus 로고    scopus 로고
    • XML Document Mining Challenge, http://xralmining,lip6.fr/.
    • XML Document Mining Challenge, http://xralmining,lip6.fr/.
  • 14
    • 8744271664 scopus 로고
    • Approximately matching context free languages
    • G. Myers, Approximately matching context free languages, Information Processing Letters, 54 (1995), 85-92.
    • (1995) Information Processing Letters , vol.54 , pp. 85-92
    • Myers, G.1
  • 15
    • 34247364678 scopus 로고    scopus 로고
    • H.-D. Qi and D. Sun, A quadratically convergent Newton method for computing the nearest correlation matrix, SIAM J, Matrix Anal. Appl., 28 (2006), 360-385.
    • H.-D. Qi and D. Sun, A quadratically convergent Newton method for computing the nearest correlation matrix, SIAM J, Matrix Anal. Appl., 28 (2006), 360-385.
  • 18
    • 0002442796 scopus 로고    scopus 로고
    • Machine learning in automated text categorization
    • F. Sebastiani, Machine learning in automated text categorization, ACM Comput. Surv., 34 (2002) 1-47.
    • (2002) ACM Comput. Surv , vol.34 , pp. 1-47
    • Sebastiani, F.1
  • 21
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
    • J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optimization Methos and Software, 11-12 (1999), 625-53.
    • (1999) Optimization Methos and Software , vol.11-12 , pp. 625-653
    • Sturm, J.F.1
  • 22
    • 33644539174 scopus 로고    scopus 로고
    • Finding an Optimum Edit Script between an XML Document and a DTD
    • Santa Fe, NM
    • N. Suzuki, Finding an Optimum Edit Script between an XML Document and a DTD, in "Proceedings of ACM Symposium on Applied Computing", Santa Fe, NM, (2005), 647-653.
    • (2005) Proceedings of ACM Symposium on Applied Computing , pp. 647-653
    • Suzuki, N.1
  • 24
    • 0345959841 scopus 로고    scopus 로고
    • Approximate tree pattern matching
    • eds. Apostolico, A. and Galil, Z, Oxford University Press
    • D. Shasha and K. Zhang, Approximate tree pattern matching, in "Chapter 14 Pattern Matching Algorithms" (eds. Apostolico, A. and Galil, Z.), Oxford University Press, 1997.
    • (1997) Pattern Matching Algorithms
    • Shasha, D.1    Zhang, K.2


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