Comparison of Algorithms of Associative Rules Search Apriori and Fp-Growth for Investigation of Time Dependence of Their Execution on Database Parameters | IEEE Conference Publication | IEEE Xplore

Comparison of Algorithms of Associative Rules Search Apriori and Fp-Growth for Investigation of Time Dependence of Their Execution on Database Parameters


Abstract:

The research is devoted to a comprehensive study and comparison of algorithms FP-growth and APriori. These algorithms are used in modern areas such as: contextual adverti...Show More

Abstract:

The research is devoted to a comprehensive study and comparison of algorithms FP-growth and APriori. These algorithms are used in modern areas such as: contextual advertising, creation of recommendations, big data extraction, etc. That is why the study of the feasibility of using specific search algorithms for frequent sets and their comparison is an important task. In the research the substantiation of expediency of using one of the above algorithms depending on the size and other parameters of the database, which is being investigated is created. These and other results obtained in this scientific work can be used to facilitate the task of choosing the algorithm for searching for associative rules after determining the database under study.
Date of Conference: 22-25 September 2021
Date Added to IEEE Xplore: 27 December 2021
ISBN Information:

ISSN Information:

Conference Location: LVIV, Ukraine

References

References is not available for this document.