A user-driven process for mining association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1910, Issue , 2000, Pages 483-489

  Kuntz, Pascale ^a   Guillet, Fabrice ^a   Lehn, Rémi ^a   Briand, Henri ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DIGITAL STORAGE; HEURISTIC ALGORITHMS;

MINING ALGORITHMS; MINING ASSOCIATIONS; RULE EXTRACTION; STATISTICAL MEASURES; USER DRIVEN;

DATA MINING;

EID: 84974719207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_55     Document Type: Conference Paper

References (19)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.-I. Verkamo. Fast discovery of association rules. In Fayyad et al. [10], pages 307-328.
2. I. Bandhari. Attribute focussing: machine-assisted knowledge discovery applied to software production process control. Knowledge Acquisition, 6: 271-294, 1994.
3. J. Bertin. Graphics and Graphic Information Processing. Berlin: Springer, 1981.
4. G. Birkoff. Lattice Theory. A.M.S, 1967.
5. J.R. Brachman and T. Anand. The process of knowledge discovery in databases: a human-centered approach. In Fayyad et al. [10], pages 37-58.
6. C. Brunk, J. Kelly, and R. Kohavi. Mineset: An integrated system for data mining. In Proc. of the 3rd Int. Conf on Knowledge Discovery and Data Mining, pages 135-139. AAAI Press, 1997.
7. W. Buntine. Graphical models for discovering knowledge. In Fayyad et al. [10], pages 59-82.
8. V. Duquenne. Latticial structures in data analysis. Theoretical Computer Science, 217(2): 407-436, 1999.
9. P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11: 379-403, 1994.
10. U.M. Fayyad, G. Piatetsky-Sapiro, and P. Smyth. From data mining to knowledge discovery. In U.M. Fayyad, G. Piatetsky-Sapiro, and P. Smyth, editors, Advances in Knowledge Discovery and Data Mining, pages 2-34. AAAI Press, 1996.
11. th Int. Conf. on Database and Expert System App., pages 405-414, 1995.
12. R. Gras, H. Briand, and P. Peter. Structuration sets with implication intensity. In Proc. of the Int. Conf. on Ordinal and Symbolic Data Analysis, pages 147-156, 1996.
13. S. Guillaume, F. Guillet, and J. Philipp. Improving the discovery of association rules with intensity of implication. In Proc. of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, pages 318-327. Lect. Notes in Comp. Sc., Springer-Verlag, 1998.
14. th Int. Conf. on Industrial and Engineering App. AI and Expert Sys., pages 145-154. Lect. Notes in Comp. Sc., Springer-Verlag, 1999.
15. A. Gunoche. Building the galois lattice of a binary relation (in french). Math matiques, Informatique et Sciences Humaines, 109: 41-53, 1990.
16. D.A. Keim and H.-P. Kriegel. Visualization techniques for mining large databases: A comparison. Trans. on Knowledge and Data Engineering, Special Issue on Data Mining, 8(6): 923-938, 1996.
17. th Mini Euro Conf.: Human Centered Processes. Brest: Ecole Nationale Sup rieure des T l communications de Bretagne, 1999.
18. J. Philippé, T. Teusan, S. Baquedano, and C. Bourcier. The implicative analysis in a knowledge extraction context for perfecting decision aid systems in behavioral analysis (in french). In Actes des journ es sur La fouille dans les donn es par l’analyse implicative (to appear), 2000.
19. O. Svenson. Decision rules and information processing in decision making. In Human decision making. Bodafors: Bodaforlaget Doxa, 1983.