A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems

In a large network of computers or wireless sensors, each of the components (henceforth, peers) has some data about the global state of the system. Much of the system’s functionality such as message routing, information retrieval and load sharing relies on modeling the global state. We refer to the outcome of the function (e.g., the load experienced by each peer) as the model of the system. Since the state of the system is constantly changing, it is necessary to keep the models up-to-date. Computing global data mining models e.g. decision trees, k-means clustering in large distributed systems may be very costly due to the scale of the system and due to communication cost, which may be high. The cost further increases in a dynamic scenario when the data changes rapidly. In this paper we describe a two step approach for dealing with these costs. First, we describe a highly efficient local algorithm which can be used to monitor a wide class of data mining models. Then, we use this algorithm as a feedback loop for the monitoring of complex functions of the data such as its k-means clustering. The theoretical claims are corroborated with a thorough experimental analysis
Date: April 01, 2009
Book Title: IEEE Transactions on Knowledge and Data Engineering
Type: Article
Volume: 21
Number: 4
Pages: 465-478
Downloads: 457

Has 1 soft copy


remote link

Bibtex


@Article{A_Generic_Local_Algorithm_for_Mining_Dat,
  author = "Ran Wolff and Kanishka Bhaduri and Hillol Kargupta",
  title = "{A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems}",
  month = "April",
  year = "2009",
  pages = "465-478",
  number = "4",
  volume = "21",
  journal = "IEEE Transactions on Knowledge and Data Engineering",
}