Distributed data mining and agents

  • Authors:
  • Josenildo C. da Silva;Chris Giannella;Ruchita Bhargava;Hillol Kargupta;Matthias Klusch

  • Affiliations:
  • German Research Center for Artificial Intelligence, Stuhlsatzenweghaus 3, 66121 Saarbruecken, Germany;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD 21250, USA;Microsoft Corporation, One Microsoft Way, Redmond, WA 98052, USA;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD 21250, USA and AGNIK LLC, 8840 Stanford Blvd., Suite 1300, Columbia, MD 21045, USA;German Research Center for Artificial Intelligence, Stuhlsatzenweghaus 3, 66121 Saarbruecken, Germany

  • Venue:
  • Engineering Applications of Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-agent systems (MAS) offer an architecture for distributed problem solving. Distributed data mining (DDM) algorithms focus on one class of such distributed problem solving tasks-analysis and modeling of distributed data. This paper offers a perspective on DDM algorithms in the context of multi-agents systems. It discusses broadly the connection between DDM and MAS. It provides a high-level survey of DDM, then focuses on distributed clustering algorithms and some potential applications in multi-agent-based problem solving scenarios. It reviews algorithms for distributed clustering, including privacy-preserving ones. It describes challenges for clustering in sensor-network environments, potential shortcomings of the current algorithms, and future work accordingly. It also discusses confidentiality (privacy preservation) and presents a new algorithm for privacy-preserving density-based clustering.