Secure Top-k Subgroup Discovery

DOI10.1007/978-3-642-19896-0_4zbMath1326.68223OpenAlexW1498452429MaRDI QIDQ3003501

Henrik Grosskreutz, Stefan Rüping, Benedikt Lemmen

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

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

Uses Software

• UCI-ml

Cites Work

• A proof of security of Yao's protocol for two-party computation
• ROC `n' rule learning -- towards a better understanding of covering algorithms
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Detecting group differences: Mining contrast sets
• Unnamed Item
• Unnamed Item

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