메뉴 건너뛰기




Volumn 2, Issue , 2009, Pages 245-248

DOM-based web pages to determine the structure of the similarity algorithm

Author keywords

DOM; Similarity algorithm; Web

Indexed keywords

BREADTH-FIRST TRAVERSAL; DATA EXCHANGE; DOM TREE; HTML PAGES; LAYER BY LAYER; OPERATING EFFICIENCY; PAGE STRUCTURES; ROOT NODES; SIMILARITY ALGORITHM; WEB DATA; WEB PAGE;

EID: 77649292498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IITA.2009.218     Document Type: Conference Paper
Times cited : (7)

References (4)
  • 2
    • 0242456776 scopus 로고    scopus 로고
    • Lin Shian hua,Ho Jan wing Discovering informative content blocks from Web documents [C] // Proceeding of the 8th ACM SIG KDD International Conference on Knowledge Discovery and Data Mining Edmonton ACM Press, 2002: 588-593
    • Lin Shian hua,Ho Jan wing Discovering informative content blocks from Web documents [C] // Proceeding of the 8th ACM SIG KDD International Conference on Knowledge Discovery and Data Mining Edmonton ACM Press, 2002: 588-593
  • 3
    • 77649334862 scopus 로고    scopus 로고
    • World Wide Web Consortium. Document Object Model Activity Statement [S/OL].(2007)-[2007-05-12].http://www.w3.org/DOM/Activit
    • World Wide Web Consortium. Document Object Model Activity Statement [S/OL].(2007)-[2007-05-12].http://www.w3.org/DOM/Activit
  • 4
    • 77649279580 scopus 로고    scopus 로고
    • Andy Clark. CyberNeko HTML Parser [EB/OL]. (2005)[2007-05-12]. http://peo-ple.apache.org/andyc/neko/doc/html/index.html
    • Andy Clark. CyberNeko HTML Parser [EB/OL]. (2005)[2007-05-12]. http://peo-ple.apache.org/andyc/neko/doc/html/index.html


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