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
- EP ID EP124237
- DOI -
- Views 88
- Downloads 0
Comparative Evaluation of Packet Classification Algorithms, with Implementation
in a realm of ever-increasing Internet connectivity, together with swelling computer security threats, security-cognizant network applications technology is gaining widespread popularity. Packet classifiers are extensive...
DESIGN OF PARAMETER EXTRACTOR IN LOW POWER PRECOMPUTATION BASED CONTENT ADDRESSABLE MEMORY
Content-addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due to its ability to improve application per...
Software Reliability Growth Models for the Safety Critical Software with Imperfect Debugging
In this paper, we will investigate how to perform he log-logistic testing-effort function (TEF) into different software reliability growth models based on non-homogeneous Poisson process (NHPP). The models parameters are...
Dependency Through Axiomatic Approach On Rough Set Theory
The idea of rough set consist the approximation of a set by pair of sets called the lower and the upper approximation of the set. In fact, these approximations are interior and closer operations in a certain topology gen...
USE OF OPEN SOURCE TECHNOLOGIES FOR ENTERPRISE SERVER MONITORING USING SNMP
This paper focuses on the evolving trend of Data Center Monitoring in enterprise using SNMP protocol & open source platforms for proactive server monitoring and data center management. It also focuses on the need of...