DISTRIBUTED DATA MINING AND MINING MULTI-AGENT DATA

Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4

Abstract

The problem of distributed data mining isvery important in network problems. Ina distributed environment (such as a sensor or IP network), one has distributed probes placed at strategic locations within the network. The problem here is to be able to correlate the data seen at the various probes, and discover patterns in the global data seen at all the different probes. There could be different models of distributed data mining here, but one could involve a NOC that collects data from the distributed sites, and another in which all sites are treated equally. The goal here obviously would be to minimize the amount of data shipped between the various sites — ssentially, to reduce the communication overhead. In distributed mining, one problem is how to mine across multiple heterogeneous data sources: multi-database and ultirelational mining. Another important new area is adversary data mining. In a growing number of domains — email spam, counter-terrorism, intrusion detection/computer security, click spam, search engine spam, surveillance, fraud detection, shop bots, file sharing, etc. — data mining systems face adversaries that deliberately anipulate the data to sabotage them (e.g. make them produce false negatives). In this paper need to develop systems that explicitly take this into account, by combining data mining with game theory.

Authors and Affiliations

Vuda Sreenivasa Rao , Dr. S Vidyavathi

Keywords

Related Articles

Implementation of Multiplatform RIA using User Interface Components

Abstract—Nowadays, there are a growing number of Web 1.0 applications that are migrating towards Web 2.0 User Interfaces, in search of multimedia support and higher levels of interaction among other features. These We...

Combining Speedup Techniques based on Landmarks and Containers

The Dijkstra’s algorithm [1] , which is applied in many real world problems like mobile routing, road maps, railway networks, etc,. is used to find the shortest path between source and destination. There are many techniq...

The Trust-Based MAC-Layer Security Protocol for Mobile Ad hoc Networks

In this paper, we develop a trust based security protocol based on a MAC-layer approach which attains confidentiality and authentication of packets in both routing and link layers of MANETs. In the first phase of the pro...

Implementation of Distributed Algorithm with Network Coding for Multicast Network

In today's practical networks, end-to-end information delivery is performed by routing. Network coding generalizes routing by allowing a node to generate output data by mixing (i.e., computing certain functions of) its r...

Quantum computation and Biological stress: A Hypothesis

We propose that biological systems may behave as quantum computers.We have earlier hypothesized that patterns of quantum computation may be altered in stress and this leads to the change in the consciousness vector of bi...

Download PDF file
  • EP ID EP124237
  • DOI -
  • Views 107
  • Downloads 0

How To Cite

Vuda Sreenivasa Rao, Dr. S Vidyavathi (2010). DISTRIBUTED DATA MINING AND MINING MULTI-AGENT DATA. International Journal on Computer Science and Engineering, 2(4), 1237-1244. https://europub.co.uk./articles/-A-124237