Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 316985
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 12, 20262026-05-12T08:26:02+00:00 2026-05-12T08:26:02+00:00

So a recent question made me aware of the rather cool apriori algorithm .

  • 0

So a recent question made me aware of the rather cool apriori algorithm. I can see why it works, but what I’m not sure about is practical uses. Presumably the main reason to compute related sets of items is to be able to provide recommendations for someone based on their own purchases (or owned items, etcetera). But how do you go from a set of related sets of items to individual recommendations?

The Wikipedia article finishes:

The second problem is to generate
association rules from those large
itemsets with the constraints of
minimal confidence. Suppose one of the
large itemsets is Lk, Lk = {I1, I2, …
, Ik}, association rules with this
itemsets are generated in the
following way: the first rule is {I1,
I2, … , Ik-1}⇒ {Ik}, by checking the
confidence this rule can be determined
as interesting or not. Then other rule
are generated by deleting the last
items in the antecedent and inserting
it to the consequent, further the
confidences of the new rules are
checked to determine the
interestingness of them. Those
processes iterated until the
antecedent becomes empty

I’m not sure how the set of association rules helps in determining the best set of recommendations either, though. Perhaps I’m missing the point, and apriori is not intended for this use? In which case, what is it intended for?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-12T08:26:02+00:00Added an answer on May 12, 2026 at 8:26 am

    So the apriori algorithm is no longer the state of the art for Market Basket Analysis (aka Association Rule Mining). The techniques have improved, though the Apriori principle (that the support of a subset upper bounds the support of the set) is still a driving force.

    In any case, the way association rules are used to generate recommendations is that, given some history itemset, we can check each rule’s antecedant to see if is contained in the history. If so, then we can recommend the rule’s consequent (eliminating cases where the consequent is already contained in the history, of course).

    We can use various metrics to rank our recommendations, since with a multitude of rules we may have many hits when comparing them to a history, and we can only make a limited number of recommendations. Some useful metrics are the support of a rule (which is the same as the support of the union of the antecedant and the consequant), the confidence of a rule (the support of the rule over the support of the antecedant), and the lift of a rule (the support of the rule over the product of the support of the antecedant and the consequent), among others.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

A recent question about string literals in .NET caught my eye. I know that
A recent question came up about using String.Format(). Part of my answer included a
A recent question about StyleCop alerted me to the use of tools to enforce
This recent question about sorting randomly using C# got me thinking about the way
As just stated in a recent question and answer , you can't inherit from
There is another recent Project Euler question but I think this is a bit
** MAJOR UPDATE ** I made a minor mistake but I'm still curious about
A recent talk about unordered_map in C++ made me realize that I should use
A recent question got me wondering about explicit copy constructors. Here is a sample
Following on from my recent question on Large, Complex Objects as a Web Service

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.