Abstract
The standard formulation of association rules is suitable for describing patterns found in a given data set. These rules may each be adequately supported by the evidence, yet provide conflicting recommendations regarding an unseen instance when considered together. We proposed an alternative formulation called interval association rules, and developed a set of principles to adjudicate between conflicting rules.
This work was supported by NASA NCC2-1239 and ONR N00014-03-1-0516.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on the Management of Data, pp. 207–216 (1993)
Bayardo, R., Agrawal, R.: Mining the most interesting rules. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 145–154 (1999)
Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Proceedings of the ACM SIGMOD Conference on the Management of Data, pp. 265–276 (1997)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In: Proceedings of the ACM SIGMOD Conference on the Management of Data, pp. 13–23 (1996)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: Proceedings of the Third International Conference on Information and Knowledge Management, pp. 401–407 (1994)
Kyburg Jr., H.E., Teng, C.M.: Uncertain Inference. Cambridge University Press, Cambridge (2001)
Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 125–134 (1999)
Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 13–24 (1998)
Silberschatz, A., Tuzhilin, A.: What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering 8(6), 970–974 (1996)
Teng, C.M., Hewett, R.: Associations, statistics, and rules of inference. In: Proceedings of the International Conference on Artificial Intelligence and Soft Computing, pp. 102–107 (2002)
Teng, C.M.: A comparison of standard and interval association rules. In: Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference (2003) (to appear)
Zaki, M.J.: Generating non-redundant association rules. In: Proceedings of the Sixth ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 34–43 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Teng, C.M. (2003). From Competing Associations to Justifiable Conclusions. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_119
Download citation
DOI: https://doi.org/10.1007/978-3-540-45080-1_119
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40550-4
Online ISBN: 978-3-540-45080-1
eBook Packages: Springer Book Archive