Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
