基于商空间理论的海量信息检索模型的分析-analysis of massive information retrieval model based on quotient space theory.docx

基于商空间理论的海量信息检索模型的分析-analysis of massive information retrieval model based on quotient space theory.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
基于商空间理论的海量信息检索模型的分析-analysis of massive information retrieval model based on quotient space theory

information space, by using a hierarchical stepwise refinement method. With the method of reducing retrieval field greatly, hierarchical information retrieval can solve the problems of massive information resource effectively.To establishing the hierarchical structure information resource, the method of hierarchical structure creating, and the algorithm of multi-granularity document granulation are investigated. Using Agent technology and clustering technology, the dissertation proposed two methods to create hierarchy structure, and gave an ontology-based representation and storage method. Then, based on this hierarchy structure, equivalence relation and equivalence class are defined to establish quotient space of information resource and get the algorithm of document granularity. As the document granulation is strictly based on equivalence relations and equivalence classes in the process of creating quotient space, the hierarchical information database meets the Guaranteed False Principle of quotient space theory, which laid the data foundation for hierarchical information retrieval.To solve the classification problem about massive document, the classification method for massive multi-class document is investigated from two aspects such as training speed and multi-classification problems. Firstly, based on the analysis of the traditional multi-class SVM, we used genetic algorithm to solve the code problem of the ECC-SVM, and a new efficient ECC-SVM based on genetic algorithms is proposed. Then, to solve the problem of SVM training speed for large-scale sample set, the reduction method for SVM training samples under the original sample space is proposed. A new distance measure called distance of k-nearest neighbors(k-DNN) is presented, and corresponding distance between/within classes is defined according to k-DNN, and the methods of noise identification and samples importance evaluation are proposed, and the algorithm of reduction SVM training samples is proposed.

您可能关注的文档

文档评论(0)

peili2018 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档