Non-redundant Subgroup Discovery Using a Closure System-Reference-Cited by-同舟云学术

Non-redundant Subgroup Discovery Using a Closure System

Published:2009 Issue: Volume: Page:179-194
ISSN:0302-9743
Container-title:Machine Learning and Knowledge Discovery in Databases
language:
Short-container-title:

Author:

Boley Mario,Grosskreutz Henrik

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04180-8_29

Reference17 articles.

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

2. Lecture Notes in Artificial Intelligence;M. Atzmüller,2006

3. Calders, T., Rigotti, C., Boulicaut, J.f.: A survey on condensed representations for frequent sets. In: Constraint Based Mining and Inductive Databases, pp. 64–80. Springer, Heidelberg (2005)

4. Cohen, W.W.: Fast effective rule induction. In: ICML, pp. 115–123 (1995)

5. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)

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

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

2. Information efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty;International Journal of Approximate Reasoning;2022-05

3. A Novel Pruning Strategy for Mining Discriminative Patterns;Iranian Journal of Science and Technology, Transactions of Electrical Engineering;2021-01-05

4. Identifying domains of applicability of machine learning models for materials science;Nature Communications;2020-09-04

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