<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Association Rule System for Effective Risk Management of a Cinema Chain</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>State University of Trade and Economics</institution>
          ,
          <addr-line>19 Kyoto str., Kyiv, 02156</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>216</fpage>
      <lpage>227</lpage>
      <abstract>
        <p>The object of research is risk management in the activity of a cinema chain. The solution to the tasks set in the research requires a scientific systematic approach using modern data analysis technologies. It can ensure the formation of an effective strategy for the development of the cinema chain business, making optimal management decisions, and rapid profit growth. The main groups of services, that cinema guests used during their visit, were determined by expert methods. Based on the responses of about a thousand cinema-goers, patterns in their purchasing behavior were identified. To analyze the risk management process of a cinema chain, the authors propose using data association methods. The procedure for generating popular sets of services for cinema goers and forming association rules for choosing services have been carefully investigated. The qualitative characteristics of association rules were calculated and ranked according to various criteria. The R and Python software tools for forming association rules were analyzed. The interpretation of “strong” rules for a clear understanding of the organization of cinema activities under minimal risks and the construction of its communication policy was presented.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Risk management</kwd>
        <kwd>cinema chain</kwd>
        <kwd>data association</kwd>
        <kwd>association rules</kwd>
        <kwd>apriori algorithm</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The modern process of forming effective risk
management is based on understanding the
needs of customers and the ability to
accurately predict their behavior. In the
process of forming the risk management
system of a cinema chain, researchers apply
general scientific and analytical methods that
help to increase its effectiveness. The most
relevant source of information on which the
risk management can be based is the existing
consumer’s observation because all aspects of
the risk management are aimed at them. An
indepth research of consumer behavior will help
to see in practice opportunities for more
effective communication, product, and price
components in the overall risk management
strategy [
        <xref ref-type="bibr" rid="ref1">1–3</xref>
        ].
      </p>
      <p>The sector of entertainment and recreation,
which includes cinemas, has suffered perhaps
the most in recent years. The difficult situation
in the country causes significant risks in the
activity of a cinema chain. All cinemas in
Ukraine have been closed since the beginning
of the COVID-19 pandemic since the end of
March 2020. According to the information and
analytical publication Media Business Reports
[4], the negative impact of external conditions
is reflected in the annual indicators of the box
office in Ukraine. So, compared to 2018, the
annual box office of 2019 increased by 20%,
and in 2020 it decreased by 66%. This led to
the forced downtime of cinemas and
subsequent mass layoffs of their employees.
During the next two years, during short-term
periods of easing quarantine restrictions, the
situation in the field of entertainment and
recreation did not significantly improve. Those
cinema chains that could not adapt to the new
conditions were closed. Others were able to
invent new ways of interacting with visitors
and gradually restore and increase the pace of
ticket sales.</p>
      <p>In February 2022, with the beginning of the
full-scale aggression of the Russian Federation
in Ukraine, cinemas were closed again. The
gradual opening of cinemas and the very slow
recovery of business in this area began in the
summer of 2022. However, it is still too early to
talk about the improvement of the situation,
because Ukraine is at war. A curfew is in effect
throughout Ukraine, which forces cinemas to
abandon most of the evening showings, which
brought the greatest profit. The difficult
situation forces us to reconsider the old and
proven approaches to management in the field
of providing film services. Therefore, it is
necessary to apply new effective methods that
are based on a systematic scientific study of
user preferences and intelligent analysis of the
results of these researches and can quickly and
effectively affect the business performance of
the cinema chains [5, 6].</p>
    </sec>
    <sec id="sec-2">
      <title>2. Research Methodology</title>
      <p>The theoretical and methodological justification
of research is the fundamental principles of risk
management and strategic analysis, a systematic
approach, data analysis and synthesis, and a
dialectical method in justifying the use of
information technologies.</p>
      <p>In particular, the following scientific
methods are used in research:
• Risk analysis is used to identify
unresolved problems in the
management policy of cinemas and to
develop methods for their elimination.
• Strategic analysis is used to identify
unresolved problems in the strategic
development of the cinema chain, and to
justify the need to use data science
methods for intelligent analysis of the
strategy of the cinema chain’s activities.
• Association method is used to create
cause-and-effect relationships between
rating categories that were offered to
cinema visitors.
• Apriori algorithm is used to form sets of
popular sets of evaluation categories and
to construct a system of association rules
based on these sets.
• Graphic method is used to construct a
scheme for forming subsets of different
capacities from popular sets of
evaluation categories.
• Method of quantitative analysis is used to
calculate the characteristics of support
and confidence of association rules, and
their ranking and to identify a system of
“strong” rules with the least risk in the
activity of a cinema chain.</p>
      <p>The informational basis for the research is
data from a survey of respondents from
different regions of Ukraine and different
cinema chains.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Literature</title>
    </sec>
    <sec id="sec-4">
      <title>Development and</title>
    </sec>
    <sec id="sec-5">
      <title>Hypothesis</title>
      <p>Risk management research in the field of
