ItemFilterAsVectorAndPrefsReducer does #3.

You can always post-process the recommendations however you like and
ignore whatever items you want.

On Fri, Jan 14, 2011 at 10:19 AM, han henry <huiwen....@gmail.com> wrote:
> Hi,Sean and sebastian
>
> We have two type preference .
>
> 1)  ,Preferences that user does not want to see them ,we store those
> preference in filterFile.
> 2)  ,All preferences (include those in the #1) ,also those data can use to
> calculate similarity.
>
> We can not recommend those items to user
>
> #1, Invalid items or expired items .we store those items in itemSFile.
> #2, User Non-interested items ,we store those user ,item pairs in filterFile
> .
> #3, User existed items (user already has those item in preferences ).
>
>  ItemFilterAsVectorAndPrefsReducer seems can make  those items been skiped
> in last step.
>
> so we do #1 and #2 in the last step
> (AggregateAndRecommendReducer.java<http://svn.apache.org/repos/asf/mahout/trunk/core/src/main/java/org/apache/mahout/cf/taste/hadoop/item/AggregateAndRecommendReducer.java>),
> but I have not found logic to skip #3.
>
> Am I right ?
>
> Best Regards,
>
> 2011/1/14 han henry <huiwen....@gmail.com>
>
>> Thank you Sean and sebastian :)
>>
>> 2011/1/14 Sean Owen <sro...@gmail.com>
>>
>> Look at ItemFilterAsVectorAndPrefsReducer. This does what you are looking
>>> for.
>>>
>>> On Fri, Jan 14, 2011 at 9:17 AM, han henry <huiwen....@gmail.com> wrote:
>>> > Hi,Sebastian
>>> >
>>> > Because my data is on the production ,it 's very large .so sorry that I
>>> can
>>> > not give you input data.
>>> >
>>> > But we can try to review the code .
>>> >
>>> > The initial version cooccurence arithmetic has logic to skip user's
>>> existed
>>> > items.
>>> >
>>> > Best Regards,
>>>
>>
>>
>

Reply via email to