id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_zmmy4lrbq5dwvnclwn42myragq	W CHEN	An efficient bit-based feature selection method	2008	12	.pdf	application/pdf	8729	1185	79	paper proposes a bit-based feature selection method to find the smallest feature set to represent the indexes of a given dataset. experimental results on different data sets also show the efficiency and accuracy of the proposed approach. Keywords: Feature selection; Bitmap indexing; Rough set; Classification; Clustering approaches have been proposed to solve the feature selection problem (Almullim et al., 1991; Chen, Tseng, Chen, selection approach, called the bitmap-based feature selection method with discernibility matrix (Chen, Yang, & Step 1: Return CVjk. Definition 3 (Feature-value vector). the number of possible values in Cj. For example, the feature matrix M1 in Table 2 is show as From the definition of the feature matrix, it is easily derived that applying the bitwise operator ''OR'' on all the record vectors in a A record vector RV sjk of a feature set value C kth possible value of the feature set Csj. A class vector,	./cache/work_zmmy4lrbq5dwvnclwn42myragq.pdf	./txt/work_zmmy4lrbq5dwvnclwn42myragq.txt