A further study on inverse frequent set mining

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

Volumn 3584 LNAI, Issue , 2005, Pages 753-760

  Chen, Xia ^a,b   Orlowska, Maria ^b  

^a TIANJIN UNIVERSITY   (China)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Equivalent Relation; Inverse Frequent Set Mining; Privacy Preserving Data Sharing

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; SECURITY OF DATA;

EQUIVALENT RELATION; INVERSE FREQUENT SET MINING; PRIVACY PRESERVING DATA SHARING;

DATA MINING;

EID: 26944445367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11527503_89     Document Type: Conference Paper

References (4)

1. Mielikainen, T.: Inverse frequent set mining. In: IEEE ICDM Workshop on Privacy Preserving Data Mining, Melbourne, Florida, USA, IEEE (2003) 18-23
2. Calders, T.: Computational complexity of itemset frequency satisfiability. In: the 23nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database System, ACM Press (2004)
3. Ramesh, G., Maniatty, W., Zaki, M.: Feasible itemset distribution in data mining: theory and application. In: the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, San Diego, CA (2003) 284-295
4. Lukasiewicz, Thomas: Probabilistic logic programming with conditional constraints. ACM Transactions on Computational Logic (TOCL) 2 (July 2001)