Mining Web informative structures and contents based on entropy analysis. Kao, H., Lin, S., Ho, J., & Chen, M. IEEE Transactions on Knowledge and Data Engineering, 16(1):41--55, 2004. doi abstract bibtex We study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entropy-based analysis (LAMIS) mechanism for analyzing the entropy of anchor texts and links to eliminate the redundancy of the hyperlinked structure so that the complex structure of a Web site can be distilled. However, to increase the value and the accessibility of pages, most of the content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, copy announcements, etc. To further eliminate such redundancy, we propose another mechanism, called InfoDiscoverer, which applies the distilled structure to identify sets of article pages. InfoDiscoverer also employs the entropy information to analyze the information measures of article sets and to extract informative content blocks from these sets. Our result is useful for search engines, information agents, and crawlers to index, extract, and navigate significant information from a Web site. Experiments on several real news Web sites show that the precision and the recall of our approaches are much superior to those obtained by conventional methods in mining the informative structures of news Web sites. On the average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 122 to 257 percent when the desired recall falls between 0.5 and 1. In comparison with manual heuristics, the precision and the recall of InfoDiscoverer are greater than 0.956.
@article{kao_mining_2004,
title = {Mining {Web} informative structures and contents based on entropy analysis},
volume = {16},
issn = {1041-4347},
doi = {10.1109/TKDE.2004.1264821},
abstract = {We study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entropy-based analysis (LAMIS) mechanism for analyzing the entropy of anchor texts and links to eliminate the redundancy of the hyperlinked structure so that the complex structure of a Web site can be distilled. However, to increase the value and the accessibility of pages, most of the content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, copy announcements, etc. To further eliminate such redundancy, we propose another mechanism, called InfoDiscoverer, which applies the distilled structure to identify sets of article pages. InfoDiscoverer also employs the entropy information to analyze the information measures of article sets and to extract informative content blocks from these sets. Our result is useful for search engines, information agents, and crawlers to index, extract, and navigate significant information from a Web site. Experiments on several real news Web sites show that the precision and the recall of our approaches are much superior to those obtained by conventional methods in mining the informative structures of news Web sites. On the average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 122 to 257 percent when the desired recall falls between 0.5 and 1. In comparison with manual heuristics, the precision and the recall of InfoDiscoverer are greater than 0.956.},
number = {1},
journal = {IEEE Transactions on Knowledge and Data Engineering},
author = {Kao, Hung-Yu and Lin, Shian-Hua and Ho, Jan-Ming and Chen, Ming-Syan},
year = {2004},
keywords = {Web sites},
pages = {41--55}
}
Downloads: 0
{"_id":"5gmaLxr5D7bm6sEpQ","bibbaseid":"kao-lin-ho-chen-miningwebinformativestructuresandcontentsbasedonentropyanalysis-2004","downloads":0,"creationDate":"2017-12-28T15:54:44.145Z","title":"Mining Web informative structures and contents based on entropy analysis","author_short":["Kao, H.","Lin, S.","Ho, J.","Chen, M."],"year":2004,"bibtype":"article","biburl":"http://bibbase.org/zotero/nimdvir","bibdata":{"bibtype":"article","type":"article","title":"Mining Web informative structures and contents based on entropy analysis","volume":"16","issn":"1041-4347","doi":"10.1109/TKDE.2004.1264821","abstract":"We study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entropy-based analysis (LAMIS) mechanism for analyzing the entropy of anchor texts and links to eliminate the redundancy of the hyperlinked structure so that the complex structure of a Web site can be distilled. However, to increase the value and the accessibility of pages, most of the content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, copy announcements, etc. To further eliminate such redundancy, we propose another mechanism, called InfoDiscoverer, which applies the distilled structure to identify sets of article pages. InfoDiscoverer also employs the entropy information to analyze the information measures of article sets and to extract informative content blocks from these sets. Our result is useful for search engines, information agents, and crawlers to index, extract, and navigate significant information from a Web site. Experiments on several real news Web sites show that the precision and the recall of our approaches are much superior to those obtained by conventional methods in mining the informative structures of news Web sites. On the average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 122 to 257 percent when the desired recall falls between 0.5 and 1. In comparison with manual heuristics, the precision and the recall of InfoDiscoverer are greater than 0.956.","number":"1","journal":"IEEE Transactions on Knowledge and Data Engineering","author":[{"propositions":[],"lastnames":["Kao"],"firstnames":["Hung-Yu"],"suffixes":[]},{"propositions":[],"lastnames":["Lin"],"firstnames":["Shian-Hua"],"suffixes":[]},{"propositions":[],"lastnames":["Ho"],"firstnames":["Jan-Ming"],"suffixes":[]},{"propositions":[],"lastnames":["Chen"],"firstnames":["Ming-Syan"],"suffixes":[]}],"year":"2004","keywords":"Web sites","pages":"41--55","bibtex":"@article{kao_mining_2004,\n\ttitle = {Mining {Web} informative structures and contents based on entropy analysis},\n\tvolume = {16},\n\tissn = {1041-4347},\n\tdoi = {10.1109/TKDE.2004.1264821},\n\tabstract = {We study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entropy-based analysis (LAMIS) mechanism for analyzing the entropy of anchor texts and links to eliminate the redundancy of the hyperlinked structure so that the complex structure of a Web site can be distilled. However, to increase the value and the accessibility of pages, most of the content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, copy announcements, etc. To further eliminate such redundancy, we propose another mechanism, called InfoDiscoverer, which applies the distilled structure to identify sets of article pages. InfoDiscoverer also employs the entropy information to analyze the information measures of article sets and to extract informative content blocks from these sets. Our result is useful for search engines, information agents, and crawlers to index, extract, and navigate significant information from a Web site. Experiments on several real news Web sites show that the precision and the recall of our approaches are much superior to those obtained by conventional methods in mining the informative structures of news Web sites. On the average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 122 to 257 percent when the desired recall falls between 0.5 and 1. In comparison with manual heuristics, the precision and the recall of InfoDiscoverer are greater than 0.956.},\n\tnumber = {1},\n\tjournal = {IEEE Transactions on Knowledge and Data Engineering},\n\tauthor = {Kao, Hung-Yu and Lin, Shian-Hua and Ho, Jan-Ming and Chen, Ming-Syan},\n\tyear = {2004},\n\tkeywords = {Web sites},\n\tpages = {41--55}\n}\n\n","author_short":["Kao, H.","Lin, S.","Ho, J.","Chen, M."],"key":"kao_mining_2004","id":"kao_mining_2004","bibbaseid":"kao-lin-ho-chen-miningwebinformativestructuresandcontentsbasedonentropyanalysis-2004","role":"author","urls":{},"keyword":["Web sites"],"downloads":0,"html":""},"search_terms":["mining","web","informative","structures","contents","based","entropy","analysis","kao","lin","ho","chen"],"keywords":["web sites"],"authorIDs":[],"dataSources":["ciBwinN9Eq8RkHS8Q"]}