Click here to Skip to main content
Rate this: bad
good
Please Sign up or sign in to vote.
See more: C++ C# Java programming , +
im a new user and i hope im doing this right. i just want to seek for advice and guidance about recommendation engine. im thinking on doing a little bit of research for my project on recommendation engine like youtube, that recommends videos based on videos that we have watched previously. im thinking of making a simple program to show how recommendation engine works and to understand more about this stuff. is it possible and if i may know how? tutorials or sample projects will be much appreciated. thank you in advance.
Posted 15-Mar-13 11:00am
Comments
Sergey Alexandrovich Kryukov at 15-Mar-13 16:31pm
   
This is too narrow topic but extensive subject and a very vague request. It's hardly possible to give you any help in the forum format.
We don't have resources for tutoring. A tutorial on such a narrow topic is also unlikely, as you rather need to learn more general principles and techniques.
If you ask some specific questions, we will gladly answer.
—SA

1 solution

Rate this: bad
good
Please Sign up or sign in to vote.

Solution 1

I did something like this last year. Have a look at the M-Tree[^] as the heart of your engine. You can make a dictionary of keywords in the tree, and a search for the 'n' items closest to a particular keyword can be found with a simple query.
  Permalink  

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
0 OriginalGriff 277
1 Maciej Los 230
2 BillWoodruff 205
3 Sergey Alexandrovich Kryukov 195
4 DamithSL 165
0 OriginalGriff 5,130
1 DamithSL 4,157
2 Maciej Los 3,650
3 Kornfeld Eliyahu Peter 3,460
4 Sergey Alexandrovich Kryukov 2,811


Advertise | Privacy | Mobile
Web04 | 2.8.141216.1 | Last Updated 16 Mar 2013
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100