期刊文献+

Optimization of Web Search Engine and Its Application to Web Mining 被引量:1

Optimization of Web Search Engine and Its Application to Web Mining
原文传递
导出
摘要 With the explosive growth of information sources available on the World Wide Web, how to combine the results of multiple search engines has become a valuable problem. In this paper, a search strategy based on genetic simulated annealing for search engines in Web mining is proposed. According to the proposed strategy, there exists some important relationship among Web statistical studies, search engines and optimization techniques. We have proven experimentally the relevance of our approach to the presented queries by comparing the qualities of output pages with those of the original downloaded pages, as the number of iterations increases better results are obtained with reasonable execution time. With the explosive growth of information sources available on the World Wide Web, how to combine the results of multiple search engines has become a valuable problem. In this paper, a search strategy based on genetic simulated annealing for search engines in Web mining is proposed. According to the proposed strategy, there exists some important relationship among Web statistical studies, search engines and optimization techniques. We have proven experimentally the relevance of our approach to the presented queries by comparing the qualities of output pages with those of the original downloaded pages, as the number of iterations increases better results are obtained with reasonable execution time.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2009年第2期115-118,共4页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foundation of China (60673093)
关键词 Web mining genetic algorithm simulated annealing Web mining genetic algorithm simulated annealing
  • 相关文献

参考文献3

二级参考文献24

  • 1韩潮,谢华伟.空间交会中多圈Lambert变轨算法研究[J].中国空间科学技术,2004,24(5):9-14. 被引量:32
  • 2徐宗本 高勇.遗传算法过早收敛现象的特征分析及其预防[J].《中国科学》〔E辑〕,1997,27(2):154-164.
  • 3Rudolph G. Convergence analysis of canonical genetic algorithms[J]. IEEE Transactions on Neural Networks. 1994.5 : 96 - 101.
  • 4J. Suzuki. A Markov chain analysis on simple genetic algorithms[J]. IEEE Transactions on Systems. Man and Cybernetics, 1995.25 : 655-659.
  • 5Jun He. Lishan Kang. On the convergence rates of genetic algorithms, Theoretical Computer Science[J].1999,229 : 23-39.
  • 6Yanchun Liang,Chunguang Zhou, Aaishen Wang, Heow Pueh Lee,Siak Piang Lim. An equivalent genetic algorithm based on extended strings and its convergence analysis[J]. Information Sciences,2001,138:119-135.
  • 7Shen H J, Tsiotras P. Optimal two-impulse rendezvous using multiple-revolution Lambert solutions [ J]. Journal of Guidance Control and Dynamics, 2003, 26(1):50-61
  • 8Prussing J E. A class of optimal two-impulse rendezvous using multiple-revolution Lambert solutions [ J ]. Journal of the Astronautical Sciences, 2000, 48(2) :131 - 148
  • 9Kim Y H, Spencer D B. Optimal spacecraft rendezvous using genetic algorithms [ J ]. Journal of Spacecraft and Rockets, 2002, 39(6) :859 -865
  • 10刘琳.航天器轨道理论[M].北京:国防工业出版社,2000

共引文献33

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部