Learning Rules from Distributed Data

In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrated. We focus on learning a single model from a set of disjoint data sets, which are distributed across a set of computers. The model is a set of rules. The distributed data sets may be disjoint for any of several reasons. In our approach, the first step is to construct a rule set (model) for each of the original disjoint data sets. Then rule sets are merged until an eventual final rule set is obtained which models the aggregate data. We show that this approach compares to directly creating a rule set from the aggregate data and promises faster learning. Accuracy can drop off as the degree of parallelism increases. However, an approach has been developed to extend the degree of parallelism achieved before this problem takes over.

• Type: Conference
• Year: 1999
• Where: KDD
• Authors: Lawrence O. Hall, Nitesh V. Chawla, Kevin W. Bowyer, W. Philip Kegelmeyer
• Keywords: Data Mining, Disjoint Data Sets, KDD 1999, Original Disjoint Data, Rule Set