An efficient local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks

This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compaction, data modeling and classification tasks in many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Computing a global regression model from data available at the different peer-nodes using a traditional centralized algorithm for regression can be very costly and impractical because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. This paper proposes a two-step approach to deal with this problem. First, it offers an efficient local distributed algorithm that monitors the “quality” of the current regression model. If the model is outdated, it uses this algorithm as a feedback mechanism for rebuilding the model. The local nature of the monitoring algorithm guarantees low monitoring cost. Experimental results presented in this paper strongly support the theoretical claims.
Date: April 24, 2008
Book Title: SIAM International Conference on Data Mining
Type: InProceedings
Address: Atlanta, Georgia
Downloads: 347

Has 1 soft copy


remote link

Bibtex


@InProceedings{An_efficient_local_Algorithm_for_Distrib,
  editor = "Kanishka Bhaduri and Hillol Kargupta",
  title = "{An efficient local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks}",
  month = "April",
  year = "2008",
  address = ", Atlanta, Georgia, ",
  booktitle = "SIAM International Conference on Data Mining",
}