Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
From MaRDI portal
Publication:1198056
DOI10.1016/0020-0190(92)90237-PzbMath0773.68059MaRDI QIDQ1198056
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
Related Items
A syntactic characterization of bounded-rank decision trees in terms of decision lists, A subexponential exact learning algorithm for DNF using equivalence queries, Learning DNF in time \(2^{\widetilde O(n^{1/3})}\), On PAC learning algorithms for rich Boolean function classes, Extremal properties of polynomial threshold functions
Cites Work