Abstract
Association rule discovery is an important technique for mining knowledge from large databases. Data mining researchers have studied subjective measures of interestingness to reduce the volume of discovered rules and to improve the overall efficiency of the knowledge discovery in databases process (KDD). The objective of this paper is to provide a framework that uses subjective measures of interestingness to discover interesting patterns from association rules algorithms. The framework works in an environment where the medical databases are evolving with time. In this paper we consider a unified approach to quantify interestingness of association rules. We believe that the expert mining can provide a basis for determining user threshold which will ultimately help us in finding interesting rules. The framework is tested on public datasets in medical domain and results are promising.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kauffmann Publishers, San Francisco (2001)
Dunham, M.H.: Data Mining: Introductory and Advanced Topics, 1st edn. Pearson ygEducation (Singapore) Pte. Ltd (2003)
Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. Prentice-Hall of India Private Limited, India (2001)
Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Adaptive Constraint Pushing in Frequent Pattern Mining. In: Proceedings of the 17th European Conference on PAKDD 2003 (2003)
Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized Level-wise Frequent pattern Mining with Monotone Constraints. In: Proceedings of the 3rd International Conference on Data Mining (ICDM 2003) (2003)
Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: Anticipated Data Reduction in Constrained Pattern Mining. In: Proceedings of the 7th PAKDD 2003 (2003)
Freitas, A.A.: On Rule Interestingness Measures. Knowledge-Based Systems 12, 309–315 (1999)
Klemetinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In: Proceedings of the 3rd International Conference on Information and Knowledge Management, Gaithersburg, Maryland (1994)
Liu, B., Hsu, W., Chen, S., Ma, Y.: Analyzing the Subjective Interestingness of Association Rules. IEEE Intelligent Systems (2000)
Liu, B., Hsu, W.: Post Analysis of Learned Rules. In: Proceedings of the 13th National Conference on AI (AAAI 1996) (1996)
Liu, B., Hsu, W., Lee, H.-Y., Mum, L.-F.: Tuple-Level Analysis for Identification of Interesting Rules. Technical Report TRA5/95, SoC. National University of Singapore, Singapore (1996)
Liu, B., Hsu, W.: Finding Interesting Patterns Using User Expectations. DISCS Technical Report (1995)
Liu, B., Hsu, W., Chen, S.: Using General Impressions to Analyze Discovered Classification Rules. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data mining (KDD 1997) (1997)
Padmanabhan, B., Tuzhilin, A.: Unexpectedness as a Measure of Interestingness in Knowledge Discovery. Working paper # IS-1997. Dept. of Information Systems, Stern School of Business, NYU (1997)
Padmanabhan, B., Tuzhilin, A.: A Belief-Driven Method for Discovering Unexpected Patterns. In: KDD 1998 (1998)
Padmanabhan, B., Tuzhilin, A.: Small is Beautiful: Discovering the Minimal Set of Unexpected Patterns. In: KDD 2000 (2000)
Piatetsky-Shapiro, G., Matheus, C.J.: The Interestingness of Deviations. In: Proceedings of AAAI Workshop on Knowledge Discovery in Databases (1994)
Piatetsky-Shapiro, G.: Discovery, Analysis, and Presentation of Strong Rules. In: Knowledge Discovery in Databases. The AAAI Press, Menlo Park (1991)
Psaila, G.: Discovery of Association Rule Meta-patterns. In: Mohania, M., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol. 1676, pp. 219–228. Springer, Heidelberg (1999)
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: ACM SIGMOD Conference of Management of Data, Washington D.C (1993)
Silberschatz, A., Tuzhilin, A.: On Subjective Measures of Interestingness in Knowledge Discovery. In: Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (1995)
Silberschatz, A., Tuzhilin, A.: What Makes Patterns Interesting in Knowledge Discovery Systems. IEEE Trans. and Data Engineering 5(6) (1996)
Suzuki, E., Kodratoff, Y.: Discovery of Surprising Exception Rules Based on Intensity of Implication. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS (LNAI), vol. 1510. Springer, Heidelberg (1998)
Liu, B., Hsu, W., Chen, S., Ma, Y.: Analyzing the Subjective Interestingness of Association Rules. IEEE Intelligent Systems (2000)
Al-Hegami, A.S., Bhatnagar, V., Kumar, N.: Novelty Framework for Knowledge Discovery in Databases. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, pp. 48–57. Springer, Heidelberg (2004)
Bhatnagar, V., Al-Hegami, A.S., Kumar, N.: Novelty as a Measure of Interestingness in Knowledge Discovery. International Journal of Information Technology 2(1) (2005)
Kovalerchuk, B., Triantaphyllou, E., Despande, A., Vtyaev, E.: Interactive Learning of Monotone Boolean Function. Information Sciences 94(1-4), 87–118 (1996)
Hansel, G.: Sur le nombre des functions Boolenes Monotones den variables. C.R. Acad. Sci. 262(20), 1088–1090 (1966) (in French)
Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques with Java implementations. Morgan Kaufmann, San Francisco (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaur, H., Wasan, S.K., Al-Hegami, A.S., Bhatnagar, V. (2006). A Unified Approach for Discovery of Interesting Association Rules in Medical Databases. In: Perner, P. (eds) Advances in Data Mining. Applications in Medicine, Web Mining, Marketing, Image and Signal Mining. ICDM 2006. Lecture Notes in Computer Science(), vol 4065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11790853_5
Download citation
DOI: https://doi.org/10.1007/11790853_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36036-0
Online ISBN: 978-3-540-36037-7
eBook Packages: Computer ScienceComputer Science (R0)