Browsing by Subject "Sensor networks"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Distributed and robust techniques for statistical learning.
    (2012-05) Forero, Pedro Andrés
    The last decade has been marked by the advent of networked systems able to gather tremendous amounts of data. Testimony of this trend are data collection projects and digital services such as Google books, Internet marketing, and social networking sites. To fully exploit the potential benefits hidden in large collections of data, this thesis argues that more emphasis must be placed on data processing. Statistical learning approaches seeking to uncover the “right” information within the data while able to deal with their complexities are needed. Dealing with vast amounts of data, possibly distributed across multiple locations and often contaminated with outliers (inconsistent data) and missing entries, poses formidable processing challenges. This thesis takes a step forth towards overcoming the aforementioned challenges by proposing novel problem formulations and capitalizing on contemporary tools from optimization and compressive sampling. Power-limited networked systems deployed for data acquisition can elongate their service life by collaboratively processing data in-situ rather than transmitting all data back to a centralized processing unit. With this premise in mind, the viability of a fully distributed framework for clustering and classification is explored. Capitalizing on the idea of consensus, algorithms with performance guarantees equivalent to the ones achieved by a centralized algorithm having access to all network data are developed. Due to their wide applicability and popularity, focus is placed on developing alternatives for support vector machines, K-means and expectation-maximization algorithms. Managing the quality of data poses a major challenge. Outliers are hard to identify, especially in high dimensional data. The presence of outliers can be due to faulty sensors, malicious sources, model mismatch, or rarely seen events. In all cases, ill-handled outliers can deteriorate the performance of any information processing and management scheme. Robust clustering algorithms relying on a data model that explicitly captures outliers are developed. The outlier-aware data model translates the rare occurences of outliers in data to sparsity of pertinent outliers variables, thereby establishing a neat link between clustering and the area of compressive sampling. A similar outlier-aware model is used to derive robust versions of multidimensional scaling algorithms for high-dimensional data visualization. In this context, a robust multidimensional scaling algorithm able to cope with a common structured outlier contamination is also developed. Using data with missing entries is also challenging. Missing data can occur due to faulty sensors, privacy concerns, and limited measurement budgets. Specifically, prediction of a dynamical process evolving on a network based on observations at a few nodes is explored. Here, tools from semi-supervised learning and dictionary learning are leveraged to develop batch and online topology- and data-driven prediction algorithms able to cope with missing data.
  • Thumbnail Image
    Item
    Distributed optimization in an energy-constrained network.
    (2010-02) Razavi Majomard, Seid Alireza
    We consider a distributed optimization problem whereby a network of N nodes, Sℓ, ℓ ∈ {1, . . . ,N}, wish to minimize a common strongly convex function f(x), x = [x1, . . . , xN]T , under the constraint that node Sℓ controls variable xℓ only. The nodes locally update their respective variables and periodically exchange their values over a set of pre-defined communication channels. Previous studies of this problem have focused mainly on the convergence issue and the analysis of convergence rate. In this work, we consider noisy communication channels and study the impact of communication energy on convergence. In particular, we study the minimum amount of communication energy required for nodes to obtain an ϵ-minimizer of f(x) in the mean square sense. For linear analog communication schemes, we prove that the communication energy to obtain an ϵ-minimizer of f(x) must grow at least at the rate of Ω(1/ϵ), and this bound is tight when f is convex quadratic. Furthermore, we show that the same energy requirement can be reduced to O ( log2 1/ϵ ) if suitably designed digital communication schemes are used.