k-Anonymous patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3721 LNAI, Issue , 2005, Pages 10-21

  Atzori, Maurizio ^a,b   Bonchi, Francesco ^b   Giannotti, Fosca ^b   Pedreschi, Dino ^a  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; MATHEMATICAL MODELS; PATTERN RECOGNITION; STATISTICAL METHODS; THRESHOLD LOGIC;

DATA MINING MODELS; K-ANONYMOUS PATTERNS; MINIMUM SUPPORT THRESHOLD; PATTERN DISCOVERY;

DATABASE SYSTEMS;

EID: 33646407813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_7     Document Type: Conference Paper

References (17)

1. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the twentieth ACM PODS, 2001.
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD.
3. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD on Management of Data.
4. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the Twentieth VLDB, 1994.
5. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. k-anonymous patterns. Technical Report 2005-TR-17, ISTI - C.N.R., 2005.
6. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proceedings of the 6th PKDD, 2002.
7. P. Fule and J. F. Roddick. Detecting privacy and ethical sensitivity in data mining results. In Proc. of the 27th conference on Australasian computer science, 2004.
8. D. Hand, H. Mannila, and P. Smyh. Principles of Data Mining. The MIT Press, 2001.
9. M. Kantarcioglu, J. Jin, and C. Clifton. When do data mining results violate privacy? In Proceedings of the tenth ACM SIGKDD, 2004.
10. D. Knuth. Fundamental Algorithms. Addison-Wesley, Reading, Massachusetts, 1997.
11. S. R. M. Oliveira, O. R. Zaiane, and Y. Saygin. Secure association rule sharing. In Proc.of the 8th PAKDD, 2004.
12. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. ICDT'99, 1999.
13. J. Pei, J. Han, and J. Wang. Closet+: Searching for the best strategies for mining frequent closed itemsets. In SIGKDD'03, 2003.
14. L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty Fuzziness and Knowledge-based Systems, 10(5), 2002.
15. L. Sweeney. k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty Fuzziness and Knowledge-based Systems, 10(5), 2002.
16. V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis. State-of-the-art in privacy preserving data mining. SIGMOD Rec., 33(1):50-57, 2004.
17. M. J. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed itemsets mining. In 2nd SIAM International Conference on Data Mining, 2002.