Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations

Broader (2)

Artificial intelligenceMachine learning
Conjunctive normal formDecision treeDecision tree learningDisjunctive normal form

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
HColonies: a new hybrid metaheuristic for medical data classification
Medical data feature a number of characteristics that make their classification a complex task. Yet, the societal significance of… 
2013
2013
On the Isomorphism Problem for Decision Trees and Decision Lists
We study the complexity of isomorphism testing for boolean functions that are represented by decision trees or decision lists… 
2010
2010
A Hybrid Approach to Predict Churn
Acquiring new customers in any business is much more expensive than trying to keep the existing ones. As a result, many… 
Highly Cited
2007
Highly Cited
2007
Aggregation of web search engines based on users' preferences in WebFusion
2002
2002
On the computational power of Boolean decision lists
Abstract.We study the computational power of decision lists over AND-functions versus $$ \hbox{threshold-}\oplus $$ circuits. AND… 
2002
2002
Syntactic Features for High Precision Word Sense Disambiguation
This paper explores the contribution of a broad range of syntactic features to WSD: grammatical relations coded as the presence… 
Highly Cited
2000
Highly Cited
2000
Exploring Automatic Word Sense Disambiguation with Decision Lists and the Web
The most effective paradigm for word sense disambiguation, supervised learning, seems to be stuck because of the knowledge… 
1995
1995
On Learning μ-Perceptron Networks On the Uniform Distribution ∗
We investigate the learnability, under the uniform distribution, of neural concepts that can be represented as simple… 
1991
1991
Learning the Fourier spectrum of probabilistic lists and trees
We observe that the Linial, Mansour, and Nissan method of learning boolean concepts (under uniform sampling distribution) by… 
1990
1990
A connectionist learning algorithm with provable generalization and scaling bounds
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)