[
https://issues.apache.org/jira/browse/MAHOUT-445?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12893646#action_12893646
]
Sebastian Schelter commented on MAHOUT-445:
-------------------------------------------
Patch updated. Added another fetching strategy that only considers max(100,
20*log(max(N_users, N_items))) preferences per item, as suggested by Ted
Dunning, hope I understood it correctly.
> Customizable strategies for candidate item fetching
> ---------------------------------------------------
>
> Key: MAHOUT-445
> URL: https://issues.apache.org/jira/browse/MAHOUT-445
> Project: Mahout
> Issue Type: Improvement
> Components: Collaborative Filtering
> Reporter: Sebastian Schelter
> Attachments: MAHOUT-445-2.patch, MAHOUT-445.patch
>
>
> At the beginning of the recommendation process, a recommender has to identify
> a set of "candidate items" which are items that could possibly be recommended
> to the user, the final result of the recommender's computation will be a
> subset of those.
> The current approach in AbstractRecommender.getAllOtherItems(...) turns out
> to be very slow if there is a high number of cooccurrences in the data (like
> in the grouplens 1M dataset for example). The aim of this patch is to make
> the way in which these candidate items are identified customizable.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
