FINDING OF REPEATED ITEMSETS USING GENETIC ALGORITHM

Abstract

Extracting high profit itemsets from a deed database allude to the finding of itemsets with high profits. In existing algorithms they acquire the difficulty of producing huge numbers of candidate itemsets reduces the extracting performance in conditions of time and memory requirement. This difficulty may become poorer when the database contains long transactions. Therefore utility pattern growth (UP - Growth) and UP - Growth+ method gives out compact frequent item sets that is comparatively a good result when compared to alrea dy existing method. Even though it gives out compact frequent itemsets, UP - Growth generates minimum utility itemsets and UP - Growth+ generates maximum utility itemsets. But there is a difficulty for the provider to find frequent itemsets based on profit fro m the entire dataset . By considering this problem, an innovative solution has been proposed for finding frequent itemsets from the entire database according to the customer purchase details. Our main aim is to view the frequent itemsets from the combinati on of minimum and maximum utility i temsets using GENETIC algorithm .

Authors and Affiliations

Kavya. T

Keywords

Related Articles

 Design and Performance Analysis of Patch Antennausing Metamaterial

 In this paper, a Symmetrical Rectangular Structure has been chosen to construct the metamaterial substrate due to the ability of constructing this shape, this structure produces a better performance compared to th...

 HARMONIC ANALYSIS OF ROTARY COMPRESSOR USING FEA

 Frequency response analysis is performed out under the application of the self weight of the rotary compressor as the force on the model with in the Frequency range of 0-100 Hz. This particular range is selected s...

 Multi-Physic Modeling and Simulation of a Hybrid Vehicle with Range Extender

 As the global economy begins to strain under the pressure of raising petroleum prices and environmental concerns, automobile manufacturers constantly strive to produce more fuel efficient and environmentally frien...

 Associators in the Nucleus of Antiflexible Rings

 In this paper, first we prove that if R is a semi prime third power associative ring of char ≠ 2 then either N = C or R is associative. Using this result we prove that if R is a simple third power associative anti...

 Analysis of Factors that Affect e-Governance

 e-Governance is an application of ICT (Information & Communication technology) to provide government services to its citizens and organizations. Punjab is one of the leading states in implementation of e-Gover...

Download PDF file
  • EP ID EP116967
  • DOI -
  • Views 52
  • Downloads 0

How To Cite

Kavya. T (30). FINDING OF REPEATED ITEMSETS USING GENETIC ALGORITHM. International Journal of Engineering Sciences & Research Technology, 4(7), 718-724. https://europub.co.uk/articles/-A-116967