Machine Learning | Candidate Elimination Algorithm

preview_player
Показать описание
Candidate-Elimination algorithm performs a bidirectional search in the hypothesis space. It maintains a set, S, of most specific hypotheses that are consistent with the training data and a set, G, of most general hypotheses consistent with the training data. #ConceptLearning #CandidateEliminationAlgorithm

Рекомендации по теме
Комментарии
Автор

Before solving problem we should explain our main goal that what are we going to achieve by solving it. which is missing and created a lot of confusion for me.

Faayez
Автор

you just calculated the most specific and most general boundary. you have to show the version space that is the intermediate boundary.

nikhileshsharma
Автор

great tutorial, keep up the good work . Thank you for this video.

aswinrajasekharan
Автор

Did not understand how you discard that

vikasbhandari
Автор

at 11:29 what is your motive what you saying sir please explain

mohdhasnain
Автор

I have confusion at the elimination point plz clear it

muhammadzakariya
Автор

At the end of I didn't know result that what was our primary goal for solving it.

Faayez
Автор

Sir also make videos on how to match the instances with hypothesis space diagram in machine learning asap

jeevapriya
Автор

In the middle of the video your explanation became very clumsy

sujoykodali