Advertisement

Interactive Pattern Exploration: Securely Mining Distributed Databases

  • Priya ChawlaEmail author
  • Raj Bhatnagar
  • Chia Han
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9734)

Abstract

Interactive patterns embedded and stored in multiple related databases can provide valuable insights into the domain of data exploration. Yet, the owners of individual databases may want to protect the privacy of their data while still allowing enough collaboration for the patterns to be discovered. In this paper, we show how data can be accessed securely through the use of data mining algorithms. We also investigate some methods that discover unique data patterns interactively, while still preserving data and user privacy, as much as possible.

Keywords

Privacy Interaction Security Data ID3 Distributed 

Notes

Acknowledgements

The research was supported in part by the National Science Foundation through the REU program (2013–2014) at the University of Cincinnati. We are also thankful to the reviewers for providing useful comments.

References

  1. 1.
    Bhatnagar, R., Srinivasan, S.: Pattern discovery in distributed databases. In: American Association for Artificial Intelligence (1997)Google Scholar
  2. 2.
    Chattopadhyay, D.: Distributed decision tree induction using multi-agent based negotiation protocol. Electronic thesis or dissertation. University of Cincinnati, OhioLINK Electronic Theses and Dissertations Center (2014)Google Scholar
  3. 3.
    Clifton, C., et al.: Tools for privacy preserving distributed data mining. ACM Sigkdd Explor. Newsl. 4(2), 28–34 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Demsar, J., Curk, T., Erjavec, A., Gorup, C., Hocevar, T., Milutinovic, M., Mozina, M., Polajnar, M., Toplak, M., Staric, A., Stajdohar, M., Umek, L., Zagar, L., Zbontar, J., Zitnik, M., Zupan, B.: Orange: data mining toolbox in python. J. Mach. Learn. Res. 14, 2349–2353 (2013)zbMATHGoogle Scholar
  5. 5.
    Follmer, H.: On entropy and information gain in random fields. Probab. Theor. Relat. Fields 26(3), 207–217 (1973). Springer-VerlagMathSciNetzbMATHGoogle Scholar
  6. 6.
    Hsiao, C.J., Cherry, D.K., Rechtsteiner, E.A.: Medical care survey. Centers for Disease Control and Prevention. Centers for Disease Control and Prevention (2013)Google Scholar
  7. 7.
    Glinert-Stevens, S.: Microsoft publisher: desktop wizardry. Pc Sources 3(2), 357 (1992)Google Scholar
  8. 8.
    Kim, H., Koehler, G.J.: Theory and practice of decision tree induction. Omega 23(6), 637–652 (1995)CrossRefGoogle Scholar
  9. 9.
    Liu, K., Kargupta, H., Ryan, J.: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Trans. Knowl. Data Eng. 18(1), 92–106 (2006)CrossRefGoogle Scholar
  10. 10.
    Monson, L.: Dr Dobb’s Journal-Software Tools for the Professional Programmer 22(10), pp. 117–120 (1997)Google Scholar
  11. 11.
    Olsen, T.C.: Distributed Decision Tree Learning from Multiple Heterogeneous Data Sources (2006)Google Scholar
  12. 12.
    Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81–106 (1986)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.EECS DepartmentUniversity of CincinnatiCincinnatiUSA

Personalised recommendations