To avoid the curse of dimensionality, text categorization （TC） algorithms based on machine learning （ML） have to use an feature selection （FS） method to reduce the dimensionality of feature space. Although havin...To avoid the curse of dimensionality, text categorization （TC） algorithms based on machine learning （ML） have to use an feature selection （FS） method to reduce the dimensionality of feature space. Although having been widely used, FS process will generally cause information losing and then have much side-effect on the whole performance of TC algorithms. On the basis of the sparsity characteristic of text vectors, a new TC algorithm based on lazy feature selection （LFS） is presented. As a new type of embedded feature selection approach, the LFS method can greatly reduce the dimension of features without any information losing, which can improve both efficiency and performance of algorithms greatly. The experiments show the new algorithm can simultaneously achieve much higher both performance and efficiency than some of other classical TC algorithms.展开更多
文摘To avoid the curse of dimensionality, text categorization （TC） algorithms based on machine learning （ML） have to use an feature selection （FS） method to reduce the dimensionality of feature space. Although having been widely used, FS process will generally cause information losing and then have much side-effect on the whole performance of TC algorithms. On the basis of the sparsity characteristic of text vectors, a new TC algorithm based on lazy feature selection （LFS） is presented. As a new type of embedded feature selection approach, the LFS method can greatly reduce the dimension of features without any information losing, which can improve both efficiency and performance of algorithms greatly. The experiments show the new algorithm can simultaneously achieve much higher both performance and efficiency than some of other classical TC algorithms.
