Association and Correlation

In data mining, association and correlation are key techniques for extracting
patterns and relationships from large datasets. Association uncovers relationships
between items, while correlation measures the strength of the link between two
variables. This exploration will delve into these techniques, their types, and
methods, pivotal for informed decision-making in various domains.

What is Association?

Association is a technique used in data mining to identify the relationships or co-occurrences

between items in a dataset. It involves analyzing large datasets to discover patterns or
associations between items, such as products purchased together in a supermarket or web
pages frequently visited together on a website. Association analysis is based on the idea of
finding the most frequent patterns or itemsets in a dataset, where an itemset is a collection of
one or more items.

Association analysis can provide valuable insights into consumer behaviour and preferences.
It can help retailers identify the items that are frequently purchased together, which can be
used to optimize product placement and promotions. Similarly, it can help e-commerce
websites recommend related products to customers based on their purchase history.

Types of Associations

Here are the most common types of associations used in data mining:

 Itemset Associations: Itemset association is the most common type of association

analysis, which is used to discover relationships between items in a dataset. In this
type of association, a collection of one or more items that frequently co-occur
together is called an itemset. For example, in a supermarket dataset, itemset
association can be used to identify items that are frequently purchased together,
such as bread and butter.
 Sequential Associations: Sequential association is used to identify patterns that
occur in a specific sequence or order. This type of association analysis is commonly
used in applications such as analyzing customer behaviour on e-commerce websites
or studying weblogs. For example, in the weblogs dataset, a sequential association
can be used to identify the sequence of pages that users visit before making a
purchase.
 Graph-based Associations Graph-based association is a type of association analysis
that involves representing the relationships between items in a dataset as a graph. In
this type of association, each item is represented as a node in the graph, and the
edges between nodes represent the co-occurrence or relationship between items.
The graph-based association is used in various applications, such as social network
analysis, recommendation systems, and fraud detection. For example, in a social
network dataset, identifying groups of users with similar interests or behaviours.
Association Rule Mining

Here are the most commonly used algorithms to implement association rule mining in
data mining:

 Apriori Algorithm - Apriori is one of the most widely used algorithms for association rule
mining. It generates frequent item sets from a given dataset by pruning infrequent item sets
iteratively. The Apriori algorithm is based on the concept that if an item set is frequent, then
all of its subsets must also be frequent. The algorithm first identifies the frequent items in
the dataset, then generates candidate itemsets of length two from the frequent items, and
so on until no more frequent itemsets can be generated. The Apriori algorithm is
computationally expensive, especially for large datasets with many items.
 FP-Growth Algorithm - FP-Growth is another popular algorithm for association rule mining
that is based on the concept of frequent pattern growth. It is faster than the Apriori
algorithm, especially for large datasets. The FP-Growth algorithm builds a compact
representation of the dataset called a frequent pattern tree (FP-tree), which is used to mine
frequent item sets. The algorithm scans the dataset only twice, first to build the FP-tree and
then to mine the frequent itemsets. The FP-Growth algorithm can handle datasets with both
discrete and continuous attributes.
 Eclat Algorithm - Eclat (Equivalence Class Clustering and Bottom-up Lattice Traversal) is a
frequent itemset mining algorithm based on the vertical data format. The algorithm first
converts the dataset into a vertical data format, where each item and the transaction ID in
which it appears are stored. Eclat then performs a depth-first search on a tree-like structure,
representing the dataset's frequent itemsets. The algorithm is efficient regarding both
memory usage and runtime, especially for sparse datasets.

Delve Deeper: Our Data Science Certification Course is Your Next Step. Enroll Now and
Transform Your Understanding into Practical Expertise.

Correlation Analysis in Data Mining

Correlation Analysis is a data mining technique used to identify the degree to which two or
more variables are related or associated with each other. Correlation refers to the statistical
relationship between two or more variables, where the variation in one variable is associated
with the variation in another variable. In other words, it measures how changes in one
variable are related to changes in another variable. Correlation can be positive, negative,
or zero, depending on the direction and strength of the relationship between the variables.

, For example,, we are studying the relationship between the hours of study and the grades
obtained by students. If we find that as the number of hours of study increases, the grades
obtained also increase, then there is a positive correlation between the two variables. On the
other hand, if we find that as the number of hours of study increases, the grades obtained
decrease, then there is a negative correlation between the two variables. If there is no
relationship between the two variables, we would say that there is zero correlation

