Abstract
We study the problem of predictive data mining in a competitive multi-agent setting, in which each agent is assumed to have some partial knowledge required for correctly classifying a set of unlabelled examples. The agents are self-interested and therefore need to reason about the trade-offs between increasing their classification accuracy by collaborating with other agents and disclosing their private classification knowledge to other agents through such collaboration. We analyze the problem and propose a set of components which can enable cooperation in this otherwise competitive task. These components include measures for quantifying private knowledge disclosure, data-mining models suitable for multi-agent predictive data mining, and a set of strategies by which agents can improve their classification accuracy through collaboration. The overall framework and its individual components are validated on a synthetic experimental domain.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. of the ACM SIGMOD Conference on Management of Data, pp. 439–450. ACM Press, New York (2000)
Kantarcioǧlu, M., Jin, J., Clifton, C.: When do data mining results violate privacy? In: KDD 2004: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 599–604. ACM, New York (2004)
Clifton, C., Kantarcioglu, M., Vaidya, J.: Defining Privacy for Data Mining. In: National Science Foundation Workshop on Next Generation Data Mining, pp. 126–133 (2002)
Bonchi, F., Saygin, Y., Verykios, V., Atzori, M., Gkoulalas-Divanis, A., Kaya, S., Savas, E.: Privacy in Spatiotemporal Data Mining. In: Mobility, Data Mining and Privacy: Geographic Knowledge Discovery (2008)
Natwichai, J., Li, X., Orlowska, M.: Hiding Classification Rules for Data Sharing with Privacy Preservation. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 468–477. Springer, Heidelberg (2005)
Verykios, V.S., Gkoulalas-Divanis, A.: A Survey of Association Rule Hiding Methods for Privacy. In: Privacy-Preserving Data Mining. Springer, US (2008)
Bertino, E., Lin, D., Jiang, W.: A Survey of Quantification of Privacy Preserving Data Mining Algorithms. In: Privacy-Preserving Data Mining. Springer, US (2008)
Bertino, E., Fovino, I., Provenza, L.: A Framework for Evaluating Privacy Preserving Data Mining Algorithms. Data Mining and Knowledge Discovery 11(2), 121–154 (2005)
Franzin, M., Rossi, F., Freuder, E., Wallace, R.: Multi-Agent Constraint Systems with Preferences: Efficiency, Solution Quality, and Privacy Loss. Computational Intelligence 20(2), 264–286 (2004)
van der Krogt, R.: Privacy loss in classical multiagent planning. In: IEEE/WIC/ACM International Conference on Intelligent Agent Technology, pp. 168–174 (2007)
Weiss, G., Saar-Tsechansky, M., Zadrozny, B.: Report on UBDM-05: Workshop on Utility-Based Data Mining. ACM SIGKDD Explorations Newsletter 7(2), 145–147 (2005)
Kargupta, H., Das, K., Liu, K.: A game theoretic approach toward multi-party privacy-preserving distributed data mining. In: Communication (2007)
Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisý, V., Jakob, M., Benda, P., Urban, Š., Pěchouček, M. (2009). Towards Cooperative Predictive Data Mining in Competitive Environments. In: Cao, L., Gorodetsky, V., Liu, J., Weiss, G., Yu, P.S. (eds) Agents and Data Mining Interaction. ADMI 2009. Lecture Notes in Computer Science(), vol 5680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03603-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03603-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03602-6
Online ISBN: 978-3-642-03603-3
eBook Packages: Computer ScienceComputer Science (R0)