New contact recommendation filtering #15
Comments
Recommending users requires some process the social graph, which is expensive. So there should be a fixed number of visible recommendations, but they should as much as possible always be different. This implies searching the graph randomly, up to a certain depth, and until a certain number of people have been found. The criteria for proposing people, should be that the contact information is of some form of minimal good quality:
|
Bnodes are already ignored and we ignore unjumpable profiles. It is not really easy in RxJs to stop the processing of a stream I think so 2014-02-13 15:27 GMT+01:00 Henry Story notifications@github.com:
|
From now, recommended new contacts to a user are
---> the contacts of its contacts
---> we use (FOAF('knows'), FOAF('knows)) in the function followPath in the lib rdflib-stample-pg...
Some questions arises :
---> what new parameters the algorithm of recommendation should consider ?
---> what is the best number of jumps to do down the graph to discover new contacts for recommendation ?
---> how to filter the contacts in the recommendation ? Not showing the same contacts again and again; not showing new contacts with wrong URIs
---> how to paginate the contacts for recommendation ?
---> filter new contact without URIs or with wrong URIs
(issue description not finished yet)
The text was updated successfully, but these errors were encountered: