scispace - formally typeset
Open AccessJournal ArticleDOI

Nonparametric decentralized detection using kernel methods

TLDR
This work proposes a novel algorithm using the framework of empirical risk minimization and marginalized kernels and analyzes its computational and statistical properties both theoretically and empirically.
Abstract
We consider the problem of decentralized detection under constraints on the number of bits that can be transmitted by each sensor. In contrast to most previous work, in which the joint distribution of sensor observations is assumed to be known, we address the problem when only a set of empirical samples is available. We propose a novel algorithm using the framework of empirical risk minimization and marginalized kernels and analyze its computational and statistical properties both theoretically and empirically. We provide an efficient implementation of the algorithm and demonstrate its performance on both simulated and real data sets.

read more

Content maybe subject to copyright    Report

Citations
More filters

Detection, Estimation, and Modulation Theory

TL;DR: Electrical and computer engineering ece courses ece 257a multiuser communication systems 4 congestion control convex programming and dual controller fair end end rate allocation max min fair vs proportional, electrical systems engineering washington university.
Journal ArticleDOI

Distributed learning in wireless sensor networks

TL;DR: In this article, the authors discuss nonparametric distributed learning in WSNs and discuss the challenges that wireless sensor networks pose for distributed learning, and research aimed at addressing these challenges is surveyed.
Journal ArticleDOI

Wireless Sensors in Distributed Detection Applications

TL;DR: The classical framework for decentralized detection is reviewed and it is argued that, while this framework provides a useful basis for developing a theory for detection in sensor networks, it has serious limitations.
Journal ArticleDOI

Practical data compression in wireless sensor networks: A survey

TL;DR: A data compression scheme is one that can be used to reduce transmitted data over wireless channels, which leads to a reduction in the required inter-node communication, which is the main power consumer in wireless sensor networks.
References
More filters
Journal ArticleDOI

A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting

TL;DR: The model studied can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting, and it is shown that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems.
Book

Nonlinear Programming

Journal ArticleDOI

Additive Logistic Regression : A Statistical View of Boosting

TL;DR: This work shows that this seemingly mysterious phenomenon of boosting can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood, and develops more direct approximations and shows that they exhibit nearly identical results to boosting.