Published In

Kybernetes

Document Type

Post-Print

Publication Date

2004

Subjects

Cybernetics, Programming (Computers), Heuristic algorithms, Data mining

Abstract

Extended dependency analysis (EDA) is a heuristic search technique for finding significant relationships between nominal variables in large data sets. The directed version of EDA searches for maximally predictive sets of independent variables with respect to a target dependent variable. The original implementation of EDA was an extension of reconstructability analysis. Our new implementation adds a variety of statistical significance tests at each decision point that allow the user to tailor the algorithm to a particular objective. It also utilizes data structures appropriate for the sparse data sets customary in contemporary data mining problems. Two examples that illustrate different approaches to assessing model quality tests are given in this paper.

Description

This is the authors' version of a paper which subsequently appeared in Kybnernetes, published by Emerald Group Publishing Limited. The version of record may be found at http://dx.doi.org/10.1108/03684920410534010.

DOI

10.1108/03684920410534010

Persistent Identifier

http://archives.pdx.edu/ds/psu/16490

Share

COinS