• DocumentCode
    1653394
  • Title

    Distributed hyperplane learning using consensus algorithm for sensor networks

  • Author

    Ramakrishnan, Naveen ; Ertin, Emre ; Moses, Randolph L.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Ohio State Univ., Columbus, OH, USA
  • fYear
    2009
  • Firstpage
    741
  • Lastpage
    744
  • Abstract
    In this paper, we study distributed classification of targets in a large scale sensor network setting. Specifically, we consider sensor nodes which can measure only a part of the feature vector and whose communication capabilities are limited to only their neighbouring nodes. We formulate a distributed classification algorithm that learns the optimal (large-margin) hyperplane separating the two classes, using the projected-gradient approach. The sensor nodes reach a consensus on the gradient to be used for weight update at each step of the optimization algorithm. We prove the convergence of the proposed algorithm and provide a joint calibration and signature learning method for acoustic sensor networks as an application.
  • Keywords
    distributed algorithms; gradient methods; graph theory; learning (artificial intelligence); wireless sensor networks; acoustic sensor network; consensus algorithm; distributed classification algorithm; distributed hyperplane learning; joint calibration learning method; large scale sensor network setting; neighbouring nodes; optimization algorithm; projected-gradient approach; sensor nodes; signature learning method; wireless sensor networks; Acoustic sensors; Classification algorithms; Computer networks; Convergence; Distributed computing; Iterative algorithms; Large-scale systems; Machine learning algorithms; Random variables; Sensor phenomena and characterization; Machine learning; distributed consensus; sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Statistical Signal Processing, 2009. SSP '09. IEEE/SP 15th Workshop on
  • Conference_Location
    Cardiff
  • Print_ISBN
    978-1-4244-2709-3
  • Electronic_ISBN
    978-1-4244-2711-6
  • Type

    conf

  • DOI
    10.1109/SSP.2009.5278461
  • Filename
    5278461