picture motion industry is becoming the
central topic of many studies because this type
of business has its specifics, which is expressed
in the need to sell its services both online and
offline. Therefore, great attention should be
paid both to Internet communications and to
the creation of a special cinema atmosphere
and service. Kim In Kyung [7], using
crosssectional data on Korean cinema chains, found
evidence that productivity is higher in
company-owned cinemas than in cinemas with
a franchise. E. Salvador, J.-P. Simon,
P.-J. Benghozi [8] explored the implementation
of cinema value creation through innovation. B.
Sheremeta, N. Chukhray, O. Karyy [9, 10].
studied the visitors to cinemas in Ukraine.
According to their research, visitors believe
that cinemas should develop such services as a
cinema market, the establishment of an online
cinema, the ability to leave a child with a
nanny, special cinema uses, and a monthly
subscription. Quite a lot of attention is paid to
the impact of COVID-19 on the film distribution
sphere [11].</p>
      <p>Active scientific research in the field of
association analysis began at the end of the
twentieth century. Modern researchers often
rely on the work “Fast Discovery of Association
Rules” [12]. It is also necessary to note the
works of R. Agrawal, R. Srikant [13], C. Borgelt
[14, 15], and M. J. Zaki [16, 17].
The development of tools for finding
association rules is also developing rapidly. It
should be noted the scientific activity of M.
Hashler, who covers the application of
association rules in the R-package ecosystem
[18–21].</p>
      <p>
        The practical implementation of association
rules is now actively used in many fields, such
as economy [
        <xref ref-type="bibr" rid="ref2">22, 23</xref>
        ], tourism [
        <xref ref-type="bibr" rid="ref3">24</xref>
        ], medicine
(especially in research related to COVID-19)
[
        <xref ref-type="bibr" rid="ref4 ref5">25, 26</xref>
        ], education [
        <xref ref-type="bibr" rid="ref6">27</xref>
        ], etc. The development
of the IT industry led to the application of
association rules in text mining, in particular,
in the analysis of messages in the social
networks Facebook and Twitter [
        <xref ref-type="bibr" rid="ref7 ref8">28, 29</xref>
        ].
      </p>
      <p>
        There are few examples of publications on
association rules in the field of film industry
[
        <xref ref-type="bibr" rid="ref10 ref9">30, 31</xref>
        ], but they relate to a rating of films and
the construction of recommender systems for
their selection.
      </p>
      <p>The authors of the current research fully
agree with O. Araz, T. Choi, D. Olson, and F.
Salman [32] regarding the importance of the
interaction between risk management and
data science. Risk management and data
science are large and independent sciences,
but they cannot exist separately from each
other. Risk management without data science
is devoid of modern and effective data analysis
technologies. Data science without risk
management has no applied nature and loses
its meaning without its practical application.
Therefore, to obtain a synergistic effect from
the use of data mining in risk management, an
organic combination of advanced concepts of
risk analysis and modern data mining
technologies and tools is required.</p>
    </sec>
    <sec id="sec-6">
      <title>4. Objective</title>
    </sec>
    <sec id="sec-7">
      <title>Research and</title>
    </sec>
    <sec id="sec-8">
      <title>Context of</title>
      <p>The purpose of the scientific research is to
replace inefficient situational management
with a systematic approach in the risk
management analysis of cinema chain
activities, to ensure effective management
decisions in the field of strategic development
of the cinema chain based on marketing
research and data mining obtained during the
survey of cinema visitors.</p>
      <p>Systematization of the complex structure of
large volumes of data has led to the emergence
of affinity analysis, which is one of the most
common methods of data mining. Its purpose
is to search for association rules to study the
mutual connection between events that occur
together.</p>
      <p>For the first time, the problem of finding
association rules was proposed for finding
typical patterns of purchases made in
supermarkets, so sometimes affinity analysis is
called market basket analysis. Today,
association rules are widely used not only in
the retail sector but also in other areas,
especially in the service sector.</p>
      <p>The authors of the paper set a goal for
themselves to apply the idea of affinity analysis
and association rules for optimizing the
management of cinema chain activities.</p>
    </sec>
    <sec id="sec-9">
      <title>5. Creating a System of</title>
    </sec>
    <sec id="sec-10">
      <title>Association Rules</title>
      <sec id="sec-10-1">
        <title>5.1. Structure of Initial Data for</title>
      </sec>
      <sec id="sec-10-2">
        <title>Forming Association Rules</title>
        <p>The authors developed an online survey form
for cinema chain visitors. It was decided to
place an invitation to the survey directly in
front of the entrance to the cinema hall,
because viewers can buy tickets online and not
use other cinema services. The invitation is a
small postcard with brief information about
the survey and a QR code that you can use to
open the online form and complete the survey.</p>
        <p>Viewers were asked the following questions
and possible answers (the answer symbol is
indicated in brackets):
1. How many tickets do you usually buy in
one cinema visit?
• one ticket (A)
• two or more tickets (B).
2. How do you most often buy cinema
tickets:
• online via the website or mobile app
(C).</p>
        <p>• at the cinema box office (D).
