Copyright © 2026 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{145483,
        author = {O. PRUDHVI and S. MUNI KUMAR},
        title = {Information Retrieval with Effective Web Document Clustering Using FP growth Algorithm},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {10},
        pages = {521-524},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145483},
        abstract = {The size of web has increased exponentially over the past few years with thousands of documents related to a subject accessible to the user. With this much quantity of data accessible, it's unfeasible to take the total advantage of the planet wide net without having a correct framework to search through the accessible data. This requisite organization can be done in many ways. During this paper we tend to introduce a combine approach to cluster the online pages that first finds the frequent sets so clusters the documents. These frequent sets area unit generated by using Frequent Pattern growth technique. We tend to found clusters having documents that are highly connected and have similar features. Experimental results show that our approach is more efficient.},
        keywords = {clusters, Frequency pattern growth algorithm, web.},
        month = {},
        }