Using Bayesian posterior probability in confidence of attributes for feature selection Online publication date: Sun, 05-Jul-2015
by Inkyoo Park; Jongjin Park; Gyooseok Choi
International Journal of Security and Networks (IJSN), Vol. 10, No. 2, 2015
Abstract: Rough set theory is an efficient reduction technique to deal with vagueness and uncertainty. Many studies have been accomplished for the feature selection while they have been carried out to trade off the sophisticated process of feature selection algorithm against the robustness and accuracy of reducts. In this paper, a new Bayesian posterior probability-based QuickReduct (BPPQR) measure is introduced to determine the optimal attributes with the accurate strength of the association among the indiscernible subsets. Therefore, a new rough entropy-based QuickReduct algorithm which focuses on the reduction of redundant attributes is proposed in order to extract the optimal reduct and the core. The performance of the system is evaluated in MATLAB on several benchmark datasets with resides in UCI machine learning repository. The proposed heuristic approach can cope with the drawbacks of the conventional one, and the satisfying performances have been carried out in the process of feature selection in decision systems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook