메뉴 건너뛰기




Volumn 8, Issue 4, 2005, Pages 438-461

Web data extraction based on structural similarity

Author keywords

Classification; Clustering; Framework; Web data extraction

Indexed keywords

CLASSIFICATION (OF INFORMATION); EXTRACTION; INFORMATION RETRIEVAL SYSTEMS;

EID: 28044431810     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-004-0188-z     Document Type: Article
Times cited : (30)

References (21)
  • 1
    • 0346520768 scopus 로고
    • An RNC algorithm for finding a largest common subtree of two trees
    • E75-D
    • Akutsu T (1992) An RNC algorithm for finding a largest common subtree of two trees. IEICE Trans Inf Syst E75-D:95-101
    • (1992) IEICE Trans. Inf. Syst. , pp. 95-101
    • Akutsu, T.1
  • 7
    • 0242453377 scopus 로고    scopus 로고
    • Monadic datalog and the expressive power of languages for web information extraction
    • Gottlob G, Koch C (2000) Monadic datalog and the expressive power of languages for web information extraction. In: Proceedings of the 21st PODS, pp 17-28
    • (2000) Proceedings of the 21st PODS , pp. 17-28
    • Gottlob, G.1    Koch, C.2
  • 9
    • 28044438372 scopus 로고    scopus 로고
    • A clustering toolkit
    • Technical report TR#2-017, Univ Minnesota
    • Karypis G (2002) A clustering toolkit. Technical report TR#2-017, Univ Minnesota
    • (2002)
    • Karypis, G.1
  • 11
    • 0034172374 scopus 로고    scopus 로고
    • Wrapper induction: Efficiency and expressiveness
    • Kushmerick N (2000) Wrapper induction: Efficiency and expressiveness. Artif Intell 118(1-2):15-68
    • (2000) Artif. Intell. , vol.118 , Issue.1-2 , pp. 15-68
    • Kushmerick, N.1
  • 13
    • 0242456776 scopus 로고    scopus 로고
    • Discovering informative content blocks from web documents
    • Lin S-H, Ho J-M (2002) Discovering informative content blocks from web documents. In: Proceedings of SIGKDD
    • (2002) Proceedings of SIGKDD
    • Lin, S.-H.1    Ho, J.-M.2
  • 20
    • 0742268827 scopus 로고    scopus 로고
    • An efficient and scalable algorithm for clustering XML documents by structure
    • 10.1109/TKDE.2004.1264824
    • Lian W, Cheung DW-L (2004) An efficient and scalable algorithm for clustering XML documents by structure. IEEE Trans Knowl Data Eng 16(1):82-96 10.1109/TKDE.2004.1264824
    • (2004) IEEE Trans. Knowl. Data Eng. , vol.16 , Issue.1 , pp. 82-96
    • Lian, W.1    Cheung, D.W.-L.2


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