Abstract
Growth of Internet has led to exponential rise in data communication over the World Wide Web. Several applications and entities such as online banking transactions, stock trading, e-commerce Web sites, etc. are at a constant risk of eavesdropping and hacking. Hence, security of data is of prime concern. Recently, vertical data have gained lot of focus because of their significant performance benefits over horizontal data in various data mining applications. In our current work, we propose a Predicate-Tree based solution for protection of data. Predicate-Trees or pTrees are compressed, data-mining-ready, vertical data structures and have been used in a plethora of data-mining research areas such as spatial association rule mining, text clustering, closed k-nearest neighbor classification, etc. We show how for data mining purposes, the scrambled pTrees would be unrevealing of the raw data to anyone except for the authorized person issuing a data mining request. In addition, we propose several techniques which come along as a benefit of using vertical pTrees. To the best of our knowledge, our approach is novel and provides sufficient speed and protection level for an effective data security.
We acknowledge partial financial support for this research from a Department of Energy Award (award # DE-FG52-08NA28921).
Chapter PDF
Similar content being viewed by others
References
Ding, Q., Ding, Q., Perrizo, W.: PARM - An Efficient Algorithm to Mine Association Rules from Spatial Data. IEEE Transactions on Systems, Man, and Cybernetics, Part B 38(6), 1513–1524 (2008)
Khan, M., Ding, Q., Perrizo, W.: k-nearest Neighbor Classification on Spatial Data Streams Using P-trees. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 517–528. Springer, Heidelberg (2002)
Rahal, I., Perrizo, W.: An optimized approach for KNN text categorization using P-trees. In: ACM Symposium on Applied Computing, pp. 613–617 (2004)
Perrizo, W.: Predicate Count Tree Technology. Technical Report NDSU-CSOR-TR-01-1 (2001)
Wang, Y., Lu, T., Perrizo, W.: A Novel Combinatorial Score for Feature Selection with P-Tree in DNA Microarray Data Analysis. In: 19th International Conference on Software Engineering and Data Engineering, pp. 295–300 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Perrizo, W., Roy, A.G. (2012). Predicate-Tree Based Pretty Good Privacy of Data. In: De Decker, B., Chadwick, D.W. (eds) Communications and Multimedia Security. CMS 2012. Lecture Notes in Computer Science, vol 7394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32805-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-32805-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32804-6
Online ISBN: 978-3-642-32805-3
eBook Packages: Computer ScienceComputer Science (R0)