Abstract
Finding patterns from data sets is a fundamental task of data mining. If we categorize all patterns into strong, weak, and random, conventional data mining techniques are designed only to find strong patterns, which hold for numerous objects and are usually consistent with the expectations of experts. While such strong patterns are helpful in prediction, the unexpectedness and contradiction exhibited by weak patterns are also very useful although they represent a relatively small number of objects. In this paper, we address the problem of finding weak patterns (i.e., reliable exceptions) from databases. A simple and efficient approach is proposed which uses deviation analysis to identify interesting exceptions and explore reliable ones. Besides, it is flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a set of real-life data sets, and present interesting findings.
on leave from School of Computing, National University of Singapore.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 207–216, Washington D.C., USA, May 1993.
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th Conference on Very Large Data Bases, pages 478–499, Santiago, Chile, September 1994.
W. Frawely, G. Piatesky-Shapiro, and C. Matheus. Knowledge Discovery in database: an overview. G. Piatesky-Shapiro and W. Frawley (eds.) Knowledge Discovery in Database, AAAI/MIT Press, 1991.
B.R. Gaines. An ounce of knowledge is worth a ton of data. In A.M. Segre, editor, Proceedings of The Sixth International Workshop on Machine Learning, pages 156–159. Morgan Kaufmann Publishers, Inc., 1989.
M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and I. Verkamo. Finding interesting rules from large sets of discovered association rules. In Proc. of the Third International Conference on Information and Knowledge Management, pages 401–407, November 1994.
B. Liu, W. Hsu, and S. Chen. Using general impression to analyze discovered classification rules. In Proc. of the Third International Conference on Knowledge Discovery and Data Mining, pages 31–36, Newport Beach, California, USA, 1997.
C. Matheus, G. Piatetsky-Shapiro, and D. McNeil. An application of KEFIR to the analysis of healthcare information. In Proc. of the Eleventh International Conference on Artificial Intelligence, Workshop on Knowledge Discovery in Databases, pages 25–36,., 1994.
C. Merz and P. Murphy. UCI repository of machine learning databases. Technical Report http://www.ics.uci.edu/ mlearn/MLRepository.html.Irvine, CA: University of California, Department of Information and Computer Science, 1996.
B. Padmanabhan and A. Tuzhilin. A belief-driven method for discovering unexpected patterns. In Proc. of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 27–31, April 1998.
G. Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. G. Piatesky-Shapiro and W. Frawley (eds.) Knowledge Discovery in Database, AAAI/MIT Press, 1991.
G. Piatetsky-Shapiro and C. Matheus. The interestingness of deviations. In AAAI Workshop on Knowledge Discovery in Database, pages 25–36, Seattle, Washington, July 1994.
J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kauffmann Publishers, Inc., 1993.
A. Silberschatz and A. Tuzhilin. On subjective measures of interestingness in knowledge discovery. In Proc. of the First International Conference on Knowledge Discovery and Data Mining, pages 275–281, Montreal, 1995.
A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Trans. on Knoweldge and Data Engineering, 8(6):970–974, 1996.
P. Smith. Into Statistics. Springer-Verlag, Singapore, 1998.
E. Suzuki. Autonomous discovery of reliable exception rules. In Proc. of the 3rd International Conference on Knowledge Discovery and Data Mining, pages 259–263, Newport Beach, CA, USA., August 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Lu, H., Feng, L., Hussain, F. (1999). Efficient Search of Reliable Exceptions. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-48912-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65866-5
Online ISBN: 978-3-540-48912-2
eBook Packages: Springer Book Archive