3. What type of seat do you most often
choose when buying tickets?
• regular seats (E)
• VIP seats (F).
4. What days of the week do you most often
visit the cinema?
• on weekends (G)
• on weekdays (H).
5. At what time do you most often visit the
cinema?
• in the morning (I)
• in the afternoon (J)
• in the evening (K)
• late in the evening (L).
6. Do you prefer films in IMAX format? (M)
7. Do you prefer films in IMAX format? (M)
8. Do you usually buy products at the
cinema bar before the film starts? (O)
9. Do you use your cinema’s loyalty
program? (P)
10. Are you a subscriber and an active user
of your cinema’s social network? (Q)</p>
        <p>The survey was designed in such a way that
viewers had to indicate only 1 answer to
questions 1–5. Questions 6–10 had to be
answered “yes” or “no”.</p>
        <p>947 respondents, who represented 8
regions of Ukraine, were visitors of 6 cinema
chains and were aged from 18 to 60, were
interviewed during 4 months (from October
2022 to January 2023).</p>
        <p>For further processing, the respondents’
answers were presented in the binary system,
where “0” means that the respondent did not
choose this answer to questions 1–5 or gave a
negative answer to questions 6–10.
Accordingly, “1” means that the respondent
chose this answer to questions 1–5 or a
positive answer to questions 6–10.</p>
        <p>Table 1 presents a fragment of the initial
data table, the total number and percentage of
responses provided.
...
0
0
0
31
3
%
0
0
0
0
0
0
0
0
0
...
1
0
0
2
3
4
5
6
7
8
9
10
...</p>
      </sec>
      <sec id="sec-10-3">
        <title>5.2. Formation of a Set of Popular</title>
      </sec>
      <sec id="sec-10-4">
        <title>Itemsets</title>
        <p>Different methods and algorithms of association
analysis are used to form association rules. One
of the most widespread algorithms that allows
reducing the search space to sizes that provide
acceptable computational and time costs is the
Apriori algorithm [33]. This algorithm is based
on the concept of a transaction as some set of
compatible events and the concept of popular
107
11
%
660
70
%
149
16
%
118
12
%
720
76
%
419
44
%
128
14
%
itemsets that are often found in different
transactions.</p>
        <p>To form sets of popular itemsets, it is
necessary to set a minimum support threshold
for the popularity of the itemset. The choice of
such a threshold value significantly affects the
number of rules. Too large a value of the
minimum support threshold will dramatically
reduce the number or even make it impossible
to form association rules. On the contrary, too
small a value will lead to the formation of a
1
1
1
1
1
1
1
1
1
...
0
1
1</p>
        <p>L
0
0
0
0
0
0
0
0
0
0
...
0
0
0</p>
        <p>M
0
0
0
0
0
0
0
0
0
0
...
0
1
0</p>
        <p>N
0
0
0
0
0
0
0
0
0
0
...
0
0
0
11
1
%</p>
        <p>O
0
1
0
0
0
0
0
1
1
0
...
0
1
1</p>
        <p>P
0
0
0
0
0
1
0
1
0
0
...
1
0
1</p>
        <p>Q
0
0
0
0
0
0
0
0
1
0
...
1
0
0
large number of rules with low reliability, and
this will complicate their interpretation and
practical implementation. Thus, the value of
the minimum support threshold is set
exclusively experimentally. The authors of this
study set the value of the minimum support
threshold of association rules at the level of
30%.</p>
        <p>Therefore, the set of popular 1-itemsets will
consist of criteria that have support no less
than 30%:</p>
        <p>F1 = {A, B, C, E, F, H, K, O, P}
(1)</p>
        <p>Next, we find popular 2-itemsets, forming all
36 possible combinations of two elements from
F1: AB, AC, AE, AF, AH, AK, AO, AP, BC, BE. BF, BH,
BK, BO, BP, CE, CF, CH, CK, CO, CP, EF, EH, EK, EO,
EP, FH, FK, FO, FP, HK, HO, HP, KO, KP, OP.</p>
        <p>To estimate the level of support of a
2itemset, we need to multiply the corresponding
values from Table 1. For example, for
respondent ID = 1, the value of the itemset
AB = 1⸱0 = 0, and the value of the itemset
AC = 1⸱1 = 1. A fragment of the table with
support level calculations for each 2-itemset is
presented in Table 2.
Naturally, 2-itemsets AB and EF have a support
level of 0%, because the answers mutually
exclude each other. Out of 36 pairs of values, 19
itemsets have support with a minimum level of
30%, which forms a set of popular itemsets.</p>
        <p>CFO2=, {CAPE, ,EBHC,,EBKE,,EBOH, ,FBOK, ,HBKO, ,HCOE,, KCOH,, OCPK}, (2)</p>
        <p>Using popular itemsets F2, we generate sets
