| 基于半完全图在数据融合中的元搜索研究 |
| |
| 引用本文： | 丁一,龚家才.基于半完全图在数据融合中的元搜索研究[J].湖北师范学院学报(自然科学版),2008,28(2):38-43. |
| |
| 作者姓名： | 丁一 龚家才 |
| |
| 作者单位： | 1. 湖北师范学院,计算机科学与技术系,湖北,黄石,435002
2. 湖北第二师范学院,教务处,湖北,武汉,430000 |
| |
| 摘 要： | 基于对Web图的特性和性质的介绍，探讨了一个Web演化生成的模型；论述了结舍Web图论以及社会网络分析等思想，在研究Web上的搜索引擎中的应用，从社会选择理论提出了基于半完全图的融合模型，并结合堆排序给出了一个高效的元搜索融合算法，并且和其他融合算法做了一定比较，发现半完全图融合这一方法的性能最好。
|
| 关 键 词： | 元搜索 数据融合 半完全图 |
The research of meta-search data fusion based on semi-complete graph |
| |
| DING Yi,GONG Jia-cai.The research of meta-search data fusion based on semi-complete graph[J].Journal of Hubei Normal University(Natural Science),2008,28(2):38-43. |
| |
| Authors: | DING Yi GONG Jia-cai |
| |
| Institution: | DING Yi, GONG Jia-cai ( 1. Department of Computer Science and Technology, Hubei Normal University, Huangshi 435002, China; 2. Dean＇s Office of Hubei University of Education, Wuhan 430205, China ) |
| |
| Abstract: | This research focuses on how to effectively and broadly get relevant Web pages and contents, filter Web pages and assign proper labels for them. Then issues a new data fusion based on semi - complete graph, and it can be effectively implementod with HeapSort. Comparing with other fusion methods, these methods promote the average precision evidently and steadily. They yield improvements in the effectiveness and the effectiveness is comparable to that of approach that analyzing the web documents. |
| |
| Keywords: | meta- search data fusion semi- complete graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
