An effective algorithm for computing reducts in decision tables
Số trang: 16
Loại file: pdf
Dung lượng: 767.58 KB
Lượt xem: 12
Lượt tải: 0
Xem trước 2 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Attribute reduction is one important part researched in rough set theory. A reduct from a decision table is a minimal subset of the conditional attributes which provide the same information for classification purposes as the entire set of available attributes.
Nội dung trích xuất từ tài liệu:
An effective algorithm for computing reducts in decision tables
Nội dung trích xuất từ tài liệu:
An effective algorithm for computing reducts in decision tables
Tìm kiếm theo từ khóa liên quan:
Computer science and cybernetics Feature selection Attribute reduction Attribute clustering Normalized Variation of Information Rough setGợi ý tài liệu liên quan:
-
28 trang 32 0 0
-
Adaptive fast nonsingular terminal sliding mode control for manipulator robot
10 trang 29 0 0 -
Revisiting some fuzzy algebraic structures
16 trang 28 0 0 -
Using combinatorial maps for algorithms on graphs
16 trang 28 0 0 -
Automatic identification of some Vietnamese folk songs Cheo and Quanho using deep neural networks
21 trang 27 0 0 -
Developing a volume forecasting model
40 trang 25 0 0 -
The role of annotated logics in AI: A review
14 trang 24 0 0 -
Adapt TTS: High quality zero shot multi-speaker text to speech adaptive based for Vietnamese
15 trang 23 0 0 -
81 trang 21 0 0
-
Evolutionary algorithm for task offloading in vehicular fog computing
18 trang 21 0 0