Finding Essential Attributes from Binary Data

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Annals of Mathematics and Artificial Intelligence

• Publication date

  2003-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1024653703689
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computational Learning Theory

  2010cited by this paper
• Advances in Knowledge Discovery and Data Mining

  2004cited by this paper
• Induction of decision trees

  2004influential reference
• Finding Essential Attributes in Binary Data

  2000cited by this paper
• A Formalism for Relevance and Its Application in Feature Subset Selection

  2000cited by this paper
• Finding Small Sets of Essential Attributes in Binary Data

  2000cited by this paper
• An Implementation of Logical Analysis of Data

  2000cited by this paper
• Classification and Regression Trees

  2000cited by this paper
• Logical Analysis of Binary Data with Missing Bits

  1999cited by this paper
• The Budgeted Maximum Coverage Problem

  1999cited by this paper
• Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions

  1998cited by this paper
• UCI Repository of machine learning databases

  1998cited by this paper
• Practical feature subset selection for machine learning

  1998cited by this paper
• Analysis of the greedy approach in problems of maximum k‐coverage

  1998cited by this paper
• Attribute-efficient learning in query and mistake-bound models

  1998cited by this paper
• A Monotonic Measure for Optimal Feature Selection

  1998cited by this paper
• Feature Selection by Means of a Feature Weighting Approach

  1997cited by this paper
• Logical analysis of numerical data

  1997cited by this paper
• Feature Selection via Mathematical Programming

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

  1997cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• Approximating dense cases of covering problems

  1996cited by this paper
• Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract)

  1996cited by this paper
• Toward Optimal Feature Selection

  1996cited by this paper
• Randomized Algorithms: Tail Inequalities

  1995cited by this paper
• Overview of the Third Text REtrieval Conference (TREC-3)

  1995cited by this paper
• Greedy Attribute Selection

  1994cited by this paper
• Programs for Machine Learning

  1994cited by this paper
• Learning Boolean Concepts in the Presence of Many Irrelevant Features

  1994influential reference
• Efficient Algorithms for Discovering Association Rules

  1994cited by this paper
• Irrelevant Features and the Subset Selection Problem

  1994cited by this paper
• Deliberation Scheduling for Problem Solving in Time-Constrained Environments

  1994cited by this paper
• Interior-point polynomial algorithms in convex programming

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

  1993cited by this paper
• AMPL: A Modeling Language for Mathematical Programming

  1993cited by this paper
• The Feature Selection Problem: Traditional Methods and a New Algorithm

  1992cited by this paper
• C4.5: Programs for Machine Learning

  1992cited by this paper
• Efficient Algorithms for Identifying Relevant Features

  1992influential reference
• Computational learning theory: an introduction

  1992cited by this paper
• Learning in the presence of finitely or infinitely many irrelevant attributes

  1991cited by this paper
• Pattern Recognition Via Linear Programming: Theory and Application to Medical Diagnosis

  1989cited by this paper
• Queries and concept learning

  1988cited by this paper
• Cause-effect relationships and partially defined Boolean functions

  1988influential reference
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper
• A theory of the learnable

  1984influential reference
• Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem

  1984cited by this paper
• Constrained Optimization and Lagrange Multiplier Methods

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms*

  1981cited by this paper
• Occam's razor

  1980cited by this paper
• A Greedy Heuristic for the Set-Covering Problem

  1979cited by this paper
• A Branch and Bound Algorithm for Feature Subset Selection

  1977cited by this paper
• On the ratio of optimal integral and fractional covers

  1975cited by this paper
• Threshold logic

  1971cited by this paper
• Chow Parameters in Threshold Logic

  1971cited by this paper
• A Method for Evaluating the Distribution of Power in a Committee System

  1954cited by this paper

• Learning Small Decision Trees for Data of Low Rank-Width

  2024cites this paper
• Cost-sensitive learning using logical analysis of data

  2024cites this paper
• Data Mining Using Multi-Valued Logic Minimization

  2023cites this paper
• Linear Decompositions for Multi-Valued Input Classification Functions

  2021cites this paper
• SAT-based Decision Tree Learning for Large Data Sets

  2021cites this paper
• A Classification Model to Predict the Rate of Decline of Kidney Function

  2017cites this paper
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations

  2017influential citation
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations

  2017influential citation
• Supervised box clustering

  2016cites this paper
• Modeling habitat preferences of Caspian kutum, Rutilus frisii kutum(Kamensky, 1901) (Actinopterygii, Cypriniformes) in the Caspian Sea

  2016cites this paper
• Effective Classification Using a Small Training Set Based on Discretization and Statistical Analysis

  2015cites this paper
• Modelling habitat preference of an alien aquatic fern, Azolla filiculoides (Lam.), in Anzali wetland (Iran) using data-driven methods.

  2014cites this paper
• Application of genetic algorithm and greedy stepwise to select input variables in classification tree models for the prediction of habitat requirements of Azolla filiculoides (Lam.) in Anzali wetland, Iran

  2013cites this paper
• An Improved Branch-and-Bound Method for Maximum Monomial Agreement

  2012cites this paper
• Similarity search applications in medical images

  2012cites this paper
• Feature selection with applications to text classification

  2012influential citation
• Incompatibility Graphs in Data Mining

  2011cites this paper
• A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring

  2011cites this paper
• Incompatibility graphs and data mining.

  2011cites this paper
• Retraction Note to: “Discrete Optimization Method Based on Grassmannian Parameterization in Multidimensional Dichotomic Data Structuring”

  2011cites this paper
• Discriminative frequent subgraph mining with optimality guarantees

  2010cites this paper
• Discriminative frequent subgraph mining with optimality guarantees

  2010cites this paper
• Comparison of modelling techniques to predict macroinvertebrate community composition in rivers of Ethiopia

  2010cites this paper
• Near-optimal Supervised Feature Selection among Frequent Subgraphs

  2009cites this paper
• Combining near-optimal feature selection with gSpan

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

  2007cites this paper
• Reformulation of the support set selection problem in the logical analysis of data

  2007cites this paper
• Learning concepts with few unknown relevant attributes from noisy data

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

  2006cites this paper
• Logical Analysis of Data

  2005cites this paper
• Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis

  2004cites this paper
• Performance analysis of a greedy algorithm for inferring Boolean functions

  2003influential citation
• Prospective Data Fusion for Batch Filtering

  2003cites this paper
• Monitoring Message Streams : Algorithmic Methods for Automatic Processing of Messages April 27 , 2003

  2003cites this paper
• Rutgers Filtering Work at TREC 2002: Adaptive and Batch

  2002cites this paper