检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中南大学学报(自然科学版)》2013年第S2期351-354,共4页Journal of Central South University:Science and Technology
基 金:创新方法工作专项项目(2011IM010300;2012IM010300)
摘 要:提出一种基于概念对的语义特征和语境特征的特征向量来验证概念之间是否具有上下位关系的方法。从概念对的构词、共现、特征词出现数量、概念对在句中位置的距离出发,构建概念对上下位关系的特征向量,并使用支持向量机(SVM)进行训练和预测,从而实现本体关系的抽取。A new method based on feature vectors of semantic and context features to verify whether a pair of concepts has the hyponymy relation was represented.Based on word formation,the co-occurrence of concepts,the number of feature words and the location of concepts,feature vectors of hyponymy were built.Support vector machines(SVM) were used to train and predict data,and the relation extraction of ontology concepts was finally achieved.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38