I am one of the faithful visitors of your great contents and really appreciate your rewarding efforts and time. I'll be grateful if you address the statistical analysis with Python as a cornerstone of datascience, if applicable.
@matijsbrs7 ай бұрын
Great video! I'm working more and more to optimize my work processes. And Never actually thought about using this. Thanks!
@SolathPrime6 ай бұрын
[17:08]: it's a binary state, you can keep it as simple as `genome[i] = not(genome[i])`
@phobosmoon46437 ай бұрын
10:42 that's a slick generator. ty vid
@GuillermoGarcia755 ай бұрын
Again taking over Awesome town! THX
@southfitness75677 ай бұрын
Thanks for sharing the concept
@salihabdullahkilic7 ай бұрын
Great video, thanks!
@dadaoluwagbenga59123 ай бұрын
it's really helpful, please it is possible to use Evolutionary algorithm to create workout plan?
@gamerfisch51177 ай бұрын
another interesting video. Thanks a lot :)
@raymundo23027 ай бұрын
I think the reason why the fitness wasn't increasing was in the function select_parent(). While higher fitness individuals may have a better chance at reproducing, it isn't likely enough for them to reproduce
@kevinhower56633 ай бұрын
Possibly a dumb question, but what is with the a:0 and b:0 on line 11 ? It was almost like the IDE added those in or something. If I typed them in, I got invalid syntax. If I just had randint(0,1) instead, on line 11, it worked. Thanks.
@rubanruban98437 ай бұрын
Csn you tell machine learning algorithms like candidate algorithm and decision tree algorithm
@Banta20007 ай бұрын
I'm not sure about the select_parent() function. You are going through the pool of candidates, cumulating their respective fitness, until you hit the first candidate who's cumulated fitness is bigger than some random threshold. How does that guarantee that a candidate with a bigger fitness is statistically more often chosen over a candidate with less fitness? Shouldn't be some type of sorting? I get the impression, the candidate pool is randomly sorted; we're randomly choosing a threshold point; and therefore randomly returning any candidate that just happens to be the first to cross the (cumulated!) threshold. WDYT?
@doyouknowdawae13436 ай бұрын
A better implementation would be to first perform elitism, where say 10% of the solutions with the highest fitness are automatically entered into the new population. Then you could select the parents through tournament selection which would compare n amounts of solutions, with the best one (Highest Fitness) being chosen as a parent. After performing tournament selection to get 2 parents you could then proceed to crossover as described in the video. I believe this would achieve what you wanted, with more fit solutions being chosen over weaker candidates.
@michael.adel.shafik5 ай бұрын
do you think using PYGAD could make genetic algorithm easier ?
@FelipeCantalic37 ай бұрын
I think game theory is interesting too
@KernaaliKehveli7 ай бұрын
The fitness values in the one max problem were off
@pascalpicavez42437 ай бұрын
Thanks you
@TomLeg7 ай бұрын
You show interesting code, but you haven't tested it before, and are learning how it performs on-camera. How about spending an hour beforehand figuring out exactly what to show?