메뉴 건너뛰기




Volumn 6911 LNAI, Issue PART 1, 2011, Pages 188-203

Learning good edit similarities with generalization guarantees

Author keywords

Edit Similarity Learning; Good Similarity Functions

Indexed keywords

CLASSIFICATION MODELS; DISTANCE FUNCTIONS; EDIT DISTANCE; EDIT SIMILARITY LEARNING; GENERALIZATION PERFORMANCE; LEARNING APPROACH; NEW THEORY; SIMILARITY FUNCTIONS; STATE-OF-THE-ART METHODS; STRUCTURED DATA; THEORY OF LEARNING; UNIFORM STABILITY; DISCRIMINATIVE POWER; SIMILARITY LEARNING; THEORETICAL GUARANTEES;

EID: 80052411246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23780-5_22     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 3
    • 61749090884 scopus 로고    scopus 로고
    • Distance Metric Learning for Large Margin Nearest Neighbor Classification
    • Weinberger, K.Q., Saul, L.K.: Distance Metric Learning for Large Margin Nearest Neighbor Classification. J. of Mach. Learn. Res. (JMLR) 10, 207-244 (2009)
    • (2009) J. of Mach. Learn. Res. (JMLR) , vol.10 , pp. 207-244
    • Weinberger, K.Q.1    Saul, L.K.2
  • 4
    • 84863337530 scopus 로고    scopus 로고
    • Regularized distance metric learning: Theory and algorithm
    • Jin, R., Wang, S., Zhou, Y.: Regularized distance metric learning: Theory and algorithm. In: Adv. in Neural Inf. Proc. Sys. (NIPS), pp. 862-870 (2009)
    • (2009) Adv. in Neural Inf. Proc. Sys. (NIPS) , pp. 862-870
    • Jin, R.1    Wang, S.2    Zhou, Y.3
  • 7
    • 33744981648 scopus 로고    scopus 로고
    • Learning Stochastic Edit Distance: Application in handwritten character recognition
    • Oncina, J., Sebban, M.: Learning Stochastic Edit Distance: Application in handwritten character recognition. Pattern Recognition 39(9), 1575-1587 (2006)
    • (2006) Pattern Recognition , vol.39 , Issue.9 , pp. 1575-1587
    • Oncina, J.1    Sebban, M.2
  • 8
    • 42749094100 scopus 로고    scopus 로고
    • Learning probabilistic models of tree edit distance
    • Bernard, M., Boyer, L., Habrard, A., Sebban, M.: Learning probabilistic models of tree edit distance. Pattern Recognition 41(8), 2611-2629 (2008)
    • (2008) Pattern Recognition , vol.41 , Issue.8 , pp. 2611-2629
    • Bernard, M.1    Boyer, L.2    Habrard, A.3    Sebban, M.4
  • 9
    • 71249112751 scopus 로고    scopus 로고
    • Bayesian Similarity Model Estimation for Approximate Recognized Text Search
    • Takasu, A.: Bayesian Similarity Model Estimation for Approximate Recognized Text Search. In: Proc. of the Int. Conf. on Doc. Ana. and Reco., pp. 611-615 (2009)
    • (2009) Proc. of the Int. Conf. on Doc. Ana. and Reco. , pp. 611-615
    • Takasu, A.1
  • 10
    • 33746329568 scopus 로고    scopus 로고
    • Optimizing amino acid substitution matrices with a local alignment kernel
    • Saigo, H., Vert, J.-P., Akutsu, T.: Optimizing amino acid substitution matrices with a local alignment kernel. BMC Bioinformatics 7(246), 1-12 (2006)
    • (2006) BMC Bioinformatics , vol.7 , Issue.246 , pp. 1-12
    • Saigo, H.1    Vert, J.-P.2    Akutsu, T.3
  • 17
    • 44849098451 scopus 로고    scopus 로고
    • A Conditional Random Field for Discriminatively-trained Finite-state String Edit Distance
    • McCallum, A., Bellare, K., Pereira, F.: A Conditional Random Field for Discriminatively-trained Finite-state String Edit Distance. In: Conference on Uncertainty in AI, pp. 388-395 (2005)
    • (2005) Conference on Uncertainty in AI , pp. 388-395
    • McCallum, A.1    Bellare, K.2    Pereira, F.3
  • 18
    • 0001035413 scopus 로고
    • On the method of bounded differences
    • Cambridge University Press, Cambridge
    • McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, pp. 148-188. Cambridge University Press, Cambridge (1989)
    • (1989) Surveys in Combinatorics , pp. 148-188
    • McDiarmid, C.1


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