of 3-itemsets F3. To do this, we need to connect
the set F2 to itself by choosing connecting
itemsets. k-itemsets are connected if they have
k-1 common items. For example:</p>
        <p>{AE}+{BE}={ABE} (3)</p>
        <p>Generating itemsets based on simple
combinations of elements of the previous level
quickly leads to an uncontrolled increase in
unpromising combinations. Various analytical
[34] and algorithmic [35] methods of
combinatorial optimization can be used to
prevent such a negative situation. The practical
implementation of such approaches to finding
associative rules in the Apriori algorithm is the
property of antimonotonicity: if N is not a
popular itemset, then adding some new item M
to the itemset N does not make it more popular,
i. e. the itemset  ∪  will not be popular. For
example, in our research, the combination of
the popular AE and BE itemsets results in the
ABE 3-item set. But it won’t be popular because
it includes AB 2-itemset that has zero support.
Adding element E to its composition will not
increase the support of this itemset and it will
remain at the level of 0%.</p>
        <p>The set of all possible 40 connected
itemsets will be ABE, ACE, AEH, AEK, AEO, BCE,
BCH, BCK, BCO, BCP, BEH, BEK, BEO, BHK, BHO,
BFO, BKO, BOP, CEH, CEK, CEO, CEP, CHK, CHO,
CHP, CKO, CKP, COP, CFO, EHK, EHO, EKO, EFO,
EOP, FHO, FKO, FOP, HKO, HOP, KOP.</p>
        <p>The property of antimonotonicity made it
possible to exclude 19 unpromising itemsets
from this list and to leave 21 itemsets for
further verification: BCE, BCH, BCK, BCO, BEH,
BEK, BEO, BHK, BHO, BKO, CEH, CEK, CEO, CHK,
CHO, CKO, COP, EHK, EHO, EKO, HKO.</p>
        <p>Table 3 presents calculations of the level of
support for 3-itemsets.
16 itemsets have support with a minimum
level of 30%, of the 21 3-itemsets of values
pairs, which form a set of popular itemsets:
The process of forming sets of popular itemsets
Fk continues as long as the elements of such set
contain connecting itemsets with k-1 common
elements. Let’s try to form a set of 4-itemsets.
We have the following result of forming from
14 elements: BCHK, BCHO, BCKO, BCEK, BCEO,
BHKO, BEHK, BEHO, BEKO, CEHK, CEHO, CEKO,
CHKO, EHKO.</p>
        <p>Applying the property of antimonotonicity, we
determine unpromising elements: BCEK, BCEO
(contain nonpopular subset BCE), BEHK, BEHO
(contain nonpopular subset BEH), BEKO
(contain nonpopular subset BEK). We will
check the remaining 9 4-itemsets for
popularity by calculating the corresponding
supports (Table 4).
Only one element satisfies the minimum
support condition. Thus, the set</p>
        <p>4 = { } (4)</p>
        <p>It is impossible to form connecting itemsets
from one element, so the first stage of the
Apriori algorithm (the process of forming
popular itemsets) is completed. It has the
following results in our research:
 1 = { ,  ,  ,  ,  ,  ,  ,  ,  }
(5)</p>
        <p>F2 = {AE, BC, BE, BH, BK, BO, CE,
CH, CK, CO, CP, EK, EO, FO, HK, HO, KO, (6)</p>
        <p>OP}
F3 = {BCH, BCK, BCO, BHK, BHO, BKO,
CEH, CEK, CEO, CHK, CHO, CKO, EHK, (7)
EHO, EKO, HKO}</p>
        <p>F4 = {CHKO} (8)</p>
        <p>The graphic model of the formation of sets
 1,  2,  3,  4 is presented in Fig. 1.</p>
      </sec>
      <sec id="sec-10-5">
        <title>5.3. Formation of Association Rules</title>
        <p>The second step of the Apriori algorithm is the
direct formation of association rules. In
general, the Apriori algorithm does not impose
restrictions on the number of elements in both
parts of the association rule. However, in
practice, only rules that contain one conclusion
are often considered. At the same time, the
number of components of the condition is not
limited. This approach pursues two goals:
1. The number of rules is reduced, which
makes the calculation easier;
2. The presence of one item in the
conclusion makes the rule unambiguous
for interpretation, and ready for
practical implementation.</p>
        <p>According to this approach, in each set of
popular itemsets   ,  ≥ 2, it is necessary to
select such itemsets that contain i items. Then
you should also select i one-element subsets
from each such itemset. The obtained subsets
will form the conclusions of the association
rule, and the rest i-1 elements will be combined
into appropriate conditions by conjunction.</p>
        <p>For example, two rules (A→E, E→A) can be
formed from the popular itemset AE belonging
to the set  2; three rules (BH→K, BK→H, HK→B)
can be formed from the itemset BHK belonging
to the set  3; four rules (CHK→O, CHO→K,
CKO→H, HKO→C) can be formed from a itemset
of CHKO belonging to the set  4. The procedure
is repeated until all popular itemsets are
exhausted.</p>
        <p>In the task of forming the risk management
