SPEED UP THE SEARCH FOR PROXIMITY-BASED MODELS

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.

PAKSIMA J.; ZAREH A.; DERHAMI V.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2017 | Volume:15 | Issue:2 Page(s): 153-158

Download Full-Text

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

Persian Verion

View:

1,030

Download:

Cites:

Information Journal Paper

Title

SPEED UP THE SEARCH FOR PROXIMITY-BASED MODELS

Author(s)

PAKSIMA J. | ZAREH A. | DERHAMI V. | Issue Writer Certificate

Keywords

RANKINGQ1

PRUNINGQ2

PROXIMITYQ1

THE SEARCH ENGINEQ1

Abstract

One of the main challenges in the PROXIMITY models is the speed of data retrieval. These models define a distance concept which is calculated based on the positions of query terms in the documents. This means that finding the positions and calculating the distance is a time consuming process and because it usually executed during the search time it has a special importance to users. If we can reduce the number of documents, retrieval process becomes faster. In this paper, the SNTK3 algorithm is proposed to prune documents dynamically. To avoid allocating too much memory and reducing the risk of errors during the retrieval, some documents' scores are calculated without any PRUNING (Skip-N). The SNTK3 algorithm uses three pyramids to extract documents with the highest scores. Experiments show that the proposed algorithm can improve the speed of retrieval.

Cites

No record.

References

Cite

APA: Copy

PAKSIMA, J., ZAREH, A., & DERHAMI, V.. (2017). SPEED UP THE SEARCH FOR PROXIMITY-BASED MODELS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 15(2), 153-158. SID. https://sid.ir/paper/228558/en

Vancouver: Copy

PAKSIMA J., ZAREH A., DERHAMI V.. SPEED UP THE SEARCH FOR PROXIMITY-BASED MODELS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2017;15(2):153-158. Available from: https://sid.ir/paper/228558/en

IEEE: Copy

J. PAKSIMA, A. ZAREH, and V. DERHAMI, “SPEED UP THE SEARCH FOR PROXIMITY-BASED MODELS,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 15, no. 2, pp. 153–158, 2017, [Online]. Available: https://sid.ir/paper/228558/en

Related Journal Papers