Machine learning classroom
Machine learning classroom
  • Видео 235
  • Просмотров 237 451
4.2 Right linear grammars
Right-linear grammars are special types of grammars, that turn out to be equivalent to finite automata in that they generate the class of recognizable languages. We discuss their definition and prove that they generate the class of recognisable languages.
Просмотров: 36

Видео

3.3 From automata to regular expressions: language equations.
Просмотров 606 месяцев назад
We show in this lecture how to build a regular expression corresponding to the language recognized by an automaton. We do this through language equations.
3.4 Non-regular languages
Просмотров 226 месяцев назад
In this lecture we discuss two techniques for proving that a language is NOT regular. One is through the so-called pumping lemma. The other is through the closure properties of regular languages. We illustrate the techniques through two examples.
3.2 From regular expressions to finite automata and back. Reg = Rec.
Просмотров 136 месяцев назад
We prove in this lecture Kleene’s theorem: the class of recognisable languages (accepted by finite automata) coincides with the class of regular languages (described by regular expressions).
3.1 Regular expressions
Просмотров 146 месяцев назад
Regular expressions are an easy way to define structural patterns, for example patterns to find in a text. We discuss their definitions and the sets of words they define, i.e., the regular languages.
2.7.2 The minimisation of finite automata: the formal construction
Просмотров 306 месяцев назад
A language can be recognized by many different automata. However, considering the smallest number of states one needs to recognise the language, there is a unique, so-called minimal, automaton for that language. In this lecture we finish our construction of the minimal automaton recognizing a given regular language L.
2.7.1 The minimisation of finite automata: an intuitive perspective
Просмотров 336 месяцев назад
A language can be recognized by many different automata. However, considering the smallest number of states one needs to recognize the language, there is a unique, so-called minimal, automaton for that language. In this lecture we start the discussion on how to construct the minimal automaton recognizing a language starting from an arbitrary automaton for it. We discuss the intuition of the con...
2.6 Closure properties of recognisable languages
Просмотров 766 месяцев назад
We prove that recognisable languages are closed under intersection, union, complement, concatenation and star. The proof is constructive: given automata recognising the input language(s), we construct automata recognising the result of each of these operations.
2.5.3 DFA=NFA. The subset construction: an example
Просмотров 1707 месяцев назад
We give an example in this video for the subset construction: how to build a deterministic finite automaton equivalent to a given nondeterministic one.
2.5.2 From a nondeterministic finite automaton to a deterministic one: the subset construction
Просмотров 647 месяцев назад
We prove in this lecture that a deterministic finite automaton can be built to recognize the same language recognized by an arbitrary nondeterministic finite automaton (without epsilon transitions). This is the so-called subset construction. We discuss the intuition behind the construction and its formal details.
2.5.1 Removing epsilon transitions from nondeterministic finite automata
Просмотров 2857 месяцев назад
We show in this lecture that for any nondeterministic automaton we can construct an equivalent nondeterministic automaton without epsilon transitions. We also give an example illustrating the construction.
2.5.0 Equivalence of nondeterministic and deterministic finite automata: an intuitive example
Просмотров 597 месяцев назад
As powerful as they are, nondeterministic finite automata have the same computational power as the deterministic finite automata: any language accepted nondeterministically can also be accepted deterministically. We explore the intuition behind this result and show one example of going from a nondeterministic automaton to an equivalent deterministic one.
2.4.2 Nondeterministic finite automata: formal definition
Просмотров 467 месяцев назад
We discuss here the formal definition of nondeterministic finite automata: set of states, the transition relation, empty transitions, successful and unsuccessful computations. We also give several examples.
2.4.1 Nondeterministic finite automata: an intuition
Просмотров 617 месяцев назад
We discuss in this lecture the intuition of what a nondeterministic finite automaton is and in general what a nondeterministic computation is. We go through an example illustrating that nondeterministic devices may have several computations, some of them successful/accepting, some ot them not. We discuss some advantages of nondeterministic computations (compact representation, dealing with inco...
2.3.2 Deterministic finite automata: formal definition
Просмотров 787 месяцев назад
We discuss in this lecture the formal definition of a deterministic finite automaton: its state set, alphabet, initial state, final states, and transition function. We also define what an accepting computation is, and what are the inputs recognized by an automaton.
2.3.1 What is a finite automaton?
Просмотров 957 месяцев назад
2.3.1 What is a finite automaton?
2.2 Language operations
Просмотров 357 месяцев назад
2.2 Language operations
2.1 Automata basic definitions: alphabet, words, languages
Просмотров 387 месяцев назад
2.1 Automata basic definitions: alphabet, words, languages
AI in your everyday life: how to discuss AI with high school students
Просмотров 4978 месяцев назад
AI in your everyday life: how to discuss AI with high school students
Gradient descent for classification problems
Просмотров 2699 месяцев назад
Gradient descent for classification problems
Logistic regression: basic concepts
Просмотров 2079 месяцев назад
Logistic regression: basic concepts
Gradient descent for regression problems
Просмотров 2759 месяцев назад
Gradient descent for regression problems
Linear regression: basic concepts
Просмотров 3569 месяцев назад
Linear regression: basic concepts
Supervised learning: basic concepts
Просмотров 4769 месяцев назад
Supervised learning: basic concepts
2.8 Relations as Boolean matrices
Просмотров 1512 года назад
2.8 Relations as Boolean matrices
2.7 Boolean matrices
Просмотров 1212 года назад
2.7 Boolean matrices
2.6 The representation theorem for finite Boolean algebras
Просмотров 4082 года назад
2.6 The representation theorem for finite Boolean algebras
2.5 Partial orders in Boolean algebras
Просмотров 2302 года назад
2.5 Partial orders in Boolean algebras
1.8 Inductive proofs for the correctness of programs: two simple examples
Просмотров 1272 года назад
1.8 Inductive proofs for the correctness of programs: two simple examples
1.7 Structural induction
Просмотров 3812 года назад
1.7 Structural induction

Комментарии

  • @zPoiison
    @zPoiison День назад

    I got a little confused: how can the concept 'c' be a set? Isn't it a rule that associates the X to the Label set Y? In this case, as you said Y is binary (e.g. Y = {0,1}). Wouldn't it be X the set of points in a triangle and then the concept c would associate the points to 0 or 1?

    • @MLClassroom
      @MLClassroom 15 часов назад

      The concept is indeed, as you wrote, thought of as a function that associates 0/1 to the data points: 0 for those point that do not belong to "the concept" and 1 for those that do. The same is achieved by considering the set of those data points whose label is 1. In this way, the concept is a set: the set of the points labeled 1.

  • @bajes328
    @bajes328 5 дней назад

    audio quality here is bad, don't know why, lots of white noise good video otherwise though

    • @MLClassroom
      @MLClassroom 5 дней назад

      I know, for this video I had a slightly different setup: different microphone and a different room (some echo can be heard). Tried to smooth it in the editing software, this is the best I could get.

    • @bajes328
      @bajes328 5 дней назад

      @@MLClassroom I understand, noise is often difficult for me too.

  • @abrarhasan4197
    @abrarhasan4197 7 дней назад

    Hello sir! Can I get the ppt slides from you are using?

    • @MLClassroom
      @MLClassroom 7 дней назад

      I am sorry but I cannot provide the slides.

    • @abrarhasan4197
      @abrarhasan4197 6 дней назад

      @@MLClassroom its ok sir. But your contents are really awesome! Thanks for the lectures

    • @MLClassroom
      @MLClassroom 6 дней назад

      @@abrarhasan4197 Thank you, I am grateful for your feedback.

  • @saisureshmacharlavasu3116
    @saisureshmacharlavasu3116 3 месяца назад

    good job

  • @namrathaih1036
    @namrathaih1036 4 месяца назад

    Not undeestanding peoperly

  • @spacemule1
    @spacemule1 4 месяца назад

    What an absolute goldmine your channel!! And its all free!! Thank you! Can you say which of your playlists is the most fundamental to machine learning?

    • @MLClassroom
      @MLClassroom 4 месяца назад

      Thank you so much for the positive feedback! I Have one playlist that contains all videos in the order that I teach them in my university. And there are many playlist focusing on a single topic, with several videos building up to the mani aspects of that topic. I am not sure that one is more fundamental than another. They are all fundamental in the sense that they explore the mathematical foundations of the various topics, and they try to be lucid about the methods, the reasons they work as they are, and their limitations. I am in fact very curios how different people find the different topics and the way I teach them.

    • @spacemule1
      @spacemule1 4 месяца назад

      @@MLClassroom Ah yes I see the big playlist where it is in order thats what i was looking for!

  • @satyanagendraraosatuluri2146
    @satyanagendraraosatuluri2146 5 месяцев назад

    0 is not a natural number sir

    • @MLClassroom
      @MLClassroom 5 месяцев назад

      There is a long and interesting discussion about 0: whether it is a natural number or not, and even whether it is a number at all. A brief hint at it is on Wikipedia (en.wikipedia.org/wiki/Natural_number). Historically, 0 is a late addition and conceptually/philosophically there is no agreement whether 0 (standing for "nothing") should be called a number, or whether something we use for mathematical convenience. Some more details on this are at mathfoundations.lti.cs.cmu.edu/class2/naturals.html, wiki.c2.com/?NaturalNumber, ruclips.net/video/6upQWEpHhuc/видео.html.

  • @shoaibgoraya6597
    @shoaibgoraya6597 6 месяцев назад

    nice Explanation 😍

    • @MLClassroom
      @MLClassroom 6 месяцев назад

      Thank you, great to hear this was useful!

  • @chadanaballa9500
    @chadanaballa9500 6 месяцев назад

    thank you so much sir, u r the only one who explained all estimators..😊😊😊

    • @MLClassroom
      @MLClassroom 6 месяцев назад

      Thank you for your kind comments, glad to have helped!

  • @raveenakumari6724
    @raveenakumari6724 6 месяцев назад

    could you please make videos on Parzen- Window and K- nearest neighbour also🙏🙏

    • @MLClassroom
      @MLClassroom 6 месяцев назад

      On k-NN I have a video at ruclips.net/video/glSGhHjnSFI/видео.html. On Parzen-Window I do not, but I do have several videos on kernel methods in this list. I hope this helps.

    • @raveenakumari6724
      @raveenakumari6724 6 месяцев назад

      @@MLClassroom Thank you so much. If possible, please upload a video on parzen window as well.

  • @josephthomas3532
    @josephthomas3532 7 месяцев назад

    Thank you for such a good explanation!

    • @MLClassroom
      @MLClassroom 7 месяцев назад

      Thanks for your positive comment!

  • @emirkafadar4691
    @emirkafadar4691 7 месяцев назад

    Thank you for your great content!

    • @MLClassroom
      @MLClassroom 7 месяцев назад

      Thank you for your kind comment.

  • @bartucelasun4909
    @bartucelasun4909 7 месяцев назад

    thanks a lot for these ML lectures.

    • @MLClassroom
      @MLClassroom 7 месяцев назад

      Thanks for your message, great to hear you find them useful!

  • @ralu0filth
    @ralu0filth 8 месяцев назад

    ma bucur mult ca v-am gasit!

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      Mulțumesc pentru mesaj, sper sa va ajute videourile astea.

  • @KyaPataKya
    @KyaPataKya 8 месяцев назад

    Wow this was so well explained, thank you

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      Thanks, good to know this was useful.

  • @NabidAlam360
    @NabidAlam360 8 месяцев назад

    Is it also possible to provide slides for these lectures if you already have created! thank you Prof for amazing videos! Or it would be very helpful if you share all the written notes that you performed in video, then it is easier for students to review what you taught! You can share all notes in one link and share in the description so that we can review them! Thanks Prof!

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      Thank you for the suggestion. For most videos I have the slides, for some (like this one that we comment on) I do not, as I wrote directly on the screen all the text. I am not sure yet on a good platform to share them on, and a good way to cross-reference them with the videos. RUclips is not quite right for this.

    • @NabidAlam360
      @NabidAlam360 8 месяцев назад

      @@MLClassroom Thanks Prof, may be you can add your lecture slides to your personal portfolio where we can use them for studying!

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      @@NabidAlam360 what would be a good platform to host them on?

  • @NabidAlam360
    @NabidAlam360 8 месяцев назад

    why pi_k with P as it is discrete and not continuous?

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      pi_k are the relative contributions of each individual Gaussian model to the overall mixture model. They are between 0 and 1 and they sum up to 1.

  • @NabidAlam360
    @NabidAlam360 8 месяцев назад

    This is how a good teacher teaches! Thanks for the lecture!

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      Glad it was helpful!

    • @NabidAlam360
      @NabidAlam360 8 месяцев назад

      @@MLClassroom Professor, it would be very helpful if you manage to upload videos on attention and transformers!

    • @MLClassroom
      @MLClassroom 8 месяцев назад

      @@NabidAlam360 thanks for the suggestion, nice and important topics. Not sure when I may get to them though. FYI: code companion for these lectures available at github.com/ionpetre/FoundML_course_assignments.

  • @datahouse24
    @datahouse24 9 месяцев назад

    Thank you

  • @indiajackson5959
    @indiajackson5959 9 месяцев назад

    Excellent explanation!

  • @dungnguyenduc3790
    @dungnguyenduc3790 10 месяцев назад

    where do you get the values of P(~R|C) ?

    • @MLClassroom
      @MLClassroom 10 месяцев назад

      From the fact that P(R|C)+P(~R|C)=1.

  • @Radi0_
    @Radi0_ 11 месяцев назад

    Thank you!

  • @sriramgugulothu4195
    @sriramgugulothu4195 11 месяцев назад

    You saved my day sir!!!!!1

  • @bhargavtech2897
    @bhargavtech2897 11 месяцев назад

    Nice explanation sir 👍

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

    💞

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

    You saved my life, thank you very much.

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

    Appreciated !1 thanks for sharing.

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

    Thank you so much !! Great illustration , regards

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

    Great explanation!

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

    Thank you so much for posting these videos, you don’t know how much it helped

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

      I'm so glad to hear, thanks for sharing.

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

    3:48 Did someone shout "idiot"? 😂 That aside, these videos have surprisingly high and consistent quality.

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

      Thanks! Just some random toddler shouts in the background (home studio 🙂).

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

    This is a remakable series that is extremely helpful. I was wondering if you happen to have the rest of the series?

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

      Of course, here is the link to the entire series: ruclips.net/p/PLbkSohdmxoVAZ9DEHEWHjeGK7Ei-DjKHI&si=kZczY-WTZwqKAu_j

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

      ​ @MLClassroom Thanks for the reply! I saw a bunch of machine learning videos in the playlist, but only lectures 1, 6, 8, 10, 14, 18, 20, 22 on graphical models. Am I missing something?

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

      Not more than this I am affraid @@Howard1130

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

      @@MLClassroom Ah ok, thanks anyways! Great content!

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

    Excellent explanation

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

    Nice video, thanks!

  • @LongNguyen-zm1vs
    @LongNguyen-zm1vs Год назад

    Thank you. I understand so much more on this subject now.

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

    Great video, very helpful, thanks

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

    This is super insightful and helpful. Your experience in understanding and dealing with these issues is apparent. Thanks a LOT!

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

      Thank you, great to hear this was useful for you.

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

    Hi from Bulgaria!I like thath yiu explain everything trough simple examples and you show the possibilities .I'm becoming 10th grade this year so I went to a physics conference and prepared a bit 😂 so I understand how much I don't know it would really be lovely to recommend me some Playlist.Right now im studying from Khan academy and since 2 year ago I'm studying system proggramming,like a mont ago I discovered P&D and have been reading desertation about it also I want to imply this knowedge of machine learning in Animation ❤I know thath you re a busy person so thanks❤

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

      Hello, great to hear from you. I am very glad to hear that are so active, while still in high school. Way to go! I can of course recommend my own MLClassroom playlist (that this video I part of), a collection of more than 150 short lectures on various aspects of machine learning. You can access it here: ruclips.net/p/PLbkSohdmxoVAZ9DEHEWHjeGK7Ei-DjKHI&si=hwEWpZtCCfF_nQjU. The playlist is primarily meant for university students, especially in math, and it may not be the best starting point for you right now. Check out the many courses offered by coursera.org, especially those lectured by Andrew Ng. Even for those that require a fee to get access to, you can typically audit them (go through all their materials, including lectures and assignments, but without the peer review and the final certificate). You can also apply for a registration waiver, I am quite sure they will consider your application. Stay curious, keep learning!

  • @THOTAGOWRIPRIYA-n1z
    @THOTAGOWRIPRIYA-n1z Год назад

    Thank you sir

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

    could you please tell me the name of the text book

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

      This video is based on "Marc Peter Deisenroth, A. Aldo Faisal, and Cheng Soon Ong. Mathematics for Machine Learning. Cambridge University Press, 2020." The full bibliography for the entire course is: Coursebook: Ethem Alpaydin. Introduction to machine learning, MIT Press, 2020. Other materials: Marc Peter Deisenroth, A. Aldo Faisal, and Cheng Soon Ong. Mathematics for Machine Learning. Cambridge University Press, 2020. Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. Foundations of Machine Learning. MIT Press, Second Edition, 2018. Avrim Blum, John Hopcroft, and Ravindran Kannan. Foundations of Data Science. Cambridge University Press, 2020.

  • @Someone-jk4ys
    @Someone-jk4ys Год назад

    9:30, Using M here for the number of W's is confusing. Instead, k should be used (see p.81 in the book). M is used as the number of datasets (see p. 83 in the book).

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

      Thank you, I think you have a good point here.

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

    Thanks so much!

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

    i can't find the video with how to calculate the derivative here

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

      The full playlist is available at ruclips.net/p/PLbkSohdmxoVAZ9DEHEWHjeGK7Ei-DjKHI. They are listed there in the order I teach them in class.

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

    Sir thank you so much for such amazing explainatory videos. My hovering over you tube got successful 😭. 🙌🙌

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

      Thank you, glad to hear this has been helpful to you.

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

    Your videos helped me comprehend Machine learning tough language so easily. Thank you so much sir 🙌

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

      You are most welcome, keep up the good work!

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

    Your videos are superb. 🙌

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

    Sir you are saviour 🙌🙌. You have explained so well.

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

      Great to hear that I could help.

  • @__ZonaidAlHabib-pg8dd
    @__ZonaidAlHabib-pg8dd Год назад

    thank you

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

    🙏 thank you

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

    then build a nn which tests if a number is prime