INFORMS Journal on Computing articles from June 1999

INFORMS Journal on Computing archives from June 1999

Mathematical programming for data mining: formulations and challenges.
June 22, 1999... This article is intended to serve as an overview of a rapidly emerging research and applications area. In addition to providing a general overview, motivating the importance of data mining problems within the area of knowledge discovery in...

Data mining by decomposition: adaptive search for hypothesis generation.
June 22, 1999... Data mining methods search large databases for interesting patterns that may lead to useful decisions in organizations. When the database is defined over scores of attributes, the complexity of the search increases due to the combinatorial...

Direct marketing performance modeling using genetic algorithms.
June 22, 1999... Data analysts in direct marketing seek models to identify the most promising individuals to mail to and thus maximize returns from solicitations. A variety of criterion can be used to assess model performance, including response to or revenue...

Feature selection for financial credit-risk evaluation decisions.
June 22, 1999... Credit-risk evaluation decisions are important for the financial institutions involved due to the high level of risk associated with wrong decisions. Various machine learning methods have been shown to perform reasonably well for this complex...

A study of composite or hybrid classifiers for knowledge discovery.
June 22, 1999... There are several well-known techniques for knowledge discovery such as neural networks, discriminant analysis, etc. This article compares the forecasting accuracy of five models (two parametric and three nonparametric) and proposes composite...

Optimizing expert systems: heuristics for efficiently generating low-cost information acquisition strategies.
June 22, 1999... We study the sequential information acquisition problem for rule-based expert systems as follows: find the information acquisition strategy that minimizes the expected cost to operate the system while maintaining the same output decisions. This...

Parallel complexity of additive location problems.
June 22, 1999... Parallel NC-algorithms for a general class of multifacility location problems on a tree with identical facilities and the minisum objective function are presented. The class includes the 13-median problem, the p-coverage problem, and the...

Semantics-based transaction processing for real-time databases: the case of automated stock trading.
June 22, 1999... In the future, automated stock trading (AST) databases will need to support execution of transactions with time constraints similar to that discussed in real-time databases. Transactions in AST databases repeat from a predictable set of...

Matrix sensitivity analysis from an interior solution of a linear program.
June 22, 1999... This article considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to the perturbed problem (called "admissible")....