排序方式： 共有63条查询结果，搜索用时 15 毫秒
41.
面向信息检索的汉语同义词自动识别和挖掘 总被引：3，自引：0，他引：3
为了提高同义词自动挖掘的效率，本文提出了从词典释义中自动识别和挖掘同义词的方法，使用超链接分析算法和模式匹配算法，从不同的角度提取同义词：第一部分是把词汇之间注释与被注释的关系看成是一种链接关系。对给定的词汇进行分析，把与给定词汇具有链接关系的所有相关词汇构造一个词汇图，图中的每一个节点代表相关词，每条弧代表了词汇之间注释与被注释的关系。利用超链接分析方法并结合PageRank算法，计算词汇的PageRank值，把PageRank值看成是体现词汇之间语义相似性的衡量指标，最后为每一个词汇生成候选同义词集，并通过一定的筛选原则和方法，推荐出最佳的同义词。第二部分是利用词汇定义模式，对词汇的释义方式进行分析，归纳总结出在词典释义中同义词出现的模式，进而利用模式匹配方法识别和挖掘同义词。此外，利用模式匹配方法对Web网页和期刊论文中的同义词也进行了挖掘测试。测试结果表明，利用模式匹配和超链接分析方法来自动识别和挖掘同义词具有可行性和实用性。 相似文献
42.
互联网上存在大量低质量甚至错误的信息,直接影响了互联网信息的使用和传播,通过实例对PageRank评价网页质量的可靠性及可行性进行了研究,并对使用PageRank评价网页质量时值得注意的问题进行了探讨。 相似文献
43.
基于关键词的搜索引擎优化策略及效果分析 总被引：2，自引：0，他引：2
介绍针对关键词的搜索引擎优化策略,结合某网站的优化研究实例,提出一系列评测标准,对搜索引擎优化效果进行跟踪评价.研究结果表明,这些优化策略有助于提高网站在用户使用特定关键词搜索的反馈结果中的排名,从而获得更高的访问量. 相似文献
44.
The paper attempts to provide an alternative method for measuring the importance of scientific papers based on the Google’s PageRank. The method is a meaningful extension of the common integer counting of citations and is then experimented for bringing PageRank to the citation analysis in a large citation network. It offers a more integrated picture of the publications’ influence in a specific field. We firstly calculate the PageRanks of scientific papers. The distributional characteristics and comparison with the traditionally used number of citations are then analyzed in detail. Furthermore, the PageRank is implemented in the evaluation of research influence for several countries in the field of Biochemistry and Molecular Biology during the time period of 2000–2005. Finally, some advantages of bringing PageRank to the citation analysis are concluded. 相似文献
45.
基于Web超链接分析对当前存在的主流算法PageRank与HITS作了研究.主要讨论了PageRank算法存在评价下滑与评价泄漏的缺陷;简略介绍了HITS算法在主题相关度方面存在的问题;对上述缺陷做出了修正并提出了改进方向. 相似文献
46.
本文以PageRank算法和HITS算法为例,对基于超链接分析技术的搜索引擎排序算法进行分析,并总结了超链接分析技术应用于搜索引擎结果排序的局限性。 相似文献
47.
Discovering author impact: A PageRank perspective 总被引：1，自引：0，他引：1
This article provides an alternative perspective for measuring author impact by applying PageRank algorithm to a coauthorship network. A weighted PageRank algorithm considering citation and coauthorship network topology is proposed. We test this algorithm under different damping factors by evaluating author impact in the informetrics research community. In addition, we also compare this weighted PageRank with the h-index, citation, and program committee (PC) membership of the International Society for Scientometrics and Informetrics (ISSI) conferences. Findings show that this weighted PageRank algorithm provides reliable results in measuring author impact. 相似文献
48.
基于网站链接分析的"211工程"高校排名实证研究 总被引：3，自引：0，他引：3
阐述基于网站链接分析的高校评价研究中存在的两点不足,即链接同等重要假设和数据不可靠性。然后设计一种可根据不同网站类型有侧重抓取的广度优先爬虫算法,抓取"211工程"高校网站作为研究样本。基于所得数据构成的社会网络,对社会网络分析中节点重要性测度的3种指标的排名效果进行实验,发现邻近度声望指标最优。并进一步引入PageRank思想,提出一种对邻近度声望指标进行改进的新指标UnivRank。实验结果表明,新指标的效果显著优于其他指标。 相似文献
49.
50.
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independently crawling the Web. A challenging task in such systems is to efficiently route user queries to peers that can deliver high quality results and be able to rank these returned results, thus satisfying the users’ information need. However, the problem inherent with this scenario is selecting a few promising peers out of an a priori unlimited number of peers. In recent research a rather strict notion of semantic overlay networks has been established. In most approaches, peers are connected to other peers based on a rigid semantic profile by clustering them based on their contents. In contrast, our strategy follows the spirit of peer autonomy and creates semantic overlay networks based on the notion of “peer-to-peer dating”. Peers are free to decide which connections they create and which they want to avoid based on various usefulness estimators. The proposed techniques can be easily integrated into existing systems as they require only small additional bandwidth consumption as most messages can be piggybacked onto established communication. We show how we can greatly benefit from these additional semantic relations during query routing in search engines, such as Minerva, and in the JXP algorithm, which computes the PageRank authority measure in a completely decentralized manner. 相似文献