Term Filtering with Bounded Error

Abstract--In this paper, we consider a novel problem referred to as term filtering with bounded error to reduce the term (feature) space by eliminating terms without (or with bounded) information loss. Different from existing works, the obtained term space provides a complete view of the original term space. More interestingly, several important questions can be answered such as: 1) how different terms interact with each other and 2) how the filtered terms can be represented by the other terms. We perform a theoretical investigation of the term filtering problem and link it to the Geometric Covering By Discs problem, and prove its NP-hardness. We present two novel approaches for both lossless and lossy term filtering with bounds on the introduced error. Experimental results on multiple text mining tasks validate the effectiveness of the proposed approaches.

• Type: Journal
• Year: 2010
• Where: ICDM
• Authors: Zi Yang, Wei Li, Jie Tang, Juanzi Li
• Keywords: Data Mining, ICDM 2010, Obtained Term Space, Term Filtering Problem, Term Space