An Algebra to Merge Heterogeneous Classifiers
Philippe J. Giabbanelli, Joseph G. Peters

TL;DR
This paper introduces a formal algebraic framework called decision spaces for merging heterogeneous classifiers in distributed systems, addressing the lack of a general merging operation and handling both stationary and non-stationary data distributions.
Contribution
It defines an algebraic structure for classifier merging, proves its properties, and discusses its application to dynamic data environments and different distribution types.
Findings
Decision spaces enable merging of different classifier types.
The algebra satisfies desirable mathematical properties.
Methods for handling temporal decay in model impact.
Abstract
In distributed classification, each learner observes its environment and deduces a classifier. As a learner has only a local view of its environment, classifiers can be exchanged among the learners and integrated, or merged, to improve accuracy. However, the operation of merging is not defined for most classifiers. Furthermore, the classifiers that have to be merged may be of different types in settings such as ad-hoc networks in which several generations of sensors may be creating classifiers. We introduce decision spaces as a framework for merging possibly different classifiers. We formally study the merging operation as an algebra, and prove that it satisfies a desirable set of properties. The impact of time is discussed for the two main data mining settings. Firstly, decision spaces can naturally be used with non-stationary distributions, such as the data collected by sensor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Stream Mining Techniques · Data Mining Algorithms and Applications · Neural Networks and Applications
