METHOD FOR ASSOCIATIVE RULES SEARCH
DOI:
https://doi.org/10.24025/2306-4412.3.2019.176909Keywords:
transaction, associations, associative rules, data arrayAbstract
With the appearance of large volumes of stored information, the tasks related to the need of their processing become urgent. Artificial intelligence methods are used to analyze various kinds of data. Accumulating data is characterized by disordered and unstructured data when each storage unit cannot be represented by a finite number of features. In recent years, associative rule search methods have been widely used to process large arrays of unstructured data. The problem is that the number of possible associations with the increase of the number of items in each of the transactions increases exponentially and requires considerable computational cost. Therefore, in the process of associative rules formation, the techniques, which allow to reduce the number of associations that need to be analyzed, are widely used. The purpose of this work is to develop a methodology for finding associative rules based on preliminary analysis and compression of an array of transactions representing different subject sets. The paper proposes an approach to the formation of a sample of items most characteristic for a simplified array of transactions, on the basis of which associative binary relations are formed and their characteristics are calculated to determine whether such relations are rules. To do this, the array is first compressed by searching for transactions with the same subject sets using an equivalence relation. Then, to detect transactions with recurring items, a pairwise intersection of the subject sets is performed.
At the initial stage of formation, the transaction database is an array of disordered data that needs to be structured and classified by the number of subject sets. As a result of research, the paper offers a method of finding associative rules, which are based on the procedures of "compressing" the original array of transactions to their entry in the database.
References
T. A. Zaiko, A. A. Oleinik, and S. A. Subbotin, "Associative rules in data mining", Visnyk Natsionalnoho tekhnichnoho universytetu «KhPI». Informatyka ta modeliuvannia, no. 39, pp. 82-96, 2013 [in Russian].
A. Shved, and Ye. Davydenko, "The analysis of uncertainty measures with various types of evidence", in 2016 IEEE First Internat. Conf. on Data Stream Mining & Pro-cessing (DSMP), Lviv, 2016, pp. 61-64.doi: 10.1109/DSMP.2016.7583508
I. Kovalenko, Ye. Davydenko, and A. Shved, "Development of the procedure for integrated application of scenario prediction methods", Eastern-European Journal of Enterprise Technologies, vol. 2, iss. 4 (98), pp. 31-38, 2019.doi: 10.15587/1729-4061.2019.163871
K. O. Antipova, Ye. O. Davydenko, I. I. Kovalenko, and A. V. Shved, "Modelling of group expert judgments under conditions of complex uncertainty", East European Scientific Journal, no. 5 (45), pp. 4-10, 2019.
V. A. Billig, E. I. Korneyeva, and N. A. Siabro, "Associative rules. Benchmarking toolkit", Programmnye produkty, sistemy i alhoritmy, no. 2, 2016 [in Russian].
E. V. Galkina, "The combined application of the decision tree method and associative analysis in management", Mezhdunarodnyiy nauchnoissledovatelskiy zhurnal, no. 9 (51), pp. 29-32, 2016 [in Russian]. doi: 10.18454/IRJ.2016.51.095
V. I. Gorodetskiy, and V. V. Samoylov, "Associative and causal analysis and associative Bayesian networks", Trudy SPIIRAN, no. 9, pp. 13-65, 2009 [in Russian].
E. K. Dzhumatov, A. S. Vishnya, and S. A. Filippov, "The use of associative rule algorithms for identifying construction products recommended for sale", TEORIYA. PRAKTIKA. INNOVATSII: Internat. sci.-tech. journ., no. 1, pp. 1-15, 2018 [in Russian].
J.-M. Adamo, Data mining for association rules and sequential patterns: sequential and parallel algorithms. New York: Spring-er-Verlag, 2001.doi: 10.1007/978-1-4613-0085-4.
Y. S. Koh, and N. Rountree, Rare association rule mining and knowledge discovery: technologies for infrequent and critical event detection. New York: Information Sci-ence Reference, 2009. doi: 10.4018/978-1-60566-754-6.
A. V. Moldavskaya, "The method of form-ing multi-level sequential patterns", Problemy prohramuvannia, no. 2-3, pp. 158-163, 2016 [in Russian].
S. A. Subbotin, A. A. Oleynik, E. A. Gofman, S. A. Zaytsev, and A. A. Oleynik, Intelligent information technology for the design of automated systems for diagnosing and recognizing images: monograph. Khar-kov: Kompaniya Smit, 2012 [in Russian].
Downloads
Published
How to Cite
Issue
Section
URN
License
Copyright (c) 2020 Ігор Іванович Коваленко, Євген Олександрович Давиденко, Альона Володимирівна Швед The authors who publish in this journal agree to the following terms:The authors reserve the right to authorship of their work and give the journal the right to first publish this work under the terms of the Creative Commons Attribution License CC BY-NC, which allows other persons to freely distribute published work with a mandatory reference to authors of the original work and the first publication of the work in this journal.
Authors have the right to conclude separate additional agreements for the non-exclusive distribution of the paper in the form in which it was published by this journal (for example, posting work in electronic repository or publishing as part of a monograph), provided that the link to the first publication in this journal is maintained.
The journal policy allows and encourages authors to post on the Internet (for example, in repositories of institutions or on personal websites) the manuscript of work, both before the submission of this manuscript to the editorial staff, and during its editorial work, as it contributes to the emergence of productive scientific discussion and positively affects the efficiency and dynamics of published work citation (see The Effect of Open Access).
