A NEW ALGORITHM BASED ON ENSEMBLE LEARNING FOR LEARNING TO RANK IN INFORMATION RETRIEVAL

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.

GHANBARI ELHAM; SHAKERY AZADEH

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

Journal Paper

Paper Information

Journal: IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY Year:2016 | Volume:7 | Issue:25-26 Page(s): 67-86

Download Full-Text

Persian Verion

View:

1,596

Download:

Cites:

Information Journal Paper

Title

A NEW ALGORITHM BASED ON ENSEMBLE LEARNING FOR LEARNING TO RANK IN INFORMATION RETRIEVAL

Author(s)

GHANBARI ELHAM | SHAKERY AZADEH | Issue Writer Certificate

Keywords

LEARNING TO RANKQ2

LEARNING TO RANK FOR INFORMATION RETRIEVALQ2

MACHINE LEARNINGQ2

ENSEMBLE LEARNINGQ2

Abstract

LEARNING TO RANK refers to MACHINE LEARNING techniques for training a model in a ranking task. LEARNING TO RANK has been shown to be useful in many applications of information retrieval, natural language processing, and data mining.LEARNING TO RANK can be described by two systems: a learning system and a ranking system. The learning system takes training data as input and constructs a ranking model. The ranking system then makes use of the learned ranking model for ranking prediction. In this paper, a new learning algorithm based on ENSEMBLE LEARNING for learning ranking models in information retrieval is proposed. This algorithm iteratively constructs weak learners using a fraction of the training data whose weight distribution is determined based on previous weak learners. The proposed algorithm combines the weak rankers to achieve the final ranking model. This algorithm constructs a ranking model on a fraction of the training data to increase the accuracy and reduce the learning time. Experimental results based on Letor.3 benchmark dataset shows that the proposed algorithm significantly outperforms other ENSEMBLE LEARNING algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

GHANBARI, ELHAM, & SHAKERY, AZADEH. (2016). A NEW ALGORITHM BASED ON ENSEMBLE LEARNING FOR LEARNING TO RANK IN INFORMATION RETRIEVAL. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, 7(25-26), 67-86. SID. https://sid.ir/paper/171472/en

Vancouver: Copy

GHANBARI ELHAM, SHAKERY AZADEH. A NEW ALGORITHM BASED ON ENSEMBLE LEARNING FOR LEARNING TO RANK IN INFORMATION RETRIEVAL. IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY[Internet]. 2016;7(25-26):67-86. Available from: https://sid.ir/paper/171472/en

IEEE: Copy

ELHAM GHANBARI, and AZADEH SHAKERY, “A NEW ALGORITHM BASED ON ENSEMBLE LEARNING FOR LEARNING TO RANK IN INFORMATION RETRIEVAL,” IRANIAN COMMUNICATION AND INFORMATION TECHNOLOGY, vol. 7, no. 25-26, pp. 67–86, 2016, [Online]. Available: https://sid.ir/paper/171472/en

Related Journal Papers