|
recommender_get_app_id |
./recommender.module |
Get the application id from the application name. |
6 |
|
|
recommender_install |
./recommender.install |
|
|
|
|
recommender_prediction_classical |
./recommender.module |
Classical weight-average algorithm to calculate prediction from the similarity matrix, based on average weight.
Limitation: we only do database operation for now. no in-memory operation available until future release.
Limitation: we only do average… |
|
|
|
recommender_prediction_slopeone |
./recommender.module |
This is the implementation of slope-one algorithm, which is supposed to be faster than other algrithms.
From the original research paper, the author argues slope-one support incremental update. But this is quite hard to implement.
The incremental… |
|
|
|
recommender_schema |
./recommender.install |
@file
Installation file for the Recommender API module. |
|
|
|
recommender_similarity_classical |
./recommender.module |
classical collaborative filtering algorithm based on correlation coefficient.
could be used in the classical user-user or item-item algorithm
see the README file for more details |
|
|
|
recommender_similarity_coocurrences |
./recommender.module |
Co-ocurrences algorithm that compute similarity among mice based on how many cheese they share. |
|
|
|
recommender_uninstall |
./recommender.install |
|
|
|
|
recommender_updated_add |
./recommender.module |
|
|
|
|
recommender_updated_purge |
./recommender.module |
|
|
|
|
_recommender_expand_sparse_data |
./recommender.module |
Expand the sparse database table to have the missing data default as zero.
'adjusted' means that only mouses that share common cheese will be expanded. |
2 |
|
|
_recommender_fast_correlation_coefficient |
./recommender.module |
Fast correlation matrix calculation. |
1 |
|
|
_recommender_similarity_classical_in_database |
./recommender.module |
Classical algorithm computed in databases. Full functioning.
It has no memory limits because all data are saved in database.
But the performance is worse than in-memory computation. |
1 |
|
|
_recommender_similarity_classical_in_memory |
./recommender.module |
Matrix computation in memory. Fast. But require lots of memory.
Limitation: only support $missing='zero', will cover other cases in future release |
1 |
|
|
_recommender_updated_list |
./recommender.module |
|
1 |
|
|
_recommender_updated_markdone |
./recommender.module |
|
1 |
|
|
_recommender_updated_max |
./recommender.module |
|
1 |
|
