A hybrid approach for extracting informative content from web pages

被引:43
作者
Uzun, Erdinc [1 ]
Agun, Hayri Volkan [2 ]
Yerlikaya, Tarik [2 ]
机构
[1] Namik Kemal Univ, Corlu Engn Fac, Dept Comp Engn, Corlu, Tekirdag, Turkey
[2] Trakya Univ, Fac Engn & Architecture, Dept Comp Engn, Edirne, Turkey
关键词
Web Content Extraction; Template Detection; Web Cleaning; Web Learning Modeling; SEARCHING STRATEGIES;
D O I
10.1016/j.ipm.2013.02.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Eliminating noisy information and extracting informative content have become important issues for web mining, search and accessibility. This extraction process can employ automatic techniques and hand-crafted rules. Automatic extraction techniques focus on various machine learning methods, but implementing these techniques increases time complexity of the extraction process. Conversely, extraction through hand-crafted rules is an efficient technique that uses string manipulation functions, but preparing these rules is difficult and cumbersome for users. In this paper, we present a hybrid approach that contains two steps that can invoke each other. The first step discovers informative content using Decision Tree Learning as an appropriate machine learning method and creates rules from the results of this learning method. The second step extracts informative content using rules obtained from the first step. However, if the second step does not return an extraction result, the first step gets invoked. In our experiments, the first step achieves high accuracy with 95.76% in extraction of the informative content. Moreover, 71.92% of the rules can be used in the extraction process, and it is approximately 240 times faster than the first step. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:928 / 944
页数:17
相关论文
共 47 条
[1]  
[Anonymous], 2010, WSDM 2010 P 3 ACM IN, DOI DOI 10.1145/1718487.1718542
[2]  
[Anonymous], 2003, VIPS VISION BASED PA
[3]  
Baluja S., 2006, WWW 06 P 15 INT C WO, P33, DOI DOI 10.1145/1135777.1135788
[4]  
Bar-Yossef Z., 2002, P 11 INT C WORLD WID, P580, DOI DOI 10.1145/511446.511522
[5]  
Breiman L., 1984, CLASSIFICATION REGRE
[6]   Output-sensitive algorithms for computing nearest-neighbour decision boundaries [J].
Bremner, D ;
Demaine, E ;
Erickson, J ;
Iacono, J ;
Langerman, S ;
Morin, P ;
Toussaint, G .
DISCRETE & COMPUTATIONAL GEOMETRY, 2005, 33 (04) :593-604
[7]  
Cai D, 2003, LECT NOTES COMPUT SC, V2642, P406
[8]   Information retrieval on Turkish texts [J].
Can, Fazli ;
Kocberber, Seyit ;
Balcik, Erman ;
Kaynak, Cihan ;
Ocalan, H. Cagdas ;
Vursavas, Onur M. .
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2008, 59 (03) :407-421
[9]  
Chakrabarti Deepayan, 2008, P 17 INT C WORLD WID, P377, DOI DOI 10.1145/1367497
[10]  
Chakrabarti Deepayan., 2007, P 16 INT C WORLD WID, P61, DOI DOI 10.1145/1242572.1242582