Abstract
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets and identify the relationships among transactions using binary values. But in real applications, different items may have different criteria to judge its importance and quantitative data may exist. In this paper, we thus propose a fuzzy mining algorithm for discovering useful fuzzy association rules under the maximum support constraints. Items may have different minimum supports and the minimum support for an itemset is set as the maximum of the minimum supports of the items contained in the itemset. Under the constraint, the characteristic of level-by-level processing is kept, such that the original Apriori algorithm can be easily extended to find the large itemsets. An example is also given to illustrate the proposed algorithm.
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., Imielinksi, T., Swami, A.: Mining association rules between sets of items in large database. In: The ACM SIGMOD Conference, Washington, pp. 207–216 (1993)
Cai, C.H., Fu, W.C., Cheng, C.H., Kwong, W.W.: Mining association rules with weighted items. In: The International Database Engineering and Applications Symposium, pp. 68–77 (1998)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Mining optimized association rules for numeric attributes. In: The ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 182–191 (1996)
Hong, T.P., Kuo, C.S., Chi, S.C.: Mining association rules from quantitative data. Intelligent Data Analysis 3(5), 363–376 (1999)
Lee, Y.C., Hong, T.P., Lin, W.Y.: Mining association rules with multiple minimum supports using maximum constraints. In: The Workshop on the Foundation of Data Mining and Discovery in The 2002 IEEE International Conference on Data Mining, pp. 171–175 (2002)
Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: Proceedings of the 1999 International Conference on Knowledge Discovery and Data Mining, pp. 337–341 (1999)
Rastogi, R., Shim, K.: Mining optimized association rules with categorical and numeric attributes. In: The 14th IEEE International Conference on Data Engineering, Orlando, pp. 503–512 (1998)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: The 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Canada, pp. 1–12 (1996)
Wang, K., Han, Y.H.: Mining frequent itemsets using support constraints. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 43–52 (2000)
Yuan, Y., Shaw, M.J.: Induction of fuzzy decision trees. Fuzzy Sets and Systems 69(2), 125–139 (1995)
Yue, S., Tsang, E., Yeung, D., Shi, D.: Mining fuzzy association rules with weighted items. In: The IEEE International Conference on Systems, Man and Cybernetics, pp. 1906–1911 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, YC., Hong, TP., Lin, WY. (2004). Mining Fuzzy Association Rules with Multiple Minimum Supports Using Maximum Constraints. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30133-2_171
Download citation
DOI: https://doi.org/10.1007/978-3-540-30133-2_171
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23206-3
Online ISBN: 978-3-540-30133-2
eBook Packages: Springer Book Archive