Web document categorization using tree matching algorithm

Pao Yue-kong Library Electronic Theses Database

Web document categorization using tree matching algorithm

 

Author: Chong, Chi-yin
Title: Web document categorization using tree matching algorithm
Degree: M.Sc.
Year: 2000
Subject: HTML (Document markup language)
Computer algorithms
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Dept. of Computing
Pages: 75, 9 leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1527662
URI: http://theses.lib.polyu.edu.hk/handle/200/859
Abstract: We study the problem of classifying hierarchically structured information. Our work involve to classify (HTML) documents, and compare them to a set of defined template (or a repository of trees). We adopt the hierarchical classification problem as the problem of finding a "minimum-cost edit script" that transforms one data tree to another, and we present efficient algorithms for computing such as edit script. Our algorithms make use of some key domain characteristics to achieve substantially better performance than other general purpose algorithms. We study the feasibility and applicability of our algorithms, and an application focuses on Job classification of our techniques will be described.

Files in this item

Files Size Format
b15276624.pdf 2.294Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information