2.Apply the Apriori algorithm to the following transactional data. The data has been obtained from a popular supermarket chain in Nairobi during the school's opening week. Assume minimum support of minimum support of 25%, and minimum confidence 55%, and derive a rule or rules. Transaction ID Items 1 biscuits, juice, pencil blueband, toothpaste, ink toothpaste, sugar, jam, juice, ink| juice, shoe polish, sugar, cocoa coffee, jam, sugar, juice 6. toothpaste, pencil, toothbrush 7 sugar, shoe polish, toothpaste, juice, blueband 8. juice, sugar, soap, tea 9. Cocoa, sugar, biscuits 10 detergent, soap, blueband 11 sugar, juice, ink, biscuits 12 blueband, juice, biscuits, soap, ink 2. 3. 5.

2.Apply the Apriori algorithm to the following transactional data. The data has been obtained from a popular supermarket chain in Nairobi during the school's opening week. Assume minimum support of minimum support of 25%, and minimum confidence 55%, and derive a rule or rules. Transaction ID Items 1 biscuits, juice, pencil blueband, toothpaste, ink toothpaste, sugar, jam, juice, ink| juice, shoe polish, sugar, cocoa coffee, jam, sugar, juice 6. toothpaste, pencil, toothbrush 7 sugar, shoe polish, toothpaste, juice, blueband 8. juice, sugar, soap, tea 9. Cocoa, sugar, biscuits 10 detergent, soap, blueband 11 sugar, juice, ink, biscuits 12 blueband, juice, biscuits, soap, ink 2. 3. 5.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter24: Forecasting Models

Section: Chapter Questions

Problem 10RP

See similar textbooks

Similar questions

It's a Machine Learning question. Suppose we have market basket data consisting of 100 transactions and 20 items. Compute the total number of possible association rules. If the support for item A is 25%, the support for item B is 90% and the support for itemset {A,B} is 20%. Let the support and conﬁdence thresholds be 10% and 60%, respectively. Compute the conﬁdence of the association rule {A} → {B} & {B} → {A}.
Suppose that you want to increase all three of the resource availabilities in the product mix model simultaneously by the same percentage. You want this percentage to vary from 225% to 50% in increments of 5%. Modify the spreadsheet model slightly so that this sensitivity analysis can be performed with a one- way SolverTable, using the percentage change as the single input. Keep track of the computers produced in row 21, the hours used in the range B26:B28, and the total profit. Discuss the results.
Q2: To answer this question, let's take an example of a university faculty with six professors (3 men and 3 women). Professors are ranked from lowest to highest, with 1 being the lowest and 3 being the highest. The male professors are identified as Rao (1), Lalit (3) and Ahmed (2). The Professor's names with their ranks are Monu (3), Rana (1), and Kitty (2). Below are some examples of situations. For each example, provide an ASN.1 description of the record values and their corresponding data types. Consider the ProfessorData data type, which contains details about each professor. An alphabetical list of professors. A list of professors in descending order. There are two sets of professors, each of which consists of a higher-ranking female professor and a male professor of a lower level.
Suppose you have trained an anomaly detection system for fraud detection, and your system that flags anomalies when p(x) is less than ε, and you find on the cross-validation set that it is mis-detecting many fradulent transactions (i.e., failing to flag them as anomalies). What should you do? Group of answer choices a. Cannot be determined b. Increase ε c. Keep ε same
Please use Housingdataset.csv file. Build a Transaction Type predictive model using 3 different learning algorithms (e.g. KNN, MLP, SVM) Complete the table below. Accuracy Precision Recall Logistic Regression MLP SVM Briefly explain your methodology and the implication of your result. For a full credit, please include all relevant mathematical formulars and diagrams.
Let c1, c2, and c3 be the confidence values of the rules {p}->{q}, {p}->{q, r}, and {p, r}->{q}, respectively. If we assume that c1, c2, and c3 have different values, what are the possible relationships that may exist among c1, c2, and c3? Which rule has the lowest confidence?
In a corpus of size 3,00,000 documents we have the following term frequencies for some of the terms: ShivKera RuskinBond ChetanBhagat VikramSeth RabindranathTagore KiranDesai 24,000 1,000 10,000 4,000 13,000 7,000 Propose an evaluation plan for the following query: (ShivKera AND RuskinBond) AND (ChetanBhagat AND VikramSeth) OR (RabindranathTagore AND KiranDesai) in order to minimize the list processing time.
Consider the confusion matrix of a multi classification model which predicts whether a person loves Facebook, Instagram or Snapchat. Compute the Precision, Recall, F-measure, accuracy and error rate.
(1) How to prove H using given rules and facts: Rules: Rule 1 A ∧ B → C Rule 2 A → D Rule 3 C ∧ D → E Rule 4 B ∧ E ∧ F → G Rule 5 A ∧ E → H Facts: Fact 1 A Fact 2 B Fact 3 F Hint: The goal is to prove H. First let us use forward chaining. As the conflict resolution strategy, one will fire rules in the order they appear in the database. Let us fire Rule 1, which means to add C to the fact database. Next, Rule 2 is fired, meaning we add D to our fact database. We now have the facts A, B, C, D, F, but we have not yet reached our goal, which is H. Please list the rules to be triggered to add fact H to the database. Now consider using backward chaining. Does backward chaining use fewer rules?
Suppose we have market basket data consisting of 100 transactions and 20 items. Compute the total number of possible association rules. If the support for item A is 25%, the support for item B is 90% and the support for itemset {A,B} is 20%. Let the support and conﬁdence thresholds be 10% and 60%, respectively. Compute the conﬁdence of the association rule {A} → {B} & {B} → {A}. Consider the following data of software repository which represents set of source files changed together in six different transactions (TID). Transaction is an event in which developers change one or more source files together to incorporate changes in software. Table-1 TID Items (source files change together) 1 File1, File2, File3 2 File1, File2 3 File1, File4, File5 4 File5, File4 5 File5, File3 6 File1, File4, File5 Use Table-1 data and apply APRIORI algorithm to find the most frequent association rules which can…
1. Assume I have a technique for responding every single question from a certain set of feasible queries that meets differential privacy with delta = 0 and epsilon = 0.02. How many individual queries can I run in this manner if I always use independent noise and wish to keep under an overall privacy budget of epsilon' = 0.42?
Consider the following set of items {A, B, D, F, H}. Create a set of transactions such that the association rule {A, D} => {F, H} would have support=0.3 and confidence 0.6.