首页> 外文学位 >Concept matching in informal node-link knowledge representations.
【24h】

Concept matching in informal node-link knowledge representations.

机译:非正式节点链接知识表示中的概念匹配。

获取原文
获取原文并翻译 | 示例

摘要

Information stored by managed organizations in free text documents, databases, and engineered knowledge repositories can often be processed as networks of conceptual nodes and relational links (concept graphs). However, these models tend to be informal as related to new or multi-source tasks. This work contributes to the understanding of techniques for matching knowledge elements: in informal node-link knowledge representations, drawn from existing data resources, to support user-guided analysis. Its guiding focus is the creation of tools that compare, retrieve, and merge existing information resources.; Three essays explore important algorithmic and heuristic elements needed to leverage concept graphs in real-world applications. Section 2 documents an algorithm which identifies likely matches between student and instructor concept maps aiming to support semi-automatic matching and scoring for both classroom and unsupervised environments. The knowledge-anchoring, similarity flooding algorithm significantly improves on term-based matching by leveraging map structure and also has potential as a methodology for combining other informal, human-created knowledge representations. Section 3 describes a decompositional tagging approach to organizing (aggregating) automatically extracted biomedical pathway relations. We propose a five-level aggregation strategy for extracted relations and measure the effectiveness of the BioAggregate tagger in preparing extracted information for analysis and visualization. Section 4 evaluates an importance flooding algorithm designed to assist law enforcement investigators in identifying useful investigational leads. While association networks have a long history as an investigational tool, more systematic processes are needed to guide development of high volume cross jurisdictional data sharing initiatives. We test path-based selection heuristics and importance flooding to improve on traditional association-closeness methodologies.; Together, these essays demonstrate how structural and semantic information can be processed in parallel to effectively leverage ambiguous network representations of data. Also, they show that real applications can be addressed by processing available data using an informal concept graph paradigm. This approach and these techniques are potentially useful for workflow systems, business intelligence analysis, and other knowledge management applications where information can be represented in an informal conceptual network and that information needs to be analyzed and converted into actionable, communicable human knowledge.
机译:被管理组织存储在自由文本文档,数据库和工程知识库中的信息通常可以作为概念节点和关系链接(概念图)的网络来处理。但是,这些模型往往是非正式的,与新的或多源任务有关。这项工作有助于理解知识元素的匹配技术:在非正式的节点链接知识表示中,从现有数据资源中提取知识,以支持用户指导的分析。其指导重点是创建用于比较,检索和合并现有信息资源的工具。三篇文章探讨了在实际应用中利用概念图所需的重要算法和启发式元素。第2节介绍了一种算法,该算法识别学生和教师概念图之间的可能匹配,旨在为教室和无人值守的环境提供半自动匹配和评分。知识锚定,相似性泛滥算法通过利用地图结构显着改进了基于术语的匹配,并且还具有作为组合其他非正式的,人工创建的知识表示的方法的潜力。第3节介绍了一种分解标记方法,用于组织(汇总)自动提取的生物医学途径关系。我们提出了一种用于提取关系的五级聚合策略,并测量了BioAggregate标签器在准备用于分析和可视化的提取信息中的有效性。第4节评估了重要性泛洪算法,该算法旨在协助执法调查人员识别有用的研究线索。尽管协会网络作为研究工具已有很长的历史,但仍需要更多系统的过程来指导开发大量跨辖区数据共享计划。我们测试基于路径的选择启发式方法和重要性泛滥,以改进传统的关联-紧密度方法。这些文章共同说明了如何并行处理结构和语义信息,以有效利用数据的模糊网络表示形式。而且,它们表明,可以通过使用非正式概念图范例处理可用数据来解决实际应用程序。这种方法和这些技术可能对工作流系统,商业智能分析和其他知识管理应用程序有用,在这些应用程序中,信息可以在非正式的概念网络中表示,并且需要对信息进行分析并将其转换为可操作的,可交流的人类知识。

著录项

  • 作者

    Marshall, Byron Bennett.;

  • 作者单位

    The University of Arizona.;

  • 授予单位 The University of Arizona.;
  • 学科 Business Administration Management.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 149 p.
  • 总页数 149
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 贸易经济;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号