Country of origin? | Russia |
---|
Popular articles by pscience
NewsCo: rapid non-parametric recommender algorithm for NetInfo news articles
Popular comments by pscience
NewsCo: rapid non-parametric recommender algorithm for NetInfo news articles
Hi,
Thanks for feeback!
Answering to your questions:
1) All the assumptions done are plausible and we don’t see the potential affect on result, as for instance publication time is assumed to be the first click on article. I guess this point could be weak for some small tabloids, however NetInfo is big enough organization so that time between publication and first click is to be negligible
2) Currently the approach allows recommending the article that user has already read. We agree that it’s fair point to disable such a possibility, and in fact it could be easily done by restricting the pull of ranked articles inside the suggested subtopic to having no intersections with already viewed articles – by the way, we’ve already written code for that issue in collaborative filtering approach, but being in hurry forgotten to apply it to final solution
3) In this article I’ve unfortunately copied the first version of code for this particular moment where we had equal bases. However, the idea of making different bases logarithm is better scaling and linearization. So that as equal bases just introduce scaling property, applying suitable bases guarantees linear influence of both freshness and popularity in order to introduce equal contribution of these metrics to final rating – we suppose this assumption to be fair with respect to visitors obtaining both fresh and “on-hype” recommendations
Thanks for positive evaluation of article and video quality!
NewsCo: rapid non-parametric recommender algorithm for NetInfo news articles
Hi,
Thanks for giving a feedback!
We agree in terms of having collaborative filtering matrix and graph adjacency matrix as the same data structures.
Also we share the idea of formulating this problem as a link prediction problem in graph theory, as previously I’ve been doing research in this field, especially on co-authorship networks (https://dl.acm.org/doi/10.1145/3197026.3203911, https://link.springer.com/chapter/10.1007%2F978-3-030-11027-7_4, https://link.springer.com/chapter/10.1007%2F978-3-030-11027-7_3, https://peerj.com/articles/cs-172/). However, again due to limited time and resources, we decided to apply graph theory just in terms of subset visualization, but not solving the target problem
And thanks for positive evaluation of video!