메뉴 건너뛰기




Volumn 8, Issue , 2011, Pages 41-54

Automatic wrapper adaptation by tree edit distance matching

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC WRAPPERS; DEGREE OF ROBUSTNESS; EXTRACTING INFORMATION; MATCHING TECHNIQUES; STRUCTURE CHANGE; TREE EDIT DISTANCE;

EID: 80053028500     PISSN: 21903018     EISSN: 21903026     Source Type: Book Series    
DOI: 10.1007/978-3-642-19618-8_3     Document Type: Article
Times cited : (18)

References (18)
  • 1
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • doi:10.1016/j.tcs.2004.12.030
    • Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337(1-3), 217-239 (2005), doi:10.1016/j.tcs.2004.12.030
    • (2005) Theoretical Computer Science , vol.337 , Issue.1-3 , pp. 217-239
    • Bille, P.1
  • 4
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6), 343 (1975)
    • (1975) Communications of the ACM , vol.18 , Issue.6 , pp. 343
    • Hirschberg, D.S.1
  • 6
    • 84896693236 scopus 로고    scopus 로고
    • Computing the edit-distance between unrooted ordered trees
    • Springer, Heidelberg
    • Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Algorithms-ESA. LNCS, vol. 1461, pp. 1-1. Springer, Heidelberg (1998)
    • (1998) Algorithms-ESA. LNCS , vol.1461 , pp. 1
    • Klein, P.1
  • 8
    • 0037806547 scopus 로고    scopus 로고
    • A brief survey of web data extraction tools
    • doi:10.1145/565117.565137
    • Laender, A.H.F., Ribeiro-Neto, B.A., Da, A.S., Silva, J.S.: A brief survey of web data extraction tools. ACM Sigmod 31(2), 84-93 (2002), doi:10.1145/565117.565137
    • (2002) ACM Sigmod , vol.31 , Issue.2 , pp. 84-93
    • Laender, A.H.F.1    Ribeiro-Neto, B.A.2    Da, A.S.3    Silva, J.S.4
  • 11
    • 33644550272 scopus 로고    scopus 로고
    • Automatic wrapper maintenance for semistructured web sources using results from previous queries
    • ACM Press, New York, doi:10.1145/1066677.1066826
    • Raposo, J., Pan, A., Álvarez, M., Viña, A.: Automatic wrapper maintenance for semistructured web sources using results from previous queries. In: Proceedings of the 2005 ACM symposium on Applied computing - SAC 2005, pp. 654-659. ACM Press, New York (2005), doi:10.1145/1066677.1066826
    • (2005) Proceedings of the 2005 ACM Symposium on Applied Computing - SAC 2005 , pp. 654-659
    • Raposo, J.1    Pan, A.2    Álvarez, M.3    Viña, A.4
  • 12
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • doi:10.1016/0020-0190(77)90064-3
    • Selkow, S.: The tree-to-tree editing problem. Information Processing Letters 6(6), 184-186 (1977), doi:10.1016/0020-0190(77)90064-3
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.1
  • 13
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • Tai, K.: The tree-to-tree correction problem. Journal of the ACM (JACM) 26(3), 433 (1979)
    • (1979) Journal of the ACM (JACM) , vol.26 , Issue.3 , pp. 433
    • Tai, K.1
  • 14
    • 68549107726 scopus 로고    scopus 로고
    • An overview on XML similarity: Background, current trends and future directions
    • doi:10.1016/j.cosrev.2009.03.001
    • Tekli, J., Chbeir, R., Yetongnon, K.: An overview on XML similarity: Background, current trends and future directions. Computer Science Review 3(3), 151-173 (2009), doi:10.1016/j.cosrev.2009.03.001
    • (2009) Computer Science Review , vol.3 , Issue.3 , pp. 151-173
    • Tekli, J.1    Chbeir, R.2    Yetongnon, K.3
  • 15
    • 19544378318 scopus 로고    scopus 로고
    • A Probabilistic Approach for Adapting Information Extraction Wrappers and Discovering New Attributes
    • IEEE, Los Alamitos, doi:10.1109/ICDM.2004.10111
    • Wong, T.: A Probabilistic Approach for Adapting Information Extraction Wrappers and Discovering New Attributes. In: Proceedings of the Fourth IEEE International Conference on Data Mining, pp. 257-264. IEEE, Los Alamitos (2004), doi:10.1109/ICDM.2004.10111
    • (2004) Proceedings of the Fourth IEEE International Conference on Data Mining , pp. 257-264
    • Wong, T.1
  • 16
    • 0026185673 scopus 로고
    • Identifying syntactic differences between two programs
    • Yang, W.: Identifying syntactic differences between two programs. Software - Practice and Experience 21(7), 739-755 (1991)
    • (1991) Software - Practice and Experience , vol.21 , Issue.7 , pp. 739-755
    • Yang, W.1
  • 17
    • 33744821948 scopus 로고    scopus 로고
    • Web data extraction based on partial tree alignment
    • ACM Press, New York, doi:10.1145/1060745.1060761
    • Zhai, Y., Liu, B.: Web data extraction based on partial tree alignment. In: Proceedings of the 14th International Conference on World Wide Web, pp. 76-85. ACM Press, New York (2005), doi:10.1145/1060745.1060761
    • (2005) Proceedings of the 14th International Conference on World Wide Web , pp. 76-85
    • Zhai, Y.1    Liu, B.2
  • 18
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245-1262 (1989)
    • (1989) SIAM J. Comput , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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