A new algorithm for finding minimal sample uniques for use in statistical disclosure assessment

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 290-297

  Manning, A M ^a   Haglin, D J ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b MINNESOTA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS;

DATASETS; MINIMAL SAMPLE UNIQUES (MSU);

RECURSIVE FUNCTIONS;

EID: 34548573352     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.10     Document Type: Conference Paper

References (13)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 International Conference on Management of Data (SIGMOD 93), pages 207-216, May 1993.
2. A. Arning, R.Agrawal, and P. Raghavan. A linear method for deviation detection in large databases. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Or., pages 164-169. AAAI Press, 1996.
3. L. Brankovic, M. Miller, and J. Siran. Towards a practical auditing method for the prevention of statistical database compromise. In Proceedings of the Australasian Database Conference, pages 177-184, 1996.
4. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings ICDE 2001, pages 443-452, 2001.
5. M. J. Elliot. A new approach to the measurement of statistical disclosure risk. International Journal of Risk Management, 2(4), 2000.
6. M. J. Elliot, A. M. Manning, and R. W. Ford. A computational algorithm for handling the special uniques problem. International Journal of Uncertainty, Fuzziness and Knowledge Based Systems, 10(5):493-509, 2002.
7. V. Estivill-Castro and L. Brankovic. Data swapping: Balancing privacy against precision in mining for logic rules. In Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery DaWak'99 (as a DEXA-Conference along with the 10th International Conference on Data and Expert Systems Applications) Florence, Italy, pages 389-398, August 1999.
8. S. E. Fienberg and U. E. Makov. Confidentiality uniqueness and disclosure limitation for categorical data. Journal of Official Statistics, 4(4), 1998.
9. G. Merz and P. Murphy. Uci repository of machine learning databases. Technical Report, University of California, Department of Information and Computer Science: http://www.ics.uci.edu/mlearn/MLRepository.html, 1996.
10. L. F. S. Labour force survey, available at: http//www.esds.ac.uk/ government/lfs/.
11. S. A. R. S. The samples of anonymised records, available at: http//www.ccsr.ac.uk/sars/.
12. C. J. Skinner and D. J. Holmes. Estimating the reidentification risk per record. Journal of Official Statistics, 14(4):361-372, 1998.
13. A. Takemura. Minimum unsafe and maximum safe sets of variables for disclosure risk assessment of individual records in a microdata set. Journal of the Japan Statistical Society, 32(1): 107-117, 2002.