Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space-Reference-Cited by-同舟云学术

Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space

Published:2011 Issue: Volume: Page:533-548
ISSN:0302-9743
Container-title:Machine Learning and Knowledge Discovery in Databases
language:
Short-container-title:

Author:

Grosskreutz Henrik,Paurat Daniel

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-642-23780-5_44

Reference22 articles.

1. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)

2. Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description. In: Proc. of the LeGo Workshop at ECML-PKDD (2009)

3. Lecture Notes in Computer Science;M. Atzmueller,2009

4. Lecture Notes in Computer Science;M. Boley,2009

5. Bringmann, B., Nijssen, S., Zimmermann, A.: Pattern based classification: a unifying perspective. In: LeGo Worskhop Colocated with ECML/PKDD (2009)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A scalable, distributed framework for significant subgroup discovery;Knowledge-Based Systems;2024-01

2. Discovering Diverse Top-K Characteristic Lists;Advances in Intelligent Data Analysis XXI;2023

3. Uni- and multivariate probability density models for numeric subgroup discovery;Intelligent Data Analysis;2020-12-18

4. Actionable Subgroup Discovery and Urban Farm Optimization;Lecture Notes in Computer Science;2020

5. Optimal Subgroup Discovery in Purely Numerical Data;Advances in Knowledge Discovery and Data Mining;2020