1. 西北师范大学计算机科学与工程学院,甘肃,兰州,730070
2. 桂林电子科技大学广西可信软件重点实验室,广西,桂林,541004
3. 广西师范大学广西多源信息挖掘与安全重点实验室,广西,桂林,541004
4. 华中师范大学计算机学院,湖北,武汉,430079
5. 西北师范大学计算机科学与工程学院,甘肃,兰州,730070
6. 桂林电子科技大学广西可信软件重点实验室,广西,桂林,541004
7. 广西师范大学广西多源信息挖掘与安全重点实验室,广西,桂林,541004
8. 华中师范大学计算机学院,湖北,武汉,430079
网络出版:2020-11-25,
纸质出版:2020
移动端阅览
脱婷, 马慧芳, 李志欣, 等. 熵权约束稀疏表示的短文本分类算法[J]. 电子学报, 2020,48(11):2131-2137.
TUO Ting, MA Hui-fang, LI Zhi-xin, et al. Effectively Classifying Short Texts by Entropy Weighted Constraints Sparse Representation[J]. Acta Electronica Sinica, 2020, 48(11): 2131-2137.
脱婷, 马慧芳, 李志欣, 等. 熵权约束稀疏表示的短文本分类算法[J]. 电子学报, 2020,48(11):2131-2137. DOI: 10.3969/j.issn.0372-2112.2020.11.006.
TUO Ting, MA Hui-fang, LI Zhi-xin, et al. Effectively Classifying Short Texts by Entropy Weighted Constraints Sparse Representation[J]. Acta Electronica Sinica, 2020, 48(11): 2131-2137. DOI: 10.3969/j.issn.0372-2112.2020.11.006.
针对短文本特征稀疏性问题,提出一种熵权约束稀疏表示的短文本分类方法.考虑到初始字典维数较高,首先,利用Word2vec工具将字典中的词表示成词向量形式,然后根据加权向量平均值对原始字典进行降维.其次,利用一种快速特征子集选择算法去除字典中不相关和冗余短文本,得到过滤后的字典.再次,基于稀疏表示理论在过滤后的字典上,为目标函数设计一种熵权约束的稀疏表示方法,引入拉格朗日乘数法求得目标函数的最优值,从而得到每个类的子空间.最后,在学习到的子空间下通过计算待分类短文本与每个类中短文本的距离,并根据三种分类规则对短文本进行分类.在真实数据集上的大量实验结果表明,本文提出的方法能够有效缓解短文本特征稀疏问题且优于现有短文本分类方法.
Aiming at the problem of short text feature sparsity
a short text sparse representation classification method based on entropy weighted constraint is proposed. Considering that the initial dictionary dimension is high
firstly
the word in the dictionary is represented as a word vector form via using the Word2vec tool
and then the original dictionary is reduced according to the average weighted vectors. Secondly
a fast feature subset selection algorithm is adopted to remove the irrelevant and redundant short texts in the dictionary
and the filtered dictionary can then be obtained. Thirdly
based on the sparse representation theory
an improved entropy-weighted sparse representation method is designed for the objective function
and the Lagrange multiplier method is introduced to obtain the optimal value of the objective function
thus the subspace of each class is obtained. Finally
the distance between the short text to be classified and the short text in each class is calculated under the subspace
and the short text is classified according to three classification rules. A large number of experimental results on real data sets show that the proposed method can effectively alleviate the short text feature sparse problem and exhibits better performance than the existing short text classification methods.
0
浏览量
41
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621