BLOOFI REPRESENTATION FOR ITEM/USER IN RECOMMENDER SYSTEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Farahi Zahra; MOEINI ALI; KAMANDI ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2019 | Issue:5

Download Full-Text

View:

123

Download:

Information Seminar Paper

Title

BLOOFI REPRESENTATION FOR ITEM/USER IN RECOMMENDER SYSTEMS

Author(s)

Farahi Zahra | MOEINI ALI | KAMANDI ALI

Keywords

RECOMMENDER SYSTEMS

BLOOM FILTER

HIERARCHICAL BLOOM FILTER

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.

Cites

No record.

References

No record.

Cite

APA: Copy

Farahi, Zahra, MOEINI, ALI, & KAMANDI, ALI. (2019). BLOOFI REPRESENTATION FOR ITEM/USER IN RECOMMENDER SYSTEMS. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949058/en

Vancouver: Copy

Farahi Zahra, MOEINI ALI, KAMANDI ALI. BLOOFI REPRESENTATION FOR ITEM/USER IN RECOMMENDER SYSTEMS. 2019. Available from: https://sid.ir/paper/949058/en

IEEE: Copy

Zahra Farahi, ALI MOEINI, and ALI KAMANDI, “BLOOFI REPRESENTATION FOR ITEM/USER IN RECOMMENDER SYSTEMS,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2019, [Online]. Available: https://sid.ir/paper/949058/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops