Minimizing information loss and preserving privacy

Management Science

Volumn 53, Issue 1, 2007, Pages 101-116

  Menon, Syam ^a   Sarkar, Sumit ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Hiding patterns; Itemset mining; Sanitization; Sensitive itemsets

Indexed keywords

DATA GENERATOR; HIDING PATTERNS; ITEMSET MINING; SANITIZATION; SENSITIVE ITEMSETS;

DATA ACQUISITION; DATA PRIVACY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SANITARY ENGINEERING;

SECURITY OF DATA;

EID: 33847045247     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0603     Document Type: Article

References (22)

1. Agrawal, R., R. Srikant. 1994. Fast algorithms for mining association rules in large databases. Proc. 20th Internat. Conf. Very Large Databases, Morgan Kaufmann, San Francisco, CA, 487-499.
2. Atallah, M., E. Bertino, A. Elmagarmid, M. Ibrahim, V. Verykios. 1999. Disclosure limitation of sensitive rules. Proc. 1999 Workshop Knowkdge Data Engrg. Exchange, 1999 (KDEX '99), IEEE Computer Society, Washington, D.C., 45-52.
3. Atamtürk, A., M. Savelsbergh. 2005. Integer programming software systems. Ann. Oper. Res. 140 67-124.
4. Bradley, S., A. Max, T. Magnanti. 1977. Applied Mathematical Programming. Addison-Wesley, Reading, MA.
5. Brijs, T., G. Swinnen, K. Vanhoof, G. Wets. 1999. The use of association rules for product assortment decisions: A case study. Proc. Fifth ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining, ACM Press, New York, 254-260.
6. Choudhury, S., G. Duncan, R. Krishnan, S. Roehrig, S. Mukherjee. 1999. Disclosure detection in multivariate categorical databases: Auditing confidentiality protection through two new matrix operators. Management Sci. 45(12) 1710-1723.
7. Deshpande, M., G. Karypis. 2002. Using conjunction of attribute values for classification. CIKM '02: Proc. Eleventh Internat. Conf. Inform. Knowledge Management, McLean, VA. ACM Press, New York, 356-364.
8. Duncan, G., S. Mukherjee. 2000. Optimal disclosure limitation strategy in statistical databases: Deterring tracker attacks through additive noise. J. Amer. Statist. Assoc. 95(451) 720-729.
9. Fischetti, M., C. Polo, M. Scantamburlo. 2004. A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2) 61-72.
10. Garfinkel, R., R. Gopal, P. Goes. 2002. Privacy protection of binary confidential data against deterministic, stochastic, and insider threat. Management Sci. 48(6) 749-764.
11. Goethals, B. 2002. Efficient frequent pattern mining. Ph.D. thesis, Universiteit Limburg, Diepenbeek, Belgium.
12. Grean, M., M. Shaw. 2005. Supply-chain integration through information sharing: Channel partnership between Wal-Mart and Procter & Gamble. IT Management Case, Center for IT and e-Business Management, University of Illinois at Urbana-Champaign, Champaign, IL.
13. Gruman, G. 2005. Supply on demand: Manufacturers need to know what's selling before they can produce and deliver their wares in the right quantities. InfoWorld.com. http://www.lnfoworld.com/article/05/04/18/16FEsupplychain_2. html.
14. Heun, C. 2001. When to share: Wal-Mart and other companies reassess their data-sharing strategies. InformationWeek.com. http://www. informationweek.com/838/data.htm.
15. ILOG. 2003. ILOG CPLEX 9.0 User's Manual. ILOG Inc., Gentilly, France.
16. Li, W., J. Man, J. Pei. 2001. CMAR: Accurate and efficient classification based on multiple class-association rules. ICDM '01: Proc. First IEEE Internat. Conf. Data Mining (ICDM '01), IEEE Computer Society, Washington, D.C., 369-376.
17. McDougall, P. 2001. Collaborative business: Companies that dare to share information are cashing in on new opportunities. InformationWeek.com. http://informationweek.com/836/collaborate.htm.
18. Menon, S., S. Sarkar, S. Mukherjee. 2005. Maximizing accuracy of shared databases when concealing sensitive patterns. Inform. Systems Res. 16(3) 256-270.
19. Oliveira, S., O. Zaïane. 2002. Privacy preserving frequent itemset mining. Proc. IEEE ICDM Workshop Privacy, Security Data Mining, Australian Computer Society, Sydney, Australia, 43-54.
20. Sarathy, R., K. Muralidhar. 2002. The security of confidential numerical data in databases. Inform. Systems Res. 13(4) 389-403.
21. Verykios, V., A. Elmagarmid, E. Bertino, Y. Saygin, E. Dasseni. 2004. Association rule hiding. IEEE Trans. Knowledge Data Engrg. 16(4) 434-147.
22. Yang, Y., B. Padmanabhan. 2005. GHIC: A hierarchical pattern-based clustering algorithm for grouping web transactions. IEEE Trans. Knowledge Data Engrg. 17(9) 1300-1304.