메뉴 건너뛰기




Volumn , Issue , 2006, Pages 45-49

Unsupervised learning of tree alignment models for information extraction

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; FORESTRY; HTML; INFORMATION RETRIEVAL; MACHINE LEARNING; SEMANTICS; SUPPORT VECTOR MACHINES; TREES (MATHEMATICS); WEB CRAWLER;

EID: 57849114197     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdmw.2006.166     Document Type: Conference Paper
Times cited : (11)

References (18)
  • 3
    • 84944318551 scopus 로고    scopus 로고
    • Visual web information extraction with lixto
    • R. Baumgartner, S. Flesca, and G. Gottlob. Visual web information extraction with lixto. In The VLDB Journal, pages 119-128, 2001.
    • (2001) The VLDB Journal , pp. 119-128
    • Baumgartner, R.1    Flesca, S.2    Gottlob, G.3
  • 4
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • P. Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1-3):217-239, 2005.
    • (2005) Theor. Comput. Sci. , vol.337 , Issue.1-3 , pp. 217-239
    • Bille, P.1
  • 5
    • 27144489164 scopus 로고    scopus 로고
    • A tutorial on support vector machines for pattern recognition
    • C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121-167, 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.2 , pp. 121-167
    • Burges, C.J.C.1
  • 9
    • 0030285403 scopus 로고    scopus 로고
    • The kdd process for extracting useful knowledge from volumes of data
    • U. M. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. The kdd process for extracting useful knowledge from volumes of data. Commun. ACM, 39(11):27-34, 1996.
    • (1996) Commun. ACM , vol.39 , Issue.11 , pp. 27-34
    • Fayyad, U.M.1    Piatetsky-Shapiro, G.2    Smyth, P.3
  • 11
    • 0034172374 scopus 로고    scopus 로고
    • Wrapper induction: Efficiency and expressiveness
    • N. Kushmerick. Wrapper induction: efficiency and expressiveness. Artif. Intell., 118(1-2):15-68, 2000.
    • (2000) Artif. Intell. , vol.118 , Issue.1-2 , pp. 15-68
    • Kushmerick, N.1
  • 13
  • 15
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
    • (1979) J. ACM , vol.26 , Issue.3 , pp. 422-433
    • Tai, K.-C.1


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