AUTOMATIC PATENT DOCUMFNT SUMMARIZATION FOR COLLABORATIVE KNOWLEDGE SYSTEMS AND SERVICES

Engineering and research teams often develop new products and technologies by referring to inventions described in patent databases. Efficient patent analysis builds R&D knowledge, reduces new product development time, increases market success, and reduces potential patent infringement. Thus, it is beneficial to automatically and systematically extract information from patent documents in order to improve knowledge sharing and collaboration among R&D team members. In this research, patents are summarized using a combined ontology based and TF-IDF concept clustering approach. The ontology captures the general knowledge and core meaning of patents in a given domain. Then, the proposed methodology extracts, clusters, and integrates the content of a patent to derive a summary and a cluster tree diagram of key terms. Patents from the International Patent Classification (IPC) codes B25C, B25D, B25F (categories for power hand tools) and B24B, C09G and H011 (categories for chemical mechanical polishing) are used as case studies to evaluate the compression ratio, retention ratio, and classification accuracy of the summarization results. The evaluation uses statistics to represent the summary generation and its compression ratio, the ontology based keyword extraction retention ratio, and the summary classification accuracy. The results show that the ontology based approach yields about the same compression ratio as previous non-ontology based research but yields on average an 11% improvement for the retention ratio and a 14% improvement for classification accuracy.     

Expert discovery and knowledge mining in complex multi-agent systems

Complex problem solving requires diverse expertise and multiple techniques. In order to solve such problems, complex multi-agent systems that include both of human experts and autonomous agents are required in many application domains. Most complex multi-agent systems work in open domains and include various heterogeneous agents. Due to the heterogeneity of agents and dynamic features of working environments, expertise and capabilities of agents might not be well estimated and presented in these systems. Therefore, how to discover useful knowledge from human and autonomous experts, make more accurate estimation for experts＇ capabilities and find out suitable expert（s） to solve incoming problems （＂Expert Mining＂） are important research issues in the area of multi-agent system. In this paper, we introduce an ontology-based approach for knowledge and expert mining in hybrid multi-agent systems. In this research, ontologies are hired to describe knowledge of the system. Knowledge and expert mining processes are executed as the system handles incoming problems. In this approach, we embed more self-learning and self-adjusting abilities in multi-agent systems, so as to help in discovering knowledge of heterogeneous experts of multi-agent systems.     

多模态公文的结构知识抽取与组织研究

针对目前基于三元组知识构建的知识图谱结构逻辑性弱、难以形成知识体系的问题, 以公文应用背景为牵引, 提出多模态知识结构要素抽取模型, 构建多模态公文文档数据集GovDoc-CN, 在文本和图像两个模态对文档中包括各级标题、摘要、作者、成文时间、文档编号等在内的知识结构要素进行抽取。设计文档结构树模型对抽取的文档知识结构要素进行组织, 并构建结构化图网络实现文档的组织和管理。实验证明, 相较于单一模态的抽取模型, 多模态知识结构要素抽取模型取得了明显的效果提升, 文档结构树模型和基于文档结构树模型构建的结构化图网络为文档知识的组织与管理提供了一种新途径, 具有重要的应用价值。     

基于分类和关键词组抽取的信息检索算法

本文提出一种基于分类和关键词组抽取的信息检索算法。该算法利用文本分类和信息抽取技术辅助检索，避免了向量空间模型算法中时间复杂度过大，查准率不高的缺点。针对传统的信息检索性能指标无法有效地衡量检索结果的排序状况，本文还引入了排序误差率概念用于评价检索结果的排序。实验结果表明，所提算法与TFIDF算法、基于分类的交互式检索算法相比，具有更快的查询速度，更高的查准率和更小的排序误差率。