Transactions on Rough Sets III
From MaRDI portal
Publication:5465691
DOI10.1007/b136502zbMath1117.68071OpenAlexW2139531029MaRDI QIDQ5465691
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136502
Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (14)
Decision trees with minimum average depth for sorting eight elements ⋮ Diagnosis of three types of constant faults in read-once contact networks over finite bases ⋮ Diagnosis of constant faults in iteration-free circuits over monotone basis ⋮ Totally optimal decision trees for Boolean functions ⋮ Rudiments of rough sets ⋮ Rough analysis of computation trees ⋮ Time and space complexity of deterministic and nondeterministic decision trees ⋮ On the class of restricted linear information systems ⋮ On graphs of the cone decompositions for the min-cut and max-cut problems ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ On the relation between rough set reducts and typical testors ⋮ Decision trees based on 1-consequences ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Diagnosis of constant faults in read-once contact networks over finite bases
This page was built for publication: Transactions on Rough Sets III
