A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Machine Learning and Cybernetics"
DOI: 10.1007/s13042-019-00933-6
Abstract: Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates… read more here.
Keywords: cover problem; minimal elements; vertex cover; discernibility matrix ... See more keywords
Fuzzy rough discrimination and label weighting for multi-label feature selection
Sign Up to like & getrecommendations! Published in 2021 at "Neurocomputing"
DOI: 10.1016/j.neucom.2021.09.007
Abstract: Abstract Fuzzy rough set is a theoretical framework of fuzzy uncertainty management, and discernibility matrix offers a mathematical foundation for algorithm construction of feature learning. The approaches of fuzzy rough set and discernibility matrix have… read more here.
Keywords: fuzzy rough; label; multi label; discernibility matrix ... See more keywords
Minimal Element Selection in the Discernibility Matrix for Attribute Reduction
Sign Up to like & getrecommendations! Published in 2019 at "Chinese Journal of Electronics"
DOI: 10.1049/cje.2018.06.018
Abstract: Discernibility matrix is a beautiful theoretical result to get reducts in the rough set, but the existing algorithms based on discernibility matrix share the same problem of heavy computing load and large store space, since… read more here.
Keywords: discernibility matrix; minimal element; element selection; discernibility ... See more keywords