( en | de | ru )

 

Disambiguation of "Naderi, Hassan"

Author of the publication

copydeleteadd this publication to your clipboard
A Survey on Nearest Neighbor Search Methods

, , and . International Journal of Computer Applications, 95 (25): 39--52 (June 2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nader Naderi

Nader Naderi

Ahmad Naderi

Mansur Naderi

Malek Naderi

 

Other publications of authors with the same name

Connected components of big graphs in fixed MapReduce rounds., , and . Clust. Comput., 20 (3): 2563-2574 (2017)A Survey on Nearest Neighbor Search Methods, , and . International Journal of Computer Applications, 95 (25): 39--52 (June 2014)Evolution of communities in dynamic social networks: An efficient map-based approach., and . Expert Syst. Appl., (2020)A fast method to exactly calculate the diameter of incremental disconnected graphs., , and . World Wide Web, 20 (2): 399-416 (2017)A Model-based Keyword Search Approach for Detecting Top-k Effective Answers., and . Comput. J., 62 (3): 377-393 (2019)An Efficient Collaborative Information Retrieval System by Incorporating the User Profile., , and . Adaptive Multimedia Retrieval, volume 4398 of Lecture Notes in Computer Science, page 247-257. Springer, (2006)Three User Profile Similarity Calculation (UPSC) Methods and Their Evaluation., and . SITIS, page 239-245. IEEE Computer Society, (2007)A graph-based profile similarity calculation method for collaborative information retrieval., , and . SAC, page 1127-1131. ACM, (2008)Microblogs recommendations based on implicit similarity in content social networks., , , and . J. Supercomput., 78 (1): 962-986 (2022)Erratum to: Efficient keyword search over graph-structured data based on minimal covered r-cliques., , and . Frontiers Inf. Technol. Electron. Eng., 21 (6): 962 (2020)