Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- % Here, you should fill in the code of the apriori algorithm
- % (see slides of the lecture: "APRIORI algorithm")
- sortedA = find(mean(database) >= min_frequency);
- while ~isempty(candidates)
- nextWords = apriori_gen(candidates, sortedA)';
- candidates = prune_itemsets(nextWords, database, min_frequency);
- frequent_itemsets = [frequent_itemsets, candidates];
- end
Advertisement
Add Comment
Please, Sign In to add comment