Apriori Algorithm

[sarang shah]

On Sunday, March 7, 2021 at 11:55:21 AM UTC-6, Avi Gross wrote:
> I apologize for my earlier snide remark as I was not then aware there was an 
> algorithm called apriori based on the Latin term and wondered if someone was 
> pulling someone's leg, in advance. 
> 
> Someone has posted a pointer to Python code that is supposed to do that. If 
> that is suitable, then the serious task is to read what they say and use it. 
> I note the data you show below is ambiguous and not in the format that code 
> asks for. 
> 
> Are you saying each line I see of what looks like integers is a grouping you 
> want to contrast to other such lines in the algorithm? I doubt it can be 
> used as is but needs to become some kind of data structure such as a list of 
> tuples or whatever the algorithm wants.
> -----Original Message----- 
> From: Python-list <python-list-bounces+avigross=veriz... at python.org> On
> Behalf Of dn via Python-list 
> Sent: Sunday, March 7, 2021 3:09 AM 
> To: pytho... at python.org 
> Subject: Re: Apriori Algorithm 
> 
> On 07/03/2021 20.56, sarang shah wrote:
> > I have this dataset in a text file I need to make an apriori algorithm 
> based on it. Please help. 
> > 
> > 25 52 164 240 274 328 368 448 538 561 630 687 730 775 825 834 
> > 39 120 124 205 401 581 704 814 825 834 
> > 35 249 674 712 733 759 854 950 
> > 39 422 449 704 825 857 895 937 954 964 
> > 15 229 262 283 294 352 381 708 738 766 853 883 966 978 
> > 26 104 143 320 569 620 798 
> > 7 185 214 350 529 658 682 782 809 849 883 947 970 979 
> > 227 390 
> > 71 192 208 272 279 280 300 333 496 529 530 597 618 674 675 720 855 914 932 
> 
> > 183 193 217 256 276 277 374 474 483 496 512 529 626 653 706 878 939 
> > 161 175 177 424 490 571 597 623 766 795 853 910 960 
> > 125 130 327 698 699 839 
> > 392 461 569 801 862 
> > 27 78 104 177 733 775 781 845 900 921 938 
> > 101 147 229 350 411 461 572 579 657 675 778 803 842 903 
> > 71 208 217 266 279 290 458 478 523 614 766 853 888 944 969 
> > 43 70 176 204 227 334 369 480 513 703 708 835 874 895 
> > 25 52 278 730 
> > 151 432 504 830 890
> Great! 
> For what purpose - is this a 'homework assignment'? 
> What code do you have so far? 
> 
> -- 
> Regards, 
> =dn
> -- 
> https://mail.python.org/mailman/listinfo/python-list




Yes. Each line is a group set. 

a.Pleaseimplement analgorithm of your choice (Apriori, or FP-Tree) tofind frequent itemsets. You can importstandardlibraries/modules, but thealgorithm should be written by yourself. Min-support should be a user input parameter. Two sample of transaction datasets, Dataset1and Dataset2, are providedto test if your program works correctly.You can usePython, Java or C++.

 b.  Extend your program to output all the maximal frequent itemsets and closed frequent itemsets. 
c.  Extend your program to output all the association rules. Min-Confidence should be a user input parameter. For all the association rules, output measures include support, confidence, lift, all-confidence and cosine.