检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:哈妮克孜·伊拉洪[1] 艾斯卡尔·艾木都拉[2] HANKIZ·Yilahun;ASKAR·Hamdulla(College of Mathematics and System Science,Xinjiang University,Urumqi 830046,China;Institute of Information Science and Engineering,Xinjiang University,Urumqi 830046,China)
机构地区:[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830046 [2]新疆大学信息科学与工程学院,新疆乌鲁木齐830046
出 处:《电视技术》2019年第21期9-14,共6页Video Engineering
摘 要:本体是一种重要的知识库,用来描述领域知识。彼此存在差异性的领域,其领域知识也呈现出差异性,而本体规模也会彼此迥异,可以视为一种相关性。本体中所覆盖的大量语义信息能够充分的支持信息检索系统的各种形式,同时也有助于语义网、信息抽取等技术应用实现新的突破。文章对从人工型、半自动型和自动型方面入手,构建的维吾尔语领域本体,详细总结和探讨了每个过程的成果,并提出了存在的问题和将来的挑战,为维吾尔语的信息处理,知识挖掘等方面将提供一定的科学基础。Ontology is an important knowledge base for describing domain knowledge.It has domain correlation,for different fields,the domain knowledge is different,and the scale of the ontology will also be different.The rich semantic information contained in the ontology can provide important support for research and related applications in areas such as question answering systems,information retrieval,semantic Web,and information extraction.Therefore,how to construct an ontology quickly and effectively has very important research significance.Researchers have proposed a large number of effective ontology construction methods from different perspectives.Generally,ontology construction methods are divided into three categories:manual construction,semi-automatic construction,and automatic construction.In this paper,we summarized and discussed about the results of each process of Uyghur domain ontology construction from these three aspects,and put forward the existing problems and future challenges.This research will provide a certain scientific basis in Uyghur information processing,knowledge mining,etc.,and has practical application value.
关 键 词:领域本体 人工构建 半自动构建 领域概念自动提取 概念间关系的自动提取
分 类 号:TN948[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.221.111