strategy for a cinema chain, we will have the
following set, which consists of 90 association
rules (Fig. 2):
Thus, as a result of the application of the
Apriori algorithm, it was possible to identify 90
associative rules that show which services
from the initial set of transactions will most
often be chosen by cinemagoers together. Such
indicators will make it possible to build logical</p>
      </sec>
      <sec id="sec-10-6">
        <title>5.4. Quantitative Characteristics</title>
      </sec>
      <sec id="sec-10-7">
        <title>Association Rules of</title>
        <p>Association rules describe the relationship
between itemsets, which are characterized by
two main indicators, they are support S and
confidence C.</p>
        <p>Support of association rule is the element of
transactions that contain as a condition, as a
consequence. For example, for a rule A→B
support S(A→B) means the ratio of the number
of transactions AB, that simultaneously contain
condition A and consequence B, to the total
number of transactions.</p>
        <p>The confidence С(A→B) of an association
rule A→B is defined as the ratio of the number of
transactions, that simultaneously contain
condition A and consequence B, to the number of
transactions that contain only condition A.</p>
        <p>The support and confidence of association
rules (or their product) are most often used to
rank the obtained rules in descending order of
importance and highlight a subset of so-called
“strong” rules, that have a minimal level of risk.
Their interpretation and consideration will bring
the most tangible effect to the business. In
addition to these characteristics, L (lift), T
(leverage), and I (improvement) are also used for
qualitative assessment of association rules [33].</p>
        <p>Table 5 presents a set of obtained
association rules with calculated quantitative
characteristics.
connections between various services and to
develop a perfect risk management strategy in
the activity of a cinema chain.</p>
        <p>S</p>
        <p>Rule
B→K
K→B
B→O
O→B
C→E
E→C
C→H
H→C
C→K
K→C
C→O
O→C
C→P
P→C
E→H
H→E
E→K
K→E
E→O
O→E
F→O
O→F
H→K
K→H
H→O
O→H
K→O
O→K
O→P
P→O</p>
        <p>S
From a practical point of view, the
interpretation of the obtained association rules
is important. Let’s consider examples of the
interpretation of several “strong” rules,
ordered in Table 6 by the level of confidence.</p>
        <p>ID 1: CHK→O. A visitor who buys a ticket
online for a weekday evening show will buy the
products at the bar. The rule has a minimum
allowable support of 30%. This means that
30% of the surveyed cinema-goers indicated
that they use all these four services. However,
this rule has one of the highest confidence
values—82%, which confirms its high
significance. From a strategic point of view,
this rule distinguishes with high reliability the
customers who will be served at the bar.
Therefore, the bar must be opened on
weekdays in the evening. It is possible to limit
its functioning to other days and hours if the
number of bartenders is insufficient. It is also
useful to allow ordering online bar products
for evening showings.
ID 53: А→Е. A visitor who buys one ticket
chooses a regular seat. Rule support is 31%,
and confidence is 83.5%. This rule
demonstrates the fact that it is important not
only to use the rule directly but also to try to
change it. The cinema is interested in buying
VIP seats, which provide more profit.
Therefore, management should take measures
to encourage visitors to choose VIP seats. This
can be achieved by introducing a broader
loyalty program for visitors with VIP seats, for
example, discounts on certain products in the
cinema bar.</p>
        <p>ID 74: Р→С. Most visitors, who use the
loyalty program, buy tickets online. 36.4% of
surveyed visitors are members of the loyalty
program, and 82.3% of such participants buy
tickets directly through the cinema chain’s
website or a mobile application. It is necessary
to expand the loyalty program in the
development of the risk management strategy
and encourage participation in it in every
possible way to get an increase in online ticket
purchases. It is necessary to increase its
accessibility and clarity for people of different
ages and to conduct the communication policy
of the cinema through it. That is, members of
the loyalty program should receive e-mails,
push notifications from the mobile apps,
newsletters on messengers for birthdays, on
the occasion of the release of new films, as well
as receive special offers, they are promotional
codes with discounts on tickets and bar
products, invitations to special parties and
meetings with actors, etc.</p>
      </sec>
      <sec id="sec-10-8">
        <title>5.6. Software Tools</title>
      </sec>
      <sec id="sec-10-9">
        <title>Association Rules for</title>
      </sec>
      <sec id="sec-10-10">
        <title>Forming</title>
        <p>In the case of a large number of transactions
and criteria in each of them, it is appropriate to
use software tools for generating and
processing association rules.</p>
        <p>For the practical application of association
rules, you need to use software environments,
in which data mining algorithms are
implemented. Let’s briefly describe the
process of processing association rules in the
most advanced data analytics environments,
such as R and Python.</p>
        <p>To implement the Apriori algorithm in R
[19], you need to install the arules library and
to visualize association rules, you need to
install the arulesViz library:
# Installing Packages
install.packages("arules")
install.packages("arulesViz")
# Loading package
library(arules)
library(arulesViz)</p>
        <p>Formation of the system of association rules