Why is Correlation Analysis Important?

Correlation analysis is important because it allows us to measure the strength and direction
of the relationship between two or more variables. This information can help identify patterns
and trends in the data, make predictions, and select relevant variables for analysis. By
understanding the relationships between different variables, we can gain valuable insights
into complex systems and make informed decisions based on data-driven analysis.

Types of Correlation Analysis in Data Mining

There are three main types of correlation analysis used in data mining, as mentioned
below:

 Pearson Correlation Coefficient - Pearson correlation measures the linear

relationship between two continuous variables. It ranges from -1 to +1, where -1
indicates a perfect negative correlation, 0 indicates no correlation, and +1 indicates a
perfect positive correlation. The Pearson correlation coefficient between two
variables, X and Y, is calculated as follows -

ρX,Y=cov⁡(X,Y)σXσY=∑i=1n(Xi−Xˉ)(Yi−Y ˉ)∑i=1n(Xi−X ˉ)2∑i=1n(Yi−Y ˉ)2 ρX,Y

=σXσYcov(X,Y)=∑i=1n(Xi−Xˉ)2∑i=1n(Yi−Yˉ)2∑i=1n(Xi−Xˉ)(Yi−Yˉ)

where cov⁡(X,Y)cov(X,Y) is the covariance between variables XX and YY,

and σXσX and σYσY are the standard deviations of variables XX and YY, respectively.

 Kendall Rank Correlation - Kendall correlation is a non-parametric measure of the

association between two ordinal variables. It measures the degree of
correspondence between the ranking of observations on two variables. It calculates
the difference between the number of concordant pairs (pairs of observations that
have the same rank order in both variables) and discordant pairs (pairs of
observations that have an opposite rank order in the two variables) and normalizes
the result by dividing by the total number of pairs. The formula for the Kendall
correlation is -

τ=nc−nd12n(n−1)τ=21n(n−1)nc−nd

where ncnc is the number of concordant pairs, ndnd is the number of discordant
pairs, n0n0 is the total number of pairs, and nn represents the sample size.

 Spearman Rank Correlation - Spearman correlation is another non-parametric

measure of the relationship between two variables. It measures the degree of
association between the ranks of two variables. Spearman correlation is similar to the
Kendall correlation in that it measures the strength of the relationship between two
variables measured on a ranked scale. However, Spearman correlation uses the actual
numerical ranks of the data instead of counting the number of concordant and
discordant pairs. The formula for Spearman correlation is -

ρs=1−6∑di2n(n2−1)ρs=1−n(n2−1)6∑di2

where dd is the difference between the ranks of the paired observations and nn is the
number of observations.
Interpreting Results Of Correlation Analysis

After performing a correlation analysis, it is important to interpret the results to draw

meaningful conclusions about the relationship between the analyzed variables. One common
way to interpret correlation coefficients is by using the following general guidelines -

 Any score from +0.5 to +1 indicates a very strong positive correlation, meaning that
the variables are strongly related in a positive direction, increasing together or
simultaneously.
 Any score from -0.5 to -1 indicates a strong negative correlation, meaning that the
variables are strongly related in a negative direction. It also means that as one
variable decreases, the other variable increases and vice-versa.
 A score of 0 indicates no correlation, meaning there is no relationship between the
analyzed variables.

Benefits of Correlation Analysis

Correlation analysis is a powerful tool in data mining and statistical analysis that offers
several benefits.

Some of the main benefits of correlation analysis are:

 Identifying Relationships - Correlation analysis helps identify the relationships

between different variables in a dataset. By quantifying the degree and direction of
the relationship, we can gain insights into how changes in one variable are likely to
affect the other.
 Prediction - Correlation analysis can help predict one variable's values based on
another variable's values. Building models based on correlations can predict future
outcomes and make informed decisions.
 Feature Selection - Correlation analysis can also help select the most relevant
features for a particular analysis or model. By identifying the features that are highly
correlated with the outcome features, we can focus on those features and exclude
the irrelevant ones, improving the accuracy and efficiency of the analysis or model.
 Quality Control - Correlation analysis is useful in quality control applications, where
it can be used to identify correlations between different process variables and
identify potential sources of quality problems.

Multilevel And Multidimensional Association Rules

Multilevel Association Rules:

 Association rules generated from mining data at multiple levels of abstraction are
