Prototype selection algorithms for distributed learning

Ireneusz Czarnowski

doi:10.1016/j.patcog.2010.01.006

Return

Prototype selection algorithms for distributed learning

2010-06-01

PRE

Ireneusz Czarnowski *

DOI：10.1016/j.patcog.2010.01.006

Original

Original request for help

Save

Abstract

En 中文

Distributed learning from data is one of the typical tasks solved by distributed data-mining techniques and is seen as a fundamental computational problem. One of the approaches suitable for distributed learning is to select, by data reduction, relevant local patterns, called also prototypes, from geographically distributed databases. Next, locally selected prototypes can be moved to other sites and merged into the global knowledge model. The paper presents three agent-based population learning algorithms for distributed learning. The proposed algorithms are based on agent collaborations in distributed prototype selection processes and on agent collaborations when the learning global model is created. The basic property of the presented algorithms is that the prototypes are selected by agent-based population learning algorithm from data clusters induced at distributed sites. The main goal of the paper is to empirically compare how the way of inducing such clusters can influence the distributed learning performance. The paper investigates the agent-based population learning algorithms used to solve distributed data reduction and gives a brief discussion of the procedures for clusters initialization. Finally, computational experiment results are shown. (C) 2010 Elsevier Ltd. All rights reserved.

Keywords:

Distributed data mining

Distributed learning

Data reduction

Instance selection

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.