is performed using the apriori function:
apriori (data = dataset, parameters)</p>
        <p>The parameters of association rules are
most often set as a list with the minimum
values of the numerical characteristics of the
rules. For example,</p>
        <p>rules = apriori (data = dataset,
parameter = list(support = 0.004,</p>
        <p>confidence = 0.2))
A bar chart of the relative frequency of
transaction elements is often used as a
visualization:
# Plot
itemFrequencyPlot(dataset, topN = 10)</p>
        <p>To visualize the resulting system of rules,
you should sort the rules by one of the
quantitative characteristics, and then build a
model for a certain number of “strong” rules. In
the example below, the system of 10 “strong”
rules is sorted by the lift characteristic:
# Visualizing the results
inspect(sort(rules, by = 'lift')[1:10])
plot(rules, method = "graph", measure =
"confidence", shading = "lift")</p>
        <p>The Python ecosystem also provides several
tools for finding association rules in datasets.
Python modules for data analysis, such as
pandas and numpy, which are familiar for data
analysis, are used to collect, store, manipulate,
and prepare datasets. The implementation of
the backend part of these modules is
developed in the C++ programming language,
which makes it possible to combine the
flexibility, inherent in Python, and the speed of
performing large volumes of operations.</p>
        <p>The most popular data analysis modules,
such as tensorflow and sklearn, do not include
algorithms for searching for association rules
at the time of publication. So, you can find
many original implementations of this tool on
the web. The mlxtend module is most often
used, which allows you to perform data
preprocessing, generate sets of rules, and search
for relevant dependencies [36, 37]. Matplotlib
and plotly modules are used to visualize the
obtained results. They make it possible to
display any graphic information, as well as to
build charts of any complexity. Both packages
include the ability to build interactive
visualizations. In addition, the plotly module
can be integrated into Flask web applications
as a full-fledged dashboard. The NetworkX
module is used to display graphs and
structured information, which simplifies their
visualization.</p>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>6. Conclusions</title>
      <p>The entertainment sector and, in particular,
the sphere of cinema activity experienced
significant shocks during the COVID-19
pandemic. In Ukraine, the difficult situation
worsened significantly with the beginning of
Russia’s military aggression. This
demonstrated the significant dependence of
the entertainment sector on the political and
social situation of the country, and the loss of
stability of the market of film services.</p>
      <p>The management of the cinema chain is
forced to look for new approaches to business
management to minimize risks in their
activities. Improvements in data collection
methods in combination with new intelligent
processing technologies are capable of
creating real progress in the strategic and risk
management analysis of the activities of
cinema chains.</p>
      <p>In their research, the authors propose to
use association rules as one of the advanced
data mining technologies to improve the risk
management strategy of the cinema chain.</p>
      <p>Association rules offer two undeniable
advantages. The first is that association
analysis allows you to discover hidden logical
connections and patterns that are unrealistic
to track for a large amount of data. The second
is that the results of the analysis in the form of
association rules are ready for use. They
indicate the directions for improvement of
strategic planning and risk management
policy, based on the synergy of subjective and
objective factors, and also identify weaknesses
that the cinema administration should pay
attention to.</p>
      <p>Thus, the application of a system of
association rules for the formation of the risk
management strategy has praxeological value
for implementation in the daily work of a
cinema chain.
Information and Telecommunication [11] S. Melnychenko, et al., Communication
Systems, CPITS, vol. 2923 (2021) 309– Policy of Cinema Industry Enterprises in
317. the Context of COVID-19 (on the
[2] D. Berestov, et al., Analysis of Features Example of Cinema Chains), Innov. Mark.
and prospects of Application of Dynamic 17(2) (2021) 112–124. doi:
Iterative Assessment of Information 10.21511/im.17(2).2021.11.
Security Risks, in: Workshop on [12] R. Agrawal, et al., Fast Discovery of
Cybersecurity Providing in Information Association Rules, Advances in
and Telecommunication Systems, CPITS, Knowledge Discovery and Data Mining
vol. 2923 (2021) 329–335. 12(1) (1996) 307–328.
[3] S. Shevchenko, et al., Information [13] R. Agrawal, R. Srikant, Fast Algorithms
Security Risk Management using for Mining Association Rules, 20th Int.
Cognitive Modeling, in: Workshop on Conf. Very Large Data Bases (VLDB)
Cybersecurity Providing in Information 1215 (1994) 487–499.
and Telecommunication Systems II, [14] C. Borgelt, Efficient Implementations of
CPITS-II, vol. 3550 (2023) 297–305. Apriori and Eclat, FIMI’03: Proceedings
[4] Media Business Reports (2020). URL: of the IEEE ICDM Workshop on Frequent
https://mbr.com.ua. Itemset Mining Implementations (2003).
[5] F. Kipchuk, et al., Assessing Approaches [15] C. Borgelt, Frequent Item Set Mining,
of IT Infrastructure Audit, in: IEEE 8th WIREs: Data Mining and Knowledge
International Conference on Problems of Discovery 2(6) (2012) 437–456. doi:
Infocommunications, Science and 10.1002/widm.1074.</p>
      <p>Technology (2021). doi: 10.1109/ [16] M. Zaki, Generating Non-Redundant