called multiple-level or multilevel association rules.
 Multilevel association rules can be mined efficiently using concept hierarchies under
a support-confidence framework.
 Rules at high concept level may add to common sense while rules at low concept
level may not be useful always.
o Using uniform minimum support for all levels:
  When a uniform minimum support threshold is used, the search procedure is
simplified.
 The method is also simple, in that users are required to specify only one minimum
support threshold.
 The same minimum support threshold is used when mining at each level of
abstraction.
 For example, in Figure, a minimum support threshold of 5% is used throughout.
 (e.g. for mining from “computer” down to “laptop computer”).
 Both “computer” and “laptop computer” are found to be frequent, while “desktop
computer” is not.
 Using reduced minimum support at lower levels:
o Each level of abstraction has its own minimum support threshold.
o The deeper the level of abstraction, the smaller the corresponding threshold
is.
o For example in Figure, the minimum support thresholds for levels 1 and 2 are
5% and 3%, respectively.
o In this way, “computer,” “laptop computer,” and “desktop computer” are all
considered frequent.

Multilevel Association rule consists of alternate search strategies and

Controlled level cross filtering:
Alternate Search Strategies:
 Level by level independent:
o Full breadth search.
o No background knowledge in pruning.
o Leads to examine lot of infrequent items.
 Level-cross filtering by single item:
o Examine nodes at level i only if node at level (i-1) is frequent.
o Misses frequent items at lower level abstractions (due to reduced support).
 Level-cross filtering by k-item set:
o Examine k-itemsets at level i only if k-itemsets at level (i-1) is frequent.
o Misses frequent k-itemsets at lower level abstractions (due to reduced
support).
 Controlled Level-cross filtering by single item:
o A modified level-cross filtering by single item.
o Sets a level passage threshold for every level.
 Allows the inspection of lower abstractions even if its ancestor fails to satisfy min_sup
threshold.

What are multidimensional association rules ? Mention few

approaches to mining multilevel association rule.

 Ans.
Association rules that involve two or more dimensions or
predicates can be referred to as multidimensional association rules.
For instance, the rule

