Lecture 5 Apriori algorithm

Поделиться
HTML-код
  • Опубликовано: 17 дек 2024

Комментарии • 11

  • @rishabhbandi3368
    @rishabhbandi3368 4 года назад +3

    Very helpful video, Great teaching!

  • @taqihussain4595
    @taqihussain4595 5 лет назад +2

    amazing videos
    thank u so much sir

  • @pawanchoure1289
    @pawanchoure1289 3 года назад +3

    if an itemset is frequent then it's subset should also be frequent : Apriori Algorithm

  • @rakshaagarwal832
    @rakshaagarwal832 3 года назад +1

    If there are six items then aren't all possible combinations 64 (2^6). How do we get to 41? please explain.

    • @shemamilton7326
      @shemamilton7326 3 года назад

      Becoz he removed coke and eggs thats why 41 itemset

    • @kaustavdas6550
      @kaustavdas6550 3 года назад

      You are thinking about the permutations think about the combination in each CASE.

    • @ronaldcsjohnson4790
      @ronaldcsjohnson4790 2 года назад

      @@kaustavdas6550 there are 2^d combinations

    • @sapkyoshi
      @sapkyoshi Год назад

      @@ronaldcsjohnson4790 No there are not. For example, the order or a and b does not matter so ab and ba will be treated the same.

  • @diptenkumar
    @diptenkumar 3 года назад +14

    This concept can be explained in eight to ten minutes instead of 27 minutes

    • @bahetyshyam
      @bahetyshyam Месяц назад

      2x brother. Watch all his videos in 2x xD