picst54195.2021.9772181 Association Rules, 6th ACM SIGKDD
[6] V. Buriachok, V. Sokolov, P. Skladannyi, International Conference on Knowledge
Security Rating Metrics for Distributed Discovery and Data Mining (2000) 34–
Wireless Systems, in: Workshop of the 43. doi: 10.1145/347090.347101.
8th International Conference on [17] M. Zaki, Scalable Algorithms for
“Mathematics. Information Technolo- Association Mining, IEEE Transactions
gies. Education": Modern Machine on Knowledge and Data Engineering
Learning Technologies and Data Science, 12(3) (2000) 372–390. doi:
vol. 2386 (2019) 222–23 10.1109/69.846291.
[7] I. Kim, Organizational Form and [18] M. Hahsler, et al., Associative
ClassiPerformance: The Cinema Chain Case, fication in R: arc, arulesCBA, and rCBA,
Appl. Econom. 53(56) (2021) 6472– The R J. 11(2) (2019) 254–267. doi:
6487. doi: 10.1080/00036846.2021. 10.32614/rj-2019-048.</p>
      <p>1946003. [19] M. Hahsler, ArulesViz: Interactive
[8] E. Salvador, J.-P. Simon, P.-J. Benghozi, Visualization of Association Rules with
Facing Disruption: The Cinema Value R, The R J. 9(2) (2017) 163–175. doi:
Chain in the Digital Age, Int. J. Arts 10.32614/RJ-2017-047.</p>
      <p>Manag. 22(1) (2019) 25–40. [20] M. Hahsler, et al., The Arules R-package
[9] B. Sheremeta, N. Chukhrai, Using the Ecosystem: Analyzing Interesting
Blue Ocean Strategy by Ukrainian Patterns from large Transaction Data
Cinema Networks in Uncertain Sets, The J. Mach. Learn. Res. 12 (2011)
Environment, Innov. Technol. Sci. Solut. 2021–2025. doi: 10.5555/1953048.
Ind. 4(14) (2020) 137–146. doi: 2021064.</p>
      <p>10.30837/itssi.2020.14.137. [21] M. Hahsler, B. Grün, K. Hornik, Arules-A
