"Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a ..."

Henrik Grosskreutz, Daniel Paurat (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-23780-5_44

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pkdd/GrosskreutzP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pkdd/GrosskreutzP11
Henrik Grosskreutz, Daniel Paurat:
Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space. ECML/PKDD (1) 2011: 533-548

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.