age(X, “20.....29') ^ occupation(X, "student”) = buys(X, "laptop”)

 contains three predicates (age, occupation, and buys), each of
which occurs only once in the rule. Hence, we say that it has no
repeated predicates. Multidimensional association rules with no
repeated predicates are called inter dimensional association rules.
We can also mine multidimensional association rules with repeated
predicates, which contain multiple occurrences of some predicates.
These rules are called hybrid-dimensional association rules.

An example of such a rule is the following, where the predicate buys

is repeated -

age(X, “20.....29") ^ buys(X, “laptop”) => buys(X, “HP printer”)

Database attributes can be categorical or quantitative. Categorical

attributes have a finite number of possible values, with no ordering
among the values. Quantitative attributes are numeric and have an
implict ordering among values. Techniques for mining
multidimensional association rules can be categorized into two basic
approaches regarding the treatment of quantitative attributes -

(i) Static Discretization of Quantitative Attributes – In the first

approach, quantitative attributes are discretized using predefined
concept hierarchies. This discretization occurs before mining. For
instance, a concept hierarchy for income may be used to replace
the original numeric values of this attribute by interval labels, such
as “0.......20K”, “21 K........30K”, “31K........40K”, and so on. Here,
discretization is static and predetermined. The discretized numeric
attributes, with their interval labels, can then be treated as
categorical attributes (where each interval is considered a
category). We refer to this as mining multidimensional association
rules using static discretization of quantitative attributes.

(ii) Dynamic Quantitative Association Rules – In the second

approach, quantitative attributes are discretized or clustered into
"bins” based on the distribution of the data. These bins may be
further combined during the mining process. The discretization
process is dynamic and established so as to satisfy some mining
criteria, such as maximizing the confidence of the rules mined.
Because this strategy treats the numeric attribute values as
quantities rather than as predefined ranges or categories,
association rules mined from this approach are also referred to as
(dynamic) quantitative association rules.

Association and Correlation in Data Mining

What is Association?

Association is a technique used in data mining to identify the relationships or co-

occurrences between items in a dataset. It involves analyzing large datasets to
discover patterns or associations between items, such as products purchased
together in a supermarket or web pages frequently visited together on a website.
Association analysis is based on the idea of finding the most frequent patterns or
itemsets in a dataset, where an itemset is a collection of one or more items.

Association analysis can provide valuable insights into consumer behaviour and
preferences. It can help retailers identify the items that are frequently purchased
together, which can be used to optimize product placement and promotions.
Similarly, it can help e-commerce websites recommend related products to
customers based on their purchase history.

Types of Associations

Here are the most common types of associations used in data mining:

 Itemset Associations: Itemset association is the most common type of

association analysis, which is used to discover relationships between items
in a dataset. In this type of association, a collection of one or more items
that frequently co-occur together is called an itemset. For example, in a
supermarket dataset, itemset association can be used to identify items that
are frequently purchased together, such as bread and butter.
 Sequential Associations: Sequential association is used to identify patterns
that occur in a specific sequence or order. This type of association analysis
is commonly used in applications such as analyzing customer behaviour on
e-commerce websites or studying weblogs. For example, in the weblogs
dataset, a sequential association can be used to identify the sequence of
pages that users visit before making a purchase.
 Graph-based Associations Graph-based association is a type of association
analysis that involves representing the relationships between items in a
dataset as a graph. In this type of association, each item is represented as a
node in the graph, and the edges between nodes represent the co-
occurrence or relationship between items. The graph-based association is
used in various applications, such as social network analysis,
recommendation systems, and fraud detection. For example, in a social
network dataset, identifying groups of users with similar interests or
behaviours.

Association Rule Mining

Here are the most commonly used algorithms to implement association rule mining in
data mining:

 Apriori Algorithm - Apriori is one of the most widely used algorithms for association
rule mining. It generates frequent item sets from a given dataset by pruning
 infrequent item sets iteratively. The Apriori algorithm is based on the concept that if
an item set is frequent, then all of its subsets must also be frequent. The algorithm
first identifies the frequent items in the dataset, then generates candidate itemsets
of length two from the frequent items, and so on until no more frequent itemsets
can be generated. The Apriori algorithm is computationally expensive, especially for
large datasets with many items.
 FP-Growth Algorithm - FP-Growth is another popular algorithm for association rule
mining that is based on the concept of frequent pattern growth. It is faster than the
Apriori algorithm, especially for large datasets. The FP-Growth algorithm builds a
compact representation of the dataset called a frequent pattern tree (FP-tree),
which is used to mine frequent item sets. The algorithm scans the dataset only twice,
first to build the FP-tree and then to mine the frequent itemsets. The FP-Growth
algorithm can handle datasets with both discrete and continuous attributes.
 Eclat Algorithm - Eclat (Equivalence Class Clustering and Bottom-up Lattice Traversal)
is a frequent itemset mining algorithm based on the vertical data format. The
algorithm first converts the dataset into a vertical data format, where each item and
the transaction ID in which it appears are stored. Eclat then performs a depth-first
search on a tree-like structure, representing the dataset's frequent itemsets. The
algorithm is efficient regarding both memory usage and runtime, especially for
sparse datasets.

Delve Deeper: Our Data Science Certification Course is Your Next Step. Enroll Now and
Transform Your Understanding into Practical Expertise.

Correlation Analysis in Data Mining

Correlation Analysis is a data mining technique used to identify the degree to which two or
more variables are related or associated with each other. Correlation refers to the statistical
relationship between two or more variables, where the variation in one variable is associated
with the variation in another variable. In other words, it measures how changes in one
variable are related to changes in another variable. Correlation can be positive, negative,
or zero, depending on the direction and strength of the relationship between the variables.

, For example,, we are studying the relationship between the hours of study and the grades
obtained by students. If we find that as the number of hours of study increases, the grades
obtained also increase, then there is a positive correlation between the two variables. On the
other hand, if we find that as the number of hours of study increases, the grades obtained
decrease, then there is a negative correlation between the two variables. If there is no
relationship between the two variables, we would say that there is zero correlation.

Why is Correlation Analysis Important?

Correlation analysis is important because it allows us to measure the strength and direction
of the relationship between two or more variables. This information can help identify patterns
and trends in the data, make predictions, and select relevant variables for analysis. By
understanding the relationships between different variables, we can gain valuable insights
into complex systems and make informed decisions based on data-driven analysis.
Types of Correlation Analysis in Data Mining

There are three main types of correlation analysis used in data mining, as mentioned
below:

 Pearson Correlation Coefficient - Pearson correlation measures the linear

relationship between two continuous variables. It ranges from -1 to +1, where -1
indicates a perfect negative correlation, 0 indicates no correlation, and +1 indicates a
perfect positive correlation. The Pearson correlation coefficient between two
variables, X and Y, is calculated as follows -

ρX,Y=cov⁡(X,Y)σXσY=∑i=1n(Xi−Xˉ)
(Yi−Yˉ)∑i=1n(Xi−Xˉ)2∑i=1n(Yi−Yˉ)2ρX,Y=σXσYcov(X,Y)=∑i=1n(Xi−Xˉ)2
∑i=1n(Yi−Yˉ)2∑i=1n(Xi−Xˉ)(Yi−Yˉ)

where cov⁡(X,Y)cov(X,Y) is the covariance between variables XX and YY,

and σXσX and σYσY are the standard deviations of variables XX and YY, respectively.

 Kendall Rank Correlation - Kendall correlation is a non-parametric measure of the

association between two ordinal variables. It measures the degree of
correspondence between the ranking of observations on two variables. It calculates
the difference between the number of concordant pairs (pairs of observations that
have the same rank order in both variables) and discordant pairs (pairs of
observations that have an opposite rank order in the two variables) and normalizes
the result by dividing by the total number of pairs. The formula for the Kendall
correlation is -

τ=nc−nd12n(n−1)τ=21n(n−1)nc−nd

where ncnc is the number of concordant pairs, ndnd is the number of discordant
pairs, n0n0 is the total number of pairs, and nn represents the sample size.

 Spearman Rank Correlation - Spearman correlation is another non-parametric

measure of the relationship between two variables. It measures the degree of
association between the ranks of two variables. Spearman correlation is similar to the
Kendall correlation in that it measures the strength of the relationship between two
variables measured on a ranked scale. However, Spearman correlation uses the actual
numerical ranks of the data instead of counting the number of concordant and
discordant pairs. The formula for Spearman correlation is -

ρs=1−6∑di2n(n2−1)ρs=1−n(n2−1)6∑di2

where dd is the difference between the ranks of the paired observations and nn is the
number of observations.
Interpreting Results Of Correlation Analysis

After performing a correlation analysis, it is important to interpret the results to draw

meaningful conclusions about the relationship between the analyzed variables. One common
way to interpret correlation coefficients is by using the following general guidelines -

 Any score from +0.5 to +1 indicates a very strong positive correlation, meaning that
the variables are strongly related in a positive direction, increasing together or
simultaneously.
 Any score from -0.5 to -1 indicates a strong negative correlation, meaning that the
variables are strongly related in a negative direction. It also means that as one
variable decreases, the other variable increases and vice-versa.
 A score of 0 indicates no correlation, meaning there is no relationship between the
analyzed variables.

Benefits of Correlation Analysis

Correlation analysis is a powerful tool in data mining and statistical analysis that
offers several benefits.

Some of the main benefits of correlation analysis are:

 Identifying Relationships - Correlation analysis helps identify the

relationships between different variables in a dataset. By quantifying the
degree and direction of the relationship, we can gain insights into how
changes in one variable are likely to affect the other.
 Prediction - Correlation analysis can help predict one variable's values
based on another variable's values. Building models based on correlations
can predict future outcomes and make informed decisions.
 Feature Selection - Correlation analysis can also help select the most
relevant features for a particular analysis or model. By identifying the
features that are highly correlated with the outcome features, we can focus
on those features and exclude the irrelevant ones, improving the accuracy
and efficiency of the analysis or model.
 Quality Control - Correlation analysis is useful in quality control
applications, where it can be used to identify correlations between
different process variables and identify potential sources of quality
problems.

Use Cases for Correlation Analysis and Association Mining

Here are some examples of the most common use cases for association and
correlation in data mining -
  Market Basket Analysis - Association mining is commonly used in retail and
e-commerce industries to identify patterns in customer purchase
behaviour. By analyzing transaction data, businesses can uncover product
associations and make informed decisions about product placement,
pricing, and marketing strategies.
 Medical Research - Correlation analysis is often used in medical research to
explore relationships between different variables, such as the correlation
between smoking and lung cancer risk or the correlation between blood
pressure and heart disease.
 Financial Analysis - Correlation analysis is frequently used in financial
analysis to measure the strength of relationships between different
financial variables, such as the correlation between stock prices and
interest rates.
 Fraud Detection - Association mining can be used to identify behaviour
patterns associated with fraudulent activity, such as multiple failed login
attempts or unusual purchase patterns.

Constraint-Based Association Mining

A data mining procedure can uncover thousands of rules from a given set of
information, most of which end up being independent or tedious to the users.
Users have a best sense of which “direction” of mining can lead to interesting
patterns and the “form” of the patterns or rules they can like to discover.
Therefore, a good heuristic is to have the users defines such intuition or
expectations as constraints to constraint the search space. This strategy is
called constraint-based mining.
Constraint-based algorithms need constraints to decrease the search area in
the frequent itemset generation step (the association rule generating step is
exact to that of exhaustive algorithms).
The general constraint is the support minimum threshold. If a constraint is
uncontrolled, its inclusion in the mining phase can support significant
reduction of the exploration space because of the definition of a boundary
inside the search space lattice, following which exploration is not needed.
The important of constraints is well-defined − they create only association
rules that are appealing to users. The method is quite trivial and the rules
space is decreased whereby remaining methods satisfy the constraints.
Constraint-based clustering discover clusters that satisfy user-defined
preferences or constraints. It depends on the characteristics of the
constraints, constraint-based clustering can adopt rather than different
approaches.
The constraints can include the following which are as follows −
Knowledge type constraints − These define the type of knowledge to be
mined, including association or correlation.
Data constraints − These define the set of task-relevant information such
as Dimension/level constraints − These defines the desired dimensions (or
attributes) of the information, or methods of the concept hierarchies, to be
utilized in mining.
Interestingness constraints − These defines thresholds on numerical
measures of rule interestingness, including support, confidence, and
correlation.
Rule constraints − These defines the form of rules to be mined. Such
constraints can be defined as metarules (rule templates), as the maximum or
minimum number of predicates that can appear in the rule antecedent or
consequent, or as relationships between attributes, attribute values, and/or
aggregates.
The following constraints can be described using a high-level declarative data
mining query language and user interface. This form of constraint-based
mining enables users to define the rules that they can like to uncover, thus
by creating the data mining process more efficient.
Furthermore, a sophisticated mining query optimizer can be used to deed the
constraints defined by the user, thereby creating the mining process more
effective. Constraint-based mining boost interactive exploratory mining and
analysis.

Data
Warehousing and Data
Mining
 Data
Warehousing and Data
Mining
Mining multilevel and

multidimensional

association rules
Motivation
(Why you
(students) should
learn these
topics?)
The CDT17 provides
knowledge on Mining
closed frequent item sets .
Lecture Learning
Outcomes (LLOs): After
completion of this lecture,
you should be
able to…
LLO1
On topic 1
association rules Mining
types multilevel and multi
dimensional .
Lecture Summary – Key
Takeaways
Multilevel Association
Rule :
Association rules
created from mining
information at different
degrees of reflection
are called various level
or staggered
association rules.
Multilevel association
rules can be mined
effectively utilizing idea
progressions under a
help certainty system.
Rules at a high idea
level may add to good
judgment while rules at
a low idea level may
not be valuable
consistently
Mining multilevel and

multidimensional

association rules
Motivation
(Why you
(students) should
learn these
topics?)
The CDT17 provides
knowledge on Mining
closed frequent item sets .
Lecture Learning
Outcomes (LLOs): After
completion of this lecture,
you should be
able to…
LLO1
On topic 1
association rules Mining
types multilevel and multi
dimensional .
Lecture Summary – Key
Takeaways
Multilevel Association
Rule :
Association rules
created from mining
information at different
degrees of reflection
are called various level
or staggered
association rules.
Multilevel association
rules can be mined
effectively utilizing idea
progressions under a
help certainty system.
Rules at a high idea
level may add to good
judgment while rules at
a low idea level may
not be valuable
consisten
Mining multilevel

and multidimensional

association rules
Motivation
(Why you
(students) should
learn these
topics?)
The CDT17 provides
knowledge on Mining
closed frequent item sets .
Lecture Learning
Outcomes (LLOs): After
completion of this lecture,
you should be
able to…
LLO1
On topic 1
association rules Mining
types multilevel and multi
dimensional .
Lecture Summary – Key
Takeaways
Multilevel Association
Rule :
Association rules
created from mining
information at different
degrees of reflection
are called various level
or staggered
association rules.
Multilevel association
rules can be mined
effectively utilizing idea
progressions under a
help certainty system.
Rules at a high idea
level may add to good
judgment while rules at
a low idea level may
not be valuable
consistent