[10] B. Sheremeta, N. Chukhray, O. Karyy, Computational Environment for Mining
Marketing Tools as the Competitiveness Association Rules and Frequent Item
Enhancer of the Ukrainian Film Sets, J. Stat. Softw. 14 (2005) 1–25.
Distribution Market Entities, Innov. [22] Z. Huang, X. Lu, H. Duan, Mining
Mark. 15(4) (2019) 88–101. doi: Association Rules to Support Resource
10.21511/im.15(4).2019.08. Allocation in Business Process
Management, Expert Syst. Appl. 38(8)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Shevchenko</surname>
          </string-name>
          , et al.,
          <article-title>Information Security Risk Analysis SWOT</article-title>
          , in: Workshop on Cybersecurity Providing in (
          <year>2011</year>
          )
          <fpage>9483</fpage>
          -
          <lpage>9490</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.eswa. [32]
          <string-name>
            <given-names>O.</given-names>
            <surname>Araz</surname>
          </string-name>
          , et al.,
          <source>Data Analytics</source>
          for
          <year>2011</year>
          .
          <volume>01</volume>
          .146.
          <string-name>
            <surname>Operational Risk</surname>
            <given-names>Management</given-names>
          </string-name>
          , Decision
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>B.</given-names>
            <surname>Öztayşi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Yurdadön</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Onar</surname>
          </string-name>
          , Fuzzy Sci.
          <volume>51</volume>
          (
          <issue>6</issue>
          ) (
          <year>2020</year>
          )
          <fpage>1316</fpage>
          -
          <lpage>1319</lpage>
          . doi:
          <source>Clustering Based Association Rule</source>
          <volume>10</volume>
          .1111/deci.12443.
          <string-name>
            <surname>Mining</surname>
            :
            <given-names>A Case</given-names>
          </string-name>
          <string-name>
            <surname>Study on Ecommerce</surname>
            , [33]
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Dietrich</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Heller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Yang</surname>
          </string-name>
          ,
          <source>Data International Conference on Intelligent Science &amp; Big Data Analytics: and Fuzzy Systems</source>
          (
          <year>2022</year>
          )
          <fpage>112</fpage>
          -
          <lpage>118</lpage>
          . Discovering, Analyzing, Visualizing and
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>D.</given-names>
            <surname>Atsa</surname>
          </string-name>
          <article-title>'am</article-title>
          , R. Wario, Association Rules Presenting Data, John Wiley &amp; Sons on the COVID-19 Variants of Concern to (
          <year>2015</year>
          ). Guide Choices of Tourism Destinations, [34]
          <string-name>
            <given-names>O.</given-names>
            <surname>Emets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roskladka</surname>
          </string-name>
          ,
          <source>On Estimates of Curr. Issues Tour</source>
          .
          <volume>25</volume>
          (
          <issue>10</issue>
          ) (
          <year>2022</year>
          )
          <fpage>1536</fpage>
          - Minima of Criterion Functions in 1540. doi:
          <volume>10</volume>
          .1080/13683500.
          <year>2021</year>
          . Optimization on Combinations,
          <volume>1951182</volume>
          . Ukrainian Math. J.
          <volume>51</volume>
          (
          <issue>8</issue>
          ) (
          <year>1999</year>
          )
          <fpage>1262</fpage>
          -
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tandan</surname>
          </string-name>
          , et al.,
          <source>Discovering Symptom 1265. doi: 10</source>
          .1007/BF02592514. Patterns of COVID-19
          <source>Patients Using</source>
          [35]
          <string-name>
            <given-names>O.</given-names>
            <surname>Yemets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roskladka</surname>
          </string-name>
          , Algorithmic Association Rule Mining,
          <source>Comput. Biol. Solution of Two Parametric Med</source>
          .
          <volume>131</volume>
          (
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .1016/j. Optimization
          <source>Problems on a Set of compbiomed</source>
          .
          <year>2021</year>
          .
          <volume>104249</volume>
          .
          <string-name>
            <surname>Complete</surname>
            <given-names>Combinations</given-names>
          </string-name>
          , Cybern. Syst.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          , et al.,
          <source>The Application Anal</source>
          .
          <volume>35</volume>
          (
          <issue>6</issue>
          ) (
          <year>1999</year>
          )
          <fpage>981</fpage>
          -
          <lpage>986</lpage>
          . doi:
          <source>Characteristics of Traditional Chinese 10.1007/BF02742292. Medical Science Treatment on Vertigo [36] Python Implementation of Apriori Based on Data Mining Apriori Algorithm</source>
          ,
          <string-name>
            <surname>Algorithm</surname>
          </string-name>
          (
          <year>2023</year>
          ). URL: https://github.
          <source>Int. J. Wirel. Mob. Comput</source>
          .
          <volume>4</volume>
          (
          <year>2015</year>
          )
          <fpage>349</fpage>
          - com/asaini/Apriori 354. [37]
          <string-name>
            <given-names>Advanced</given-names>
            <surname>Python</surname>
          </string-name>
          Visualization Library
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A.</given-names>
            <surname>Roskladka</surname>
          </string-name>
          , et al.,
          <article-title>The Data Association for Association Rules (</article-title>
          <year>2023</year>
          ).
          <article-title>URL: Algorithm for the Formation of Optional https://github</article-title>
          .com/Mazeofthemind/Py IT-courses List System, in: ICT in ARMViz Education, Research and
          <string-name>
            <given-names>Industrial</given-names>
            <surname>Applications</surname>
          </string-name>
          . Integration,
          <source>Harmonization and Knowledge</source>
          Transfer Vol.
          <volume>2732</volume>
          (
          <year>2020</year>
          )
          <fpage>515</fpage>
          -
          <lpage>531</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>M.</given-names>
            <surname>Alanezi</surname>
          </string-name>
          ,
          <article-title>Community Detection in Facebook Using Visual Approach and Clustering</article-title>
          ,
          <source>J. Phys. Conf. Series</source>
          <year>1804</year>
          (
          <volume>1</volume>
          ) (
          <year>2021</year>
          ). doi:
          <volume>10</volume>
          .1088/
          <fpage>1742</fpage>
          -
          <lpage>6596</lpage>
          /
          <year>1804</year>
          / 1/012047.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>J.</given-names>
            <surname>Diaz-Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ruiz</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>MartinBautista, Generalized Association Rules for Sentiment Analysis in Twitter</article-title>
          ,
          <source>International Conference on Flexible Query Answering Systems, LNAI</source>
          <volume>11529</volume>
          (
          <year>2019</year>
          )
          <fpage>166</fpage>
          -
          <lpage>175</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -27629-4_
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Zubi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Elrowayati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. Abu</given-names>
            <surname>Fanas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Movie</given-names>
            <surname>Recommendation</surname>
          </string-name>
          <article-title>System Design Using Association Rules Mining and Classification Techniques</article-title>
          ,
          <source>WSEAS Transactions on Computers</source>
          <volume>21</volume>
          (
          <year>2022</year>
          )
          <fpage>189</fpage>
          -
          <lpage>199</lpage>
          . doi:
          <volume>10</volume>
          .37394/23205.
          <year>2022</year>
          .
          <volume>21</volume>
          .24.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bury</surname>
          </string-name>
          , Association Rule for Movie Ratings (
          <year>2021</year>
          ). URL: https://rpubs.com /Bury/AssociationRuleForMovieRatings
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>