Secure Top-k Subgroup Discovery

DOI10.1007/978-3-642-19896-0_4MaRDI QIDQ3003501zbMATH OpenOpenAlexFDO

Authors Henrik Grosskreutz, Benedikt Lemmen, Stefan Rüping

Publication date 27 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19896-0_4

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Privacy-preserving group discovery with linear complexity
• scientific article; zbMATH DE number 1910393
• scientific article; zbMATH DE number 1808262
• Subgroup security in pairing-based cryptography
• Advances in Cryptology - EUROCRYPT 2004

Cites work

• A proof of security of Yao's protocol for two-party computation
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Detecting group differences: Mining contrast sets
• scientific article; zbMATH DE number 1759770 (Why is no real title available?)
• ROC `n' rule learning -- towards a better understanding of covering algorithms
• Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining

Cited in

(1)

• Robust subgroup discovery. Discovering subgroup lists using MDL

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Secure Top-k Subgroup Discovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003501)