Performance analysis of a greedy algorithm for inferring Boolean functions

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Information Processing Letters

• Publication date

  2003-10-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ipl.2004.09.017
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robust Inference of Relevant Attributes

  2003cited by this paper
• Finding Essential Attributes from Binary Data

  2003influential reference
• A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis

  2003influential reference
• Learning juntas

  2003cited by this paper
• Approximation Algorithms

  2001cited by this paper
• A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Anaylsis

  2000cited by this paper
• A Study of Relevance for Learning in Deductive Databases

  1999cited by this paper
• Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model

  1998cited by this paper
• Selection of Relevant Features and Examples in Machine Learning

  1997influential reference
• Conditions for Occam's Razor Applicability and Noise Elimination

  1997cited by this paper
• Approximating Minimum Keys and Optimal Substructure Screens

  1996influential reference
• A Minimization Approach to Propositional Inductive Learning

  1995cited by this paper
• Randomized Algorithms: Tail Inequalities

  1995cited by this paper
• Boolean Matching Using Generalized Reed-Muller Forms

  1994cited by this paper
• Mining association rules between sets of items in large databases

  1993cited by this paper
• On the Complexity of Inferring Functional Dependencies

  1992cited by this paper
• Boolean Feature Discovery in Empirical Learning

  1990cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper

• Mathematical Models and Computational Methods for Inference of Genetic Networks

  2016cites this paper
• Metric properties of large graphs

  2016cites this paper
• Pooled Screening for Synergistic Interactions Subject to Blocking and Noise

  2014cites this paper
• Process-Driven Inference of Biological Network Structure: Feasibility, Minimality, and Multiplicity

  2012cites this paper
• A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data

  2010cites this paper
• Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions

  2009cites this paper
• Algorithms for Inference, Analysis and Control of Boolean Networks

  2008cites this paper
• When Does Greedy Learning of Relevant Attributes Succeed?

  2007cites this paper
• Mathematisches Forschungsinstitut Oberwolfach Combinatorics, Probability and Computing

  2006influential citation
• Learning juntas in the presence of noise

  2006cites this paper
• An efficient top-down search algorithm for learning Boolean networks of gene expression

  2006cites this paper
• When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---

  2006influential citation
• Learning concepts with few unknown relevant attributes from noisy data

  2006cites this paper
• Selecting Informative Genes for Cancer Classification Using Gene Expression Data

  2003cites this paper