Abstract
In this paper, we propose new algorithms to improve the performance of recommender systems, based on hierarchical Bloom filters. Since Bloom filters can make a tradeoff between space and time, proposing a new hierarchical Bloom filter causes a remarkable reduction in space and time complexity of recommender systems. Space reduction is due to hashing items in a Bloom filter to manage the sparsity of input vectors. Time reduction is due to the structure of hierarchical Bloom filter. To increase the accuracy of the recommender systems we use Probabilistic version of hierarchical Bloom filter. The structure of hierarchical Bloom filter is B+ tree of order d. Proposed algorithms not only decrease the time complexity but also have no significant effect on accuracy
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
