You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: Readme.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -10,8 +10,8 @@
10
10
11
11
12
12
## Project Details (Apriori algorithm)
13
-
- Apriori Algorithm: describes that the superset of infrequent sets are always infrequent. Or we can say that group of items are frequent only if the individual items within the group are frequently picked. This approach is the best way to reduce the size of the set and make the process of finding the frequent random set process more efficient.
13
+
- Apriori Algorithm: describes that the superset of infrequent sets are always infrequent. Or we can say that group of items are frequent only if the individual items within the group are frequently picked. This approach is the best way to reduce the size of the set and make the process of finding the frequent itemsets to be more efficient.
14
14
15
-
- By the end of this assignment we would get a set of association rules.
15
+
- By the end of this assignment we would also get a set of association rules by which we can confidently say which items are bought together. Hence, Apriori is one of the best approach for building shopping recommendations system.
16
16
17
17
#### More details are presented in the User manual shared with this assignment
0 commit comments