To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based...To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm.展开更多
开集分类识别是近10多年来模式识别领域研究的热点,它能够识别训练集中已知类别的测试样本,同时还能够有效“拒识”未知类别的测试样本;这些未知类别样本不包含在训练集中。现有的开集分类识别算法主要是基于Support Vector Machine(SVM...开集分类识别是近10多年来模式识别领域研究的热点,它能够识别训练集中已知类别的测试样本,同时还能够有效“拒识”未知类别的测试样本;这些未知类别样本不包含在训练集中。现有的开集分类识别算法主要是基于Support Vector Machine(SVM)和深度学习网络框架进行改进,并且主要应用在自然景物图像领域中;在光谱分析领域中还鲜有报道。将传统的闭集框架下的模糊推理分类器进行模型改进,提出了开集框架下的改进模糊推理分类器,并将其应用到木材树种近红外光谱分类识别中。首先,使用Flame-NIR近红外微型光谱仪采集木材样本横切面的近红外光谱曲线,采用Metric Learning算法进行光谱向量维度约简降维至4维(4D)。其次,改进闭集框架下的模糊推理分类器,根据模糊规则置信度和各维度隶属度概率的乘积构建Generalized Basic Probability Assignment(GBPA),再根据GBPA进行分类处理。在20个树种的具有不同的Openness指标下的近红外光谱数据集的分类识别对比实验表明,改进的开集模糊推理分类器(fuzzy reasoning classifier in an open set,FRCOS)优于现有的基于机器学习和深度学习的开集分类识别主流算法,具有较好的评价指标F-Score,Kappa系数及总体识别率。展开更多
基金Project(50474033)supported by the National Natural Science Foundation of China
文摘To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm.
文摘开集分类识别是近10多年来模式识别领域研究的热点,它能够识别训练集中已知类别的测试样本,同时还能够有效“拒识”未知类别的测试样本;这些未知类别样本不包含在训练集中。现有的开集分类识别算法主要是基于Support Vector Machine(SVM)和深度学习网络框架进行改进,并且主要应用在自然景物图像领域中;在光谱分析领域中还鲜有报道。将传统的闭集框架下的模糊推理分类器进行模型改进,提出了开集框架下的改进模糊推理分类器,并将其应用到木材树种近红外光谱分类识别中。首先,使用Flame-NIR近红外微型光谱仪采集木材样本横切面的近红外光谱曲线,采用Metric Learning算法进行光谱向量维度约简降维至4维(4D)。其次,改进闭集框架下的模糊推理分类器,根据模糊规则置信度和各维度隶属度概率的乘积构建Generalized Basic Probability Assignment(GBPA),再根据GBPA进行分类处理。在20个树种的具有不同的Openness指标下的近红外光谱数据集的分类识别对比实验表明,改进的开集模糊推理分类器(fuzzy reasoning classifier in an open set,FRCOS)优于现有的基于机器学习和深度学习的开集分类识别主流算法,具有较好的评价指标F-Score,Kappa系数及总体识别率。
基金Supported by the National Natural Science Foundation of China under Grant No.60135010 (国家自然科学基金) the National Grand Fundamental Research 973 Program of China under Grant No.G1998030509 (国家重点基础研究发展规划(973))
