This is the best video I have seen on the Page Rank Algorithm .just loved the way you broke it out into pieces
@HDChif
5 жыл бұрын
Best video on youtube about this topic. very well done!
@virtualbro8571
3 жыл бұрын
A very professional explaination!
@IlyaMikhelson
3 жыл бұрын
Thank you! I hope it was helpful!
@anwarulbashirshuaib5673
3 жыл бұрын
@@IlyaMikhelson Your digital logic tutorials were really helpful. Looking forward to seeing more of those 😁😁
@teawonder
6 жыл бұрын
Very well explained! Thank you.
@IlyaMikhelson
6 жыл бұрын
I'm glad to help!
@SamSarwat90
6 жыл бұрын
Very clear and well explained! Thanks
@IlyaMikhelson
6 жыл бұрын
I'm very glad you found this useful!
@alimajed9841
6 жыл бұрын
As great as possible. Thanks in Advance
@IlyaMikhelson
6 жыл бұрын
You're very welcome!
@TheGokhansimsek35
5 жыл бұрын
Very very good explanation. Thanks a lot!
@dantedt3931
6 жыл бұрын
Nicely done!Thanks!
@IlyaMikhelson
6 жыл бұрын
My pleasure!
@tapasmishra3246
4 жыл бұрын
Thanks a lot the concept is very clear now after watching your video. Please also give a link to eigen value and eigen metrics calculation just for a revision.
@santiagollanojimenez2408
5 жыл бұрын
regarding the example of <a href="#" class="seekto" data-time="1201">20:01</a> I've got another r values: am i wrong? [0.15000000000000002, 0.21375000000000002, 0.3316875, 2.810643581081081, 3.130168918918919]
@scottzeta3067
2 жыл бұрын
But, what if there is page (actually, many spider trap) have link to it self? Can I still use this method to build the hyperlink matrix?
@soschar2050
4 жыл бұрын
minor correction: It's not 1-d, it's (1-d)/n, with n being the number of pages.
@IlyaMikhelson
4 жыл бұрын
Thank you for your comment. I am presenting the algorithm as stated in the original paper, but your formulation is correct if you are trying to create a probability distribution over web pages. My goal was to present it in a more intuitive way for my class, which, in my opinion, stays away from probability distributions. The formulation I present still works fine, and the ranks just have to be scaled at the end to form a distribution. I hope this makes sense and addresses your concern!
@gerrardandeminem
5 жыл бұрын
Wait so we're getting r as a matrix. How then do we rank which r is higher? How then, do we compare one matrix to another?
@Topherchris0
6 жыл бұрын
nice
@IlyaMikhelson
6 жыл бұрын
Glad to help!
@user-us9gn7fc2g
4 жыл бұрын
what are the advantage and dis adnantage
@nisanagabyev248
4 жыл бұрын
good explanation but there are a lot of holes... what about dead ends and spider traps?
@IlyaMikhelson
4 жыл бұрын
Thanks! This is meant to be introductory. I recommend reading the original paper and extensions thereof for a more complete treatment.
@gerrardandeminem
5 жыл бұрын
Wait so we're getting r as a matrix. How then do we rank which r is higher? How then, do we compare one matrix to another?
Пікірлер: 26