Abstract
This paper describes the components of a human-centered process for discovering association rules where the user is considered as a heuristic which drives the mining algorithms via a well-adapted interface. In this approach, inspired by experimental works on behaviors during a discovery stage, the rule extraction is dynamic : at each step, the user can focus on a subset of potentially interesting items and launch an algorithm for extracting the relevant associated rules according to statistical measures. The discovered rules are represented by a graph updated at each step, and the mining algorithm is an adaptation of the well-known A Priori algorithm where rules are computed locally. Experimental results on a real corpus built from marketing data illustrate the different steps of this process.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
I. Bandhari. Attribute focussing: machine-assisted knowledge discovery applied to software production process control. Knowledge Acquisition, 6:271–294, 1994.
J. Bertin. Graphics and Graphic Information Processing. Berlin: Springer, 1981.
G. Birkoff. Lattice Theory. A.M.S, 1967.
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.
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.
W. Buntine. Graphical models for discovering knowledge. In Fayyad et al. [10], pages 59–82.
V. Duquenne. Latticial structures in data analysis. Theoretical Computer Science, 217(2):407–436, 1999.
P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379–403, 1994.
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.
L. Fleury, H. Briand, J. Philippé, and C. Djeraba. Rule evaluation for knowledge discovery in databases. In Proc. of the 6th Int. Conf. on Database and Expert System App., pages 405–414, 1995.
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.
S. Guillaume, F. Guillet, and J. Philipp. Improving the discovery of associationrules 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.
F. Guillet, P. Kuntz, and R. Lehn. A genetic algorithm for visualizing networks of association rules. In Proc. of the 12th Int. Conf. on Industrial and Engineering App. AI and Expert Sys., pages 145–154. Lect. Notes in Comp. Sc., Springer-Verlag, 1999.
A. Gu noche. Building the galois lattice of a binary relation (in french). Mathmatiques, Informatique et Sciences Humaines, 109:41–53, 1990.
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.
P. Lenca, editor. Proc. of the 10th Mini Euro Conf.: Human Centered Processes. Brest: Ecole Nationale Sup rieure des T l communications de Bretagne, 1999.
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 parl’analyse implicative (to appear), 2000.
O. Svenson. Decision rules and information processing in decision making. In Human decision making. Bodafors: Bodaforlaget Doxa, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuntz, P., Guillet, F., Lehn, R., Briand, H. (2000). A User-Driven Process for Mining Association Rules. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_55
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive