Using clustering and dynamic mutual information for topic feature selection
Source abstract
Abstract
Abstract A good feature selection method should take into account both category information and high‐frequency information to select useful features that can effectively display the information of a target. Because basic mutual information (BMI) prefers low‐frequency features and ignores high‐frequency features, clustering mutual information is proposed, which is based on clustering and makes effective high‐frequency features become unique, better integrating category information and useful high‐frequency information. Time is an important factor in topic detection and tracking (TDT). In order to improve the performance of TDT, time difference is integrated into clustering mutual information to dynamically adjust the mutual information, and then another algorithm called the dynamic clustering mutual information (DCMI) is given. In order to obtain the optimal subsets to display topics information, an objective function is proposed, which is based on the idea that a good feature subset should have the smallest distance within‐class and the largest distance across‐class. Experiments on TDT4 corpora using this objective function are performed; then, comparing the performances of BMI, DCMI, and the only existed topic feature selection algorithm Incremental Term Frequency‐Inverted Document Frequency (ITF‐IDF), these performance information will be displayed by four figures. Computation time of DCMI is previously lower than BMI and ITF‐IDF. The optimal normalized‐detection performance (Cdet)norm of DCMI is decreased by 0.3044 and 0.0970 compared with those of BMI and ITF‐IDF, respectively.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Face and Expression Recognition · Text and Document Classification Technologies · Advanced Clustering Algorithms Research
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
College of Management Hebei University Baoding 071002 China
Department of Information Engineering Hebei Software Institute Baoding 071000 China
Department of Information Management The Central Institute for Correctional Police Baoding 071000 China
Funding
Science Foundation of HeBei Province
References (27)
Show source-provided references
1. Summary of feature selection algorithms [J]
2. Liu H. W. · 2010
3. 10.1162/15324430332275367010.1162/153244303322753670 ↗
4. Benchmarking attribute selection techniques for discrete class data mining [J]
5. Y.YangandJ. O.Pedersen “A comparative study on feature selection in text categorization [C] ” Proceedings of the 14th International Conference on Machine Learning Nashville US (1997) 412‐420.
6. H.Liuet al. “Feature selection using mutual information: An experimental study ” The 10th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2008) (2008): 235‐246.10.1007/978-3-540-89197-0_24 ↗
7. 10.3724/SP.J.1001.2008.0008210.3724/SP.J.1001.2008.00082 ↗
8. Improved feature selection method [J]
9. 10.1007/s10489-006-0020-410.1007/s10489-006-0020-4 ↗
10. 10.1016/j.artmed.2005.06.00210.1016/j.artmed.2005.06.002 ↗
11. 10.1016/j.artmed.2007.09.00410.1016/j.artmed.2007.09.004 ↗
12. 10.1016/j.jbi.2009.08.01010.1016/j.jbi.2009.08.010 ↗
13. 10.3724/SP.J.1001.2012.0404510.3724/SP.J.1001.2012.04045 ↗
14. T.Brantset al. “A system for new event detection [C] ” The 26th annual international ACM SIGIR conference on Research and development in information retrieval (2003): 330‐337.10.1145/860435.860495 ↗
15. C. L.Wayne “Multilingual topic detection and tracking: Successful research enabled by corpora and evaluation [C] ” In Proceedings of the Language Resources and Evaluation Conference (LREC) 2000 487‐494 (2000).
16. Topic tracking with Bayesian belief network [J]
17. C.Wanget al. “Adaptive topic tracking on Dirichlet process mixture model [C] ” Natural Language Processing and Chinese Computing First CCF Conference (2012) pp. 237‐248.10.1007/978-3-642-34456-5_22 ↗
18. K.Kaur “Topic tracking techniques for natural language processing [C] ” ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence (2011): 65‐71.10.1145/2007052.2007066 ↗
19. 10.1016/S0004-3702(03)00079-110.1016/S0004-3702(03)00079-1 ↗
20. 10.1137/10080200110.1137/100802001 ↗
21. Classification algorithm of l2 norm LS‐SVM via coordinate descent [J]
22. Vector‐space‐model text categorization method based on quotient space theory [J]
23. 10.1109/72.29822410.1109/72.298224 ↗
24. Yang Y. M. · 1997 · 412
25. C. H.BongandK.Narayanan “An empirical study of feature selection for text categorization based on term weight [C] ” In Proceeding of the IEEE/WIC/ACM Int'l Conf. on Web Intelligence (WI 2004) Beijing: IEEE Computer Society Press (2004). 599. 602.http://www.comp.hkbu.edu.hk/IAT04/.
26. The Linguistic Data Consortium(LDC) “TDT corpora [Z] ” (2005).https://catalog.ldc.upenn.edu/LDC2001T58.
27. The National Institute of Standards and Technology (NIST) “The 2005 Topic Detection and Tracking (TDT2005) Task Definition and Evaluation Plan [Z] ” (2005). ftp://jauar.ncsl.nist.gov//tdt/tdt2005/.eval.Plan.vllps.