Abstract—Many websites with an underlying database containing structured data provide the richest and most dense source of information relevant for topical data integration. The real data integration requires sustainable and reliable pattern discovery to enable accurate content retrieval and to recognize pattern changes from time to time; yet, extracting the structured data from web documents is still lacking from its accuracy. This paper proposes the bar-tree representation to describe the whole pattern of web pages in an efficient way based on the reverse algorithm. While previous algorithms always trace the pattern and extract the region of interest from top root, the reverse algorithm recognizes the pattern from the region of interest to both top and bottom roots simultaneously. The attributes are then extracted and labeled reversely from the region of interest of targeted contents. Since using conventional representations for the algorithm should require more computational power, the bar-tree method is developed to represent the generated patterns using bar graphs characterized by the depths and widths from the document roots. We show that this representation is suitable for extracting the data from the semistructured web sources, and for detecting the template changes of targeted pages. The experimental results show perfect recognition rate for template changes in several web targets.
Index Terms—data extraction, data mining, web-based information system
Z. Akbar is also with the Group for Bioinformatics and Information Mining, Department of Computer and Information Science, University of Konstanz, Box D188, D-78457 Konstanz, Germany.
Cite: Z. Akbar, L. T. Handoko, "Pattern discovery for semi-structured web pagesusing bar-tree representation," International Journal of Computer Theory and Engineering vol. 3, no. 2, pp. 261-269, 2011.