By Topic

A Game Theoretic Approach to Active Distributed Data Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaofeng Zhang ; Hong Kong Baptist Univ., Kowloon ; Cheung, W.K.

Learning-from-abstraction (LFA) is a recently proposed model-based distributed data mining approach which aims to the mining process both scalable and privacy preserving. However how to set the right trade-off between the abstraction levels of the local data sources and the global model accuracy is crucial for getting the optimal abstraction, especially when the local data are inter-correlated to different extents. In this paper, we define the optimal abstraction task as a game and compute the Nash equilibrium as its solution. Also, we propose an iterative version of the game so that the Nash equilibrium can be computed by actively exploring details from the local sources in a need-to-know manner. We tested the proposed game theoretic approach using a number of data sets for model-based clustering with promising results obtained.

Published in:

Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on

Date of Conference:

2-5 Nov. 2007