Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data-Reference-Cited by-同舟云学术

Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data

Published:2005 Issue: Volume: Page:33-45
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Besson Jérémy,Robardet Céline,Boulicaut Jean-François

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-31841-5_3

Reference21 articles.

1. Becquet, C., Blachon, S., Jeudy, B., Boulicaut, J.-F., Gandrillon, O.: Strong association rule mining for large gene expression data analysis: a case study on human SAGE data. Genome Biology 12 (2002) See, http://genomebiology.com/2002/3/12/research/0067

2. Berry, A., Bordat, J.-P., Sigayret, A.: Concepts can not afford to stammer. In: Proceedings JIM 2003, Metz, France, September 2003, pp. 25–35 (2003)

3. Lecture Notes in Artificial Intelligence;J. Besson,2004

4. Besson, J., Robardet, C., Boulicaut, J.-F., Rome, S.: Constraint-based bi-set mining for biologically relevant pattern discovery in microarray data. Intelligent Data Analysis journal 9 (2004) (in press)

5. Lecture Notes in Computer Science;J.-F. Boulicaut,2000

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

1. Edge Selection in a Noisy Graph by Concept Analysis: Application to a Genomic Network;Data Science, Learning by Latent Structures, and Knowledge Discovery;2015

2. Two Measures of Objective Novelty in Association Rule Mining;New Frontiers in Applied Data Mining;2010

3. Finding Top-N Pseudo Formal Concepts with Core Intents;Machine Learning and Data Mining in Pattern Recognition;2009

4. Constraint-Based Mining of Fault-Tolerant Patterns from Boolean Data;Lecture Notes in Computer Science;2006

5. Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery;Conceptual Structures: Inspiration and Application;2006