Arno J. Knobbe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Rob M. Konijn

> Home > Persons > Arno J. Knobbe

Publications

2015
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/jiis/KonijnDMK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jiis/KonijnDMK15
Rob M. Konijn, Wouter Duivesteijn, Marvin Meeng, Arno J. Knobbe:
Cost-based quality measures in subgroup discovery. J. Intell. Inf. Syst. 45(3): 337-355 (2015)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/kais/MampaeyNFKK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kais/MampaeyNFKK15
Michael Mampaey, Siegfried Nijssen, Ad Feelders, Rob M. Konijn, Arno J. Knobbe:
Efficient algorithms for finding optimal binary features in numeric and nominal labeled data. Knowl. Inf. Syst. 42(2): 465-492 (2015)
2013
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/pakdd/KonijnDKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pakdd/KonijnDKK13
Rob M. Konijn, Wouter Duivesteijn, Wojtek Kowalczyk, Arno J. Knobbe:
Discovering Local Subgroups, with an Application to Fraud Detection. PAKDD (1) 2013: 1-12
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/pakdd/KonijnDMK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pakdd/KonijnDMK13
Rob M. Konijn, Wouter Duivesteijn, Marvin Meeng, Arno J. Knobbe:
Cost-Based Quality Measures in Subgroup Discovery. PAKDD Workshops 2013: 404-415

a service of

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.