Skip to content
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.

Commit 2e87b79

Browse files
authoredOct 8, 2021
Updated Readme
1 parent 3bfa239 commit 2e87b79

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed
 

‎Readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,8 +10,8 @@
1010

1111

1212
## 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.
1414

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.
1616

1717
#### More details are presented in the User manual shared with this assignment

0 commit comments

Comments
 (0)
Please sign in to comment.