Results 1 
5 of
5
A Continuous Approach to Inductive Inference
 Mathematical Programming
, 1992
"... In this paper we describe an interior point mathematical programming approach to inductive inference. We list several versions of this problem and study in detail the formulation based on hidden Boolean logic. We consider the problem of identifying a hidden Boolean function F : f0; 1g n ! f0; 1g ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
In this paper we describe an interior point mathematical programming approach to inductive inference. We list several versions of this problem and study in detail the formulation based on hidden Boolean logic. We consider the problem of identifying a hidden Boolean function F : f0; 1g n ! f0; 1g using outputs obtained by applying a limited number of random inputs to the hidden function. Given this inputoutput sample, we give a method to synthesize a Boolean function that describes the sample. We pose the Boolean Function Synthesis Problem as a particular type of Satisfiability Problem. The Satisfiability Problem is translated into an integer programming feasibility problem, that is solved with an interior point algorithm for integer programming. A similar integer programming implementation has been used in a previous study to solve randomly generated instances of the Satisfiability Problem. In this paper we introduce a new variant of this algorithm, where the Riemannian metric used...
An Interior Point Approach to Boolean Vector Function Synthesis
 In Proceedings of the 36th MSCAS
, 1993
"... The Boolean vector function synthesis problem can be stated as follows: Given a truth table with n input variables and m output variables, synthesize a Boolean vector function that describes the table. In this paper we describe a new formulation of the Boolean vector function synthesis problem as a ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
The Boolean vector function synthesis problem can be stated as follows: Given a truth table with n input variables and m output variables, synthesize a Boolean vector function that describes the table. In this paper we describe a new formulation of the Boolean vector function synthesis problem as a particular type of Satisfiability Problem. The Satisfiability Problem is translated into an integer programming feasibility problem, that is solved with an interior point algorithm for integer programming. Preliminary computational results are presented. Introduction The Boolean Vector Function Synthesis Problem has applications in logic, artificial intelligence, machine learning, and digital integrated circuit design. In this paper, we describe a Satisfiability Problem formulation of the Boolean Vector Function Synthesis Problem. This formulation can be approached with a wide range of algorithms. In this paper, preliminary computational results are presented using an interior point algorit...
Feature Selection in Web Applications Using ROC Inflections and Power Set Pruning
, 2000
"... A basic problem of information processing is selecting enough features to ensure that events are accurately represented for classification problems, while simultaneously minimizing storage and processing of irrelevant or marginally important features. To address this problem, feature selection pro ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
A basic problem of information processing is selecting enough features to ensure that events are accurately represented for classification problems, while simultaneously minimizing storage and processing of irrelevant or marginally important features. To address this problem, feature selection procedures perform a search through the feature power set to find the smallest subset meeting performance requirements. Major restrictions of existing procedures are that they typically explicitly or implicitly assume a fixed operating point, and make limited use of the statistical structure of the feature power set. We present a method that combines the NeymanPearson design procedure on finite data, with the directed set structure of the Receiver Operating Curves on the feature subsets, to determine the maximal size of the feature subsets that can be ranked in a given problem. The search can then be restricted to the smaller subsets, resulting in significant reductions in computational...
Feature selection in web applications by roc inflections and powerset pruning
 In Proceedings of 2001 Symp. on Applications and the Internet (SAINT 2001
, 2001
"... coetzee,compuman,lawrence,gilesĀ„ A basic problem of information processing is selecting enough features to ensure that events are accurately represented for classification problems, while simultaneously minimizing storage and processing of irrelevant or marginally important features. To address this ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
coetzee,compuman,lawrence,gilesĀ„ A basic problem of information processing is selecting enough features to ensure that events are accurately represented for classification problems, while simultaneously minimizing storage and processing of irrelevant or marginally important features. To address this problem, feature selection procedures perform a search through the feature power set to find the smallest subset meeting performance requirements. Major restrictions of existing procedures are that they typically explicitly or implicitly assume a fixed operating point, and make limited use of the statistical structure of the feature power set. We present a method that combines the NeymanPearson design procedure on finite data, with the directed set structure of the Receiver Operating Curves on the feature subsets, to determine the maximal size of the feature subsets that can be ranked in a given problem. The search can then be restricted to the smaller subsets, resulting in significant reductions in computational complexity. Optimizing the overall Receiver Operating Curve also allows for end users to select different operating points and cost functions to optimize. The algorithm also produces a natural method of Boolean representation of the minimal feature combinations that best describe the data near a given operating point. These representations are especially appropriate when describing data using common textrelated features useful on the web, such as thresholded TFIDF data. We show how to use these results to perform automatic Boolean query modification generation for distributed databases, such as niche metasearch engines. 1
Evolutionary Algorithms for the Satisfiability
 Evolutionary Computation
, 2002
"... Several evolutionary algorithms have been proposed for the satisfiability problem. ..."
Abstract
 Add to MetaCart
Several evolutionary algorithms have been proposed for the satisfiability problem.