A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket[J]. 2018, 52(10): 141-145.
DOI:
A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket[J]. 2018, 52(10): 141-145.DOI: 10.7652/xjtuxb201810019.
A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket
To solve the problem that redundancy or irrelevant features in high-dimensional datasets reduce the classification accuracy of machine learning model
a feature selection algorithm based on approximate Markov blanket is proposed and named as normal max-relevance and min-redundancy(nmRMR)algorithm. Firstly
the algorithm uses the criteria of maximum relevance and minimum redundancy to perform feature relevance ranking. Then
it adopts the approximate Markov blanket to remove redundant features or irrelevant features
and maximize the correlation between features to obtain the optimal feature subset. Experimental results on UCI's eight open datasets show that: the proposed nmRMR algorithm achieves on average 6.875
20.56 and 3.187 5 reduction in the selected number of feature subsets
as well as 0.78%
1.88% and 0.825% improvement in the average classification accuracy
compared with the mRMR algorithm
the FullSet algorithm
and the FCBF algorithm
respectively. It is concluded that the proposed nmRMR algorithm is superior to other algorithms.
关键词
Keywords
references
BENNASAR M, HICKS Y, SETCHI R. Feature selection using joint mutual information maximisation [J]. Expert Systems with Applications, 2015, 42(22): 8520-8532.
ZHANG Y, ZHANG Z. Feature subset selection with cumulate conditional mutual information minimization [J]. Expert Systems with Applications, 2012, 39(5): 6078-6088.
LIU Chuan, WANG Wenyong, ZHAO Qiang, et al. A new feature selection method based on a validity index of feature subset [J]. Pattern Recognition Letters, 2017, 92: 1-8.
SUN Xin, LIU Yanheng, LI Jin, et al. Feature evaluation and selection with cooperative game theory [J]. Pattern Recognition, 2012, 45(8): 2992-3002.
PENG H, LONG F, DING C. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy [J]. IEEE Transactions Pattern Analysis and Machine Intelligence, 2005, 27(8): 1226-1238.
ZHOU P, HU X, LI P, et al. Online feature selection for high-dimensional class-imbalanced data [J]. Knowledge-Based Systems, 2017, 136(15): 187-199.
GUO Q, ZHANG M. Implement web learning environment based on data mining [J]. Knowledge-Based Systems, 2009, 22(6): 439-442.
WANG Y, WANG J, LIAO H, et al. An efficient semi-supervised representatives feature selection algorithm based on information theory [J]. Pattern Recognition, 2017, 61(1): 511-523.
KWAK N, CHOI C H. Input feature selection for classification problems [J]. IEEE Transactions on Neural Networks, 2002, 13(1): 143-159.
KOLLER D, SAHAMI M. Toward optimal feature selection [C]∥Proceedings of the 13th International Conference on International Conference on Machine Learning. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1996: 284-292.
CUI Zifeng, XU Baowen, ZHANG Weifeng, et al. An approximate Markov blanket feature selection algorithm [J]. Chinese Journal of Computers, 2007, 30(12): 2074-2081.
KURGAN L A, CIOS K J. CAIM discretization algorithm [J]. IEEE Transactions on Knowledge Data Engineering, 2004, 16(2): 145-153.
RISH I. An empirical study of the naive Bayes classifier [J]. Journal of Universal Computer Science, 2001, 1(2): 127: 41-46.
BERMEJO P, OSSA L D L, GAMEZ J A, et al. Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking [J]. Knowledge-Based Systems, 2012, 25(1): 35-44.
GOMEZ-VERDEJO V, VERLEYSEN M, FLEURY J. Information-theoretic feature selection for functional data classification [J]. Neurocomputing, 2009, 72(16/17/18): 3580-3589.