Decision list

Known as: Decision lists 
Decision lists are a representation for Boolean functions. Single term decision lists are more expressive than disjunctions and conjunctions; however… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The paper presents an algorithm for induction of de cision list from survival data. The algorithm uses a urvival tree as the… (More)
  • table 1
Is this relevant?
2009
2009
This paper proposes the first complete soft-decision list decoding algorithm for Hermitian codes based on the Koetter-Vardy's… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes offering both complexity and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Review
2003
Review
2003
This work surveys well-known approaches to building decisi on l sts. Some novel variations to strategies based on default rules… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2002
2002
We introduce a new learning algorithm for decision lists to allow features that are constructed from the data and to allow a… (More)
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
We demonstrate a problem with the standard technique for learning probabilistic decision lists. We describe a simple, incremental… (More)
  • figure 2
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The most effective paradigm for word sense disambiguation, supervised learning, seems to be stuck because of the knowledge… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We investigate the problem of learning Boolean functions with a short DNF representation using decision trees as a concept… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 8
  • table 9
Is this relevant?