Configuring Competing Classifier Chains in Distributed Stream Mining Systems
Fu Fangwen
Turaga, D.S.
Verscheure, O.
van der Schaar, M.
Amini, L.
Univ. of California Los Angeles, Los Angeles
This paper appears in: Selected Topics in Signal Processing, IEEE Journal of Publication Date: Dec. 2007
Volume: 1
,
Issue: 4
On page(s):
548
- 563
ISSN: 1932-4553
Digital Object Identifier: 10.1109/JSTSP.2007.909368
Current Version Published: 2008-01-07
Abstract
Networks of classifiers are capturing the attention of system and algorithmic researchers because they offer improved accuracy over single model classifiers, can be distributed over a network of servers for improved scalability, and can be adapted to available system resources. In this paper, we develop algorithms to optimally configure networks (chains) of such classifiers given system processing resource constraints. We first formally define a global performance metric for classifier chains by trading off the end-to-end probabilities of detection and false alarm. We then design centralized and distributed algorithms to provide efficient and fair resource allocation among several classifier chains competing for system resources. We use the Nash bargaining solution from game theory to ensure this. We also extend our algorithms to consider arbitrary topologies of classifier chains (with shared classifiers among competing chains). We present results for both simulated and state-of-the-art classifier chains for speaker verification operating on real telephony data, discuss the convergence of our algorithms to the optimal solution, and present interesting directions for future research.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
