Balancing between over-weighting and under-weighting in supervised term weighting. Issue 2 (March 2017)

• Record Type: Journal Article
• Authors: Wu, Haibing; Gu, Xiaodong; Gu, Yiwei
• Is Part Of: Information processing & management. Volume 53:Issue 2(2017:Mar.)
• Page Start: 547
• Page End: 557
• Publication Date: 2017-03
• Subjects: Text categorization -- Supervised term weighting -- Over-weighting; Information storage and retrieval systems -- Periodicals; Information science -- Periodicals; Systèmes d'information -- Périodiques; Sciences de l'information -- Périodiques; Information science; Information storage and retrieval systems; Periodicals; 658.4038
• DOI: 10.1016/j.ipm.2016.10.003
• Languages: English
• ISSNs: 0306-4573

Abstract

Highlights: Show the importance of the trade-off between over-weighting and under-weighting. Propose a revision of add-one smoothing on delta smoothed idf ( dsidf ). Present three regularization techniques to reduce over-weighting. Propose a new supervised term weighting scheme, regularized entropy ( re ). Abstract: Supervised term weighting could improve the performance of text categorization. A way proven to be effective is to assign larger weight to terms with more imbalanced distributions across categories. This paper shows that supervised term weighting should not just assign large weights to imbalanced terms, but should also control the trade-off between over-weighting and under-weighting. Over-weighting, a new concept proposed in this paper, is caused by the improper handling of singular terms and too large ratios between term weights. To prevent over-weighting, we present three regularization techniques: add-one smoothing, sublinear scaling and bias term. Add-one smoothing is used to handle singular terms. Sublinear scaling and bias term shrink the ratios between term weights. However, if sublinear functions scale down term weights too much, or the bias term is too large, under-weighting would occur and harm the performance. It is therefore critical to balance between over-weighting and under-weighting. Inspired by this insight, we also propose a new supervised term weighting scheme, regularized entropy ( re ). Our re employs entropy to measure term distribution, and introduces the bias term to control over-weighting and under-weighting. Empirical evaluations on topical and sentiment classification datasets indicate that sublinear scaling and bias term greatly influence the performance of supervised term weighting, and our re enjoys the best results in comparison with existing schemes.