Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{158719,
        author = {S.V.Subramanyam},
        title = {Frequent Item Set using  mining Technique},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {10},
        pages = {986-988},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=158719},
        abstract = {Frequent pattern mining has been a focused theme in data mining research for over a decade. Abundant literature has been dedicated to this research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemsets mining in transaction databases to numerous research frontiers, such as sequential pattern mining, structured pattern mining, correlation mining, associative classification, and frequent pattern-based clustering, as well as their broad applications. In this paper, we develop a new technique for more efficient pattern mining. Our method find frequent 1-itemset and then uses the heap tree sorting we are generating frequent patterns, so that many. We present efficient techniques to implement the new approach.},
        keywords = {Data mining; Frequent Pattern mining; Support; Min Heap; Data structure},
        month = {},
        }