Coding Challenge #70: Nearest Neighbors Recommendation Engine - Part 2

Other Parts of this Challenge:

References:

Videos:

Related Coding Challenges:

Timestamps:
0:00 Introduction
1:01 euclideanDistance()
1:44 Similarity score
1:58 NearestNeighbors()
2:51 Check similarity scores
6:28 Sort the users
10:29 Put similarity score in an object
14:03 Display top five similarity scores
16:00 Reset resultP

Editing by Mathieu Blanchette
Animations by Jason Heglund
Music from Epidemic Sound

#nearestneighbors #similarityscore #euclideandistance #associativearrays #p5js #javascript

[robn]

Dude the last video was awesome. You connected euclidean distance math to data set. Introduced a weakness to the method and Provided Solution. This is like practical math making math more intuitive and relatable. The context of the programming makes the math so easy to digest. Thanks.

[JeremyStover]

5 years too late, but if you use Union Finds then euclidean distance on the results of that, you can have a fully dynamic recommendation engine.

[micahwaring]

I like that you put the next part in the description.

[mightyleguan]

13:18 I have never seen Dan like this before. It's ok, we all make mistakes :)
I also think it's awesome that you didn't cut this out.
Have a nice day!

[geoffwagner]

i actually did wake up this mourning and wish this, thankfully i do, it's still here, Dan exists, his channel exits, life exist sun is out tho i mostly hide from it and cover the windows

[alengm]

Can you make a video where you just trigger all the sounds you have(ding, thisdot, dundun...) preferably in form of a music?
Maybe write an algorithm that can imitate music with given sounds.

[ysoseriousbro]

If you have thousands and thousands of people's preferences, since we are calculating a "distance" couldn't we think of plotting people in an n dimensional space based on the number of movies and their ratings and then use a quadtree to more quickly get our nearest neighbors? This would probably be more useful if we wanted to group everyone since we would have to have nested loops, but just a thought.

[lungdart]

Is your distance normalized between 0 and 1? If so, why are all of your scores so low? I would think that there would bound to be some scores higher than a 0.36, but I didn't see any. Could be a bug!

[SirCutRy]

You could sort the names by their similarity score, at least in Python:

def k_nearest(k, names, scores):
return names.sort(lambda x:

[geoffwagner]

*as lightning strikes and half of California loses power overnight*

[Daniel]

Daniel, why is this video not public yet? Forgot it?

[CAMILOLcamiLOL]

hi dan, i was wondering if you can load a folder of images into Processing, if it is possible please tell my how to do that.
Thank you.

[AayushThokchom]

A doubt!! In compareSimilarity(), how come b.name is always Leon? data.users contains all users. Doesn't sort will pass all the users name as (a, b) argument. Why Leon is constant and other names changes in argument 'a'.

[spicytuna]

any idea when there are 10000 users buying/not buying 20000 products? i guess the results have to be compiled first. but still that would be 10k by 10k by 20k loop.

[francescopodesta]

7:17 I think that 13 is in the wrong place

[Brandflugan]

Ever heard of RushBallz (IOS) or Boomerang balls (IOS) ? It would be awesome if you could make a challenge similar to those games

[kurekureci]

Coding challenge: Optimize NASA code.
(its actually real)

[CtgColdHammer]

Do you drink a can of monster before each video? <3 <3 <3

[sarvagyaagarwal]

Are all your videos targeted to programming noobs ? Are there any videos for people already well versed in programming ? For example : i can't stand you explaining sorting for 5 minutes :P