Feature Weighting Random Forest for Detection of Hidden Web Search Interfaces

Search interface detection is an essential task for extracting information from the hidden Web. The challenge for this task is that search interface data is represented in high-dimensional and sparse features with many missing values. This paper presents a new multi-classifier ensemble approach to solving this problem. In this approach, we have extended the random forest algorithm with a weighted feature selection method to build the individual classifiers. With this improved random forest algorithm (IRFA), each classifier can be learned from a weighted subset of the feature space so that the ensemble of decision trees can fully exploit the useful features of search interface patterns. We have compared our ensemble approach with other well-known classification algorithms, such as SVM, C4.5, Naïve Bayes, and original random forest algorithm (RFA). The experimental results have shown that our method is more effective in detecting search interfaces of the hidden Web.

並列關鍵字

Search Interface Detection ； Random Forest ； Hidden Web ； Form Classification

參考文獻

Breiman, L.(2001).Random forests.Machine Learning.45(1),5-32.

Google Scholar

Breiman, L.,Friedman, J. H.,Olshen, R. A.(1984).Classification and regression trees.New York:Chapman & Hall.

Google Scholar

URL

Google Scholar

Caverlee, J.,Liu, L.,Probe, D. B.(2004).Cluster and discover: focused extraction of qa-pagelets from the deep web.Proceeding of the 20th International Conference of Data Engineering.(Proceeding of the 20th International Conference of Data Engineering).

Google Scholar

Cope, J.,Craswell, N.,Hawking, D.(2003).Automated discovery of search nterfaces on the web.Fourteenth Australasian Database Conference.(Fourteenth Australasian Database Conference).:

Google Scholar

國際替代計量

Feature Weighting Random Forest for Detection of Hidden Web Search Interfaces

全文下載

主題瀏覽