New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Mining Association Rules Quiz

Quiz

Played 2 %Accuracy 0 Average time 00:34

About this activity

Association rules basics

Created by

India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Mining Association Rules Quiz
 

Mining Association Rules QuizOnline version

Association rules basics

by 20524UCSC022 MALAVIGA M
1

In a single-dimensional Boolean association rule, what does the rule express in a transaction?

2

What is the support of an itemset?

3

What does confidence measure in association rules?

4

What is lift in association rules?

5

What are multilevel association rules?

6

What are multidimensional association rules?

7

Where are multilevel rules most naturally mined?

8

What is a primary difference between transaction databases and data warehouses for rule mining?

9

Which metric helps prune weak rules in many mining tasks?

10

What is the primary purpose of decision tree induction in classification?

11

Which algorithm is commonly used for Bayesian classification?

12

In backpropagation, what is updated during learning?

13

Classification concepts from Association Rule Mining derive rules relating what?

14

What does classifier accuracy measure?

15

Name a common issue in classification that can harm prediction quality.

16

Which criterion is often used to build a decision tree?

17

What is a key difference between Naive Bayes and decision trees?

18

What does backpropagation optimize in neural nets?

19

How is prediction accuracy commonly computed?

Feedback

The rule links presence of X with Y; it is not guaranteed (probabilistic).

Support is a frequency proportion, not a raw count or probability of the rule itself.

Confidence = P(Y|X), not P(X|Y) or support, and not a rank measure.

Lift >1 indicates positive dependence; it compares observed vs. expected under independence.

They exploit hierarchies like product category, subcategory, item level.

They combine dimensions like customer, product, store in warehouses.

Hierarchies exist in catalogs, product trees, or feature families.

Warehouses support historical, consolidated analysis; transactions are day-to-day.

Weak rules have low confidence or lift close to 1; pruning uses these cues.

Decision trees partition data using feature values to assign class labels.

Naive Bayes applies Bayes’ rule with often strong feature independence assumptions.

Backpropagation adjusts edge weights to minimize error.

Association rules relate antecedent itemsets to consequent outcomes or classes.

Accuracy = correct predictions divided by total predictions.

Overfitting captures noise instead of signal, reducing generalization.

Splits are chosen to maximize information gain or minimize impurity.

Naive Bayes uses probabilistic independence assumptions; trees partition data hierarchically.

Backpropagation propagates error gradients to update weights to reduce error.

Accuracy = (true positives + true negatives) / total cases.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.