Abstract
A hashing approach in parallel reducts is clearly presented in this paper. With the help of this new approach, time-consuming comparison operations reduce significantly, therefore, matrix of attribute significance can be calculated more efficiently. Experiments show that our method has advantage over PRMAS, our classical parallel reducts method. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
APA
Pei, M., Deng, D., & Huang, H. (2013). Parallel reducts: A hashing approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8171 LNAI, pp. 229–239). https://doi.org/10.1007/978-3-642-41299-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free