Abstract
The Association rule mining is one of the recent data mining research. Mining frequent itemsets in relational databases using relational queries give great attention to researchers nowadays. This paper implements modified set oriented algorithm for mining frequent itemsets in relational databases. In this paper, the sort and merge scan algorithm SETM (Houtsma and Swami, IEEE 25–33 (1995)) [1] is implemented for super market data set which is further improved by integrating transaction reduction technique. Our proposed algorithm Improved SETM (ISETM) generate the frequent itemsets from the database and find its execution time. Finally the performance of the algorithm is compared with the traditional Apriori and SETM 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
References
Houtsma M, Swami A. Set oriented mining for association rules in relational databases. IEEE;1995:25–33.
Agrawal R, Imielinski T, Swami A. Database mining: a performance perspective. IEEE Trans Knowl Data Eng. Special issue on Learning and Discovery in Knowledge-Based Databases. 1993;5(6): 914–25.
Anwar TM, Beck HW, Navathe SB. Knowledge mining by imprecise querying: a classification-based approach. In: IEEE 8th international conference on data engineering;1992.
Michalski RS, Kerschberg L, Kaufman KA, Ribeiro JS. Mining for knowledge in databases: the INLEN architecture, initial implementation, and first results. J Intell Inf Syst. 1992;1:85–113.
Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of ACM-S1GMOD international conference on management of data. 1993;207–16.
Umarani V, Punithavalli M. A study on effective mining of association rules from huge databases. IJCSR. 2012;1(1).
Kerana Hanirex D, Kaliyamurthie KP. Mining frequent itemsets using genetic algorithm. Middle-East J Sci Res. 2014;19(6):807–10.
Kerana Hanirex D, Kaliyamurthie KP Dr. Finding the dominating amino acids in dengue virus type1 study on mining frequent itemsets. Int J Pharma Bio Sci. 2013;4(3)(B):880–9.
Kerana Hanirex D, Kaliyamurthie KP Dr. Multi-classification approach for detecting thyroid attacks. Int J Pharma Bio Sci. 2012;4(3)(B):1246–51.
Kerana Hanirex D. A comparative analysis on mining frequent itemsets. Int J Adv Res Comput Sci Electron Eng (IJARCSEE). 2012;1(10):68–71.
Kerana Hanirex D, Kumaravel A Dr. An efficient partition and two dimensional approach for mining frequent itemsets. Int J Technol Synth Anal (IJTSA). 2012;1(1):14–7.
Kerana Hanirex D, Dorai Rengaswamy MA. Efficient algorithm for mining frequent itemsets using clustering techniques. IJCSE. 2011;3(3):1028–32.
Kerana Hanirex D. Association rule mining in distributed database system. Int J Comput Sci Mob Comput (IJCSMC). 2014;3(4):727–32.
Kerana Hanirex D. An efficient TDTR algorithm for mining frequent itemsets. Int J Electron Comput Sci Eng. 2012;2(1):251–6.
Piatesky-Shapiro G. Discovery, analysis and presentation of strong association rules. In knowledge discovery in databases. AAAI/MITPress;1991. p. 229–48.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Kerana Hanirex, D., Kaliyamurthie, K.P. (2016). Mining Frequent Itemsets in Association Rule Mining Using Improved SETM Algorithm. In: Dash, S., Bhaskar, M., Panigrahi, B., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 394. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2656-7_70
Download citation
DOI: https://doi.org/10.1007/978-81-322-2656-7_70
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2654-3
Online ISBN: 978-81-322-2656-7
eBook Packages: EngineeringEngineering (R0)