메뉴 건너뛰기




Volumn 194, Issue , 2006, Pages 205-256

On kernel target alignment

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33845245626     PISSN: 14349922     EISSN: None     Source Type: Book Series    
DOI: 10.1007/10985687_8     Document Type: Article
Times cited : (92)

References (23)
  • 1
    • 0042777467 scopus 로고    scopus 로고
    • Kernel independent components analysis
    • Department of computer science, University of California, Berkeley, Berkeley, CA
    • F. Bach and M.I. Jordan. Kernel independent components analysis. Department of computer science, University of California, Berkeley, Berkeley, CA, 2001.
    • (2001)
    • Bach, F.1    Jordan, M.I.2
  • 3
    • 0026860799 scopus 로고
    • Robust linear programming discrimination of two linearly inseparable sets
    • K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
    • (1992) Optimization Methods and Software , vol.1 , pp. 23-34
    • Bennett, K.P.1    Mangasarian, O.L.2
  • 4
    • 0043091624 scopus 로고    scopus 로고
    • Sparse matrix re-ordering schemes for browsing hypertext
    • In J. Renegar, M. Shub, and S.Smale, editors, American Mathematical Society
    • M.W. Berry, B. Hendrickson, and P. Raghaven. Sparse matrix re-ordering schemes for browsing hypertext. In J. Renegar, M. Shub, and S.Smale, editors, The Mathematics of Numerical Analysis, pages 91-123. American Mathematical Society, 1996.
    • (1996) The Mathematics of Numerical Analysis , pp. 91-123
    • Berry, M.W.1    Hendrickson, B.2    Raghaven, P.3
  • 6
    • 0004148979 scopus 로고
    • Entropy, compactness and the approximation of operators
    • Cambridge University Press, Cambridge, UK
    • B. Carl and I. Stephani. Entropy, compactness and the approximation of operators. Cambridge University Press, Cambridge, UK, 1990.
    • (1990)
    • Carl, B.1    Stephani, I.2
  • 12
    • 33845255307 scopus 로고    scopus 로고
    • Estimating the optimal margins of embeddings in euclidean half spaces
    • In Submitted
    • J. Forster, N. Schmitt, and H. U. Simon. Estimating the optimal margins of embeddings in euclidean half spaces. In Submitted Computational Learning Theory (COLT) 2001, 2001.
    • (2001) Computational Learning Theory (COLT) , pp. 2001
    • Forster, J.1    Schmitt, N.2    Simon, H.U.3
  • 15
    • 0001035413 scopus 로고
    • On the method of bounded differences
    • C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188, 1989.
    • (1989) Surveys in Combinatorics , pp. 148-188
    • McDiarmid, C.1
  • 17
    • 0000812783 scopus 로고
    • Partitioning sparse matrices with eigenvectors of graphs
    • A. Pothen, H. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal Matrix Analysis, 11(3):242-248, 1990.
    • (1990) SIAM Journal Matrix Analysis , vol.11 , Issue.3 , pp. 242-248
    • Pothen, A.1    Simon, H.2    Liou, K.3


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