树增强朴素贝叶斯(TAN)分类器在模型的复杂性和分类精度之间实现较好折衷,成为当前分类器学习的一个研究热点.为了提高 TAN 分类器的分类准确率,本文提出一种基于 KL 距离的 TAN 分类器判别性学习方法.首先用 EAR 方法学习 TAN 分类器...树增强朴素贝叶斯(TAN)分类器在模型的复杂性和分类精度之间实现较好折衷,成为当前分类器学习的一个研究热点.为了提高 TAN 分类器的分类准确率,本文提出一种基于 KL 距离的 TAN 分类器判别性学习方法.首先用 EAR 方法学习 TAN 分类器的结构,然后用基于 KL 距离的目标函数优化 TAN 的参数.在标准数据集上的实验结果表明,用该方法学习的 TAN 分类器具有较高的分类精度.展开更多
Multi-label data with high dimensionality often occurs,which will produce large time and energy overheads when directly used in classification tasks.To solve this problem,a novel algorithm called multi-label dimension...Multi-label data with high dimensionality often occurs,which will produce large time and energy overheads when directly used in classification tasks.To solve this problem,a novel algorithm called multi-label dimensionality reduction via semi-supervised discriminant analysis(MSDA) was proposed.It was expected to derive an objective discriminant function as smooth as possible on the data manifold by multi-label learning and semi-supervised learning.By virtue of the latent imformation,which was provided by the graph weighted matrix of sample attributes and the similarity correlation matrix of partial sample labels,MSDA readily made the separability between different classes achieve maximization and estimated the intrinsic geometric structure in the lower manifold space by employing unlabeled data.Extensive experimental results on several real multi-label datasets show that after dimensionality reduction using MSDA,the average classification accuracy is about 9.71% higher than that of other algorithms,and several evaluation metrices like Hamming-loss are also superior to those of other dimensionality reduction methods.展开更多
文摘树增强朴素贝叶斯(TAN)分类器在模型的复杂性和分类精度之间实现较好折衷,成为当前分类器学习的一个研究热点.为了提高 TAN 分类器的分类准确率,本文提出一种基于 KL 距离的 TAN 分类器判别性学习方法.首先用 EAR 方法学习 TAN 分类器的结构,然后用基于 KL 距离的目标函数优化 TAN 的参数.在标准数据集上的实验结果表明,用该方法学习的 TAN 分类器具有较高的分类精度.
基金Project(60425310) supported by the National Science Fund for Distinguished Young ScholarsProject(10JJ6094) supported by the Hunan Provincial Natural Foundation of China
文摘Multi-label data with high dimensionality often occurs,which will produce large time and energy overheads when directly used in classification tasks.To solve this problem,a novel algorithm called multi-label dimensionality reduction via semi-supervised discriminant analysis(MSDA) was proposed.It was expected to derive an objective discriminant function as smooth as possible on the data manifold by multi-label learning and semi-supervised learning.By virtue of the latent imformation,which was provided by the graph weighted matrix of sample attributes and the similarity correlation matrix of partial sample labels,MSDA readily made the separability between different classes achieve maximization and estimated the intrinsic geometric structure in the lower manifold space by employing unlabeled data.Extensive experimental results on several real multi-label datasets show that after dimensionality reduction using MSDA,the average classification accuracy is about 9.71% higher than that of other algorithms,and several evaluation metrices like Hamming-loss are also superior to those of other dimensionality reduction methods.