Reducing correlation of random forest–based learning‐to‐rank algorithms using subsample size

2019 ◽  
Vol 35 (4) ◽  
pp. 774-798
Author(s):  
Muhammad Ibrahim
Keyword(s):  
Random Forest ◽  
Learning To Rank ◽  
Subsample Size

Click models inspired learning to rank

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Amir Hosein Keyhanipour ◽  
Farhad Oroumchian
Keyword(s):  
Random Forest ◽  
Learning To Rank ◽  
Search Time ◽  
Building Blocks ◽  
Weighted Averaging ◽  
Time Behavior ◽  
Random Forest Algorithm ◽  
Content Type ◽  
Perceived Relevance ◽  
Click Models

Purpose Incorporating users’ behavior patterns could help in the ranking process. Different click models (CMs) are introduced to model the sophisticated search-time behavior of users among which commonly used the triple of attractiveness, examination and satisfaction. Inspired by this fact and considering the psychological definitions of these concepts, this paper aims to propose a novel learning to rank by redefining these concepts. The attractiveness and examination factors could be calculated using a limited subset of information retrieval (IR) features by the random forest algorithm, and then they are combined with each other to predicate the satisfaction factor which is considered as the relevance level. Design/methodology/approach The attractiveness and examination factors of a given document are usually considered as its perceived relevance and the fast scan of its snippet, respectively. Here, attractiveness and examination factors are regarded as the click-count and the investigation rate, respectively. Also, the satisfaction of a document is supposed to be the same as its relevance level for a given query. This idea is supported by the strong correlation between attractiveness-satisfaction and the examination-satisfaction. Applying random forest algorithm, the attractiveness and examination factors are calculated using a very limited set of the primitive features of query-document pairs. Then, by using the ordered weighted averaging operator, these factors are aggregated to estimate the satisfaction. Findings Experimental results on MSLR-WEB10K and WCL2R data sets show the superiority of this algorithm over the state-of-the-art ranking algorithms in terms of P@n and NDCG criteria. The enhancement is more noticeable in top-ranked items which are reviewed more by the users. Originality/value This paper proposes a novel learning to rank based on the redefinition of major building blocks of the CMs which are the attractiveness, examination and satisfactory. It proposes a method to use a very limited number of selected IR features to estimate the attractiveness and examination factors and then combines these factors to predicate the satisfactory which is regarded as the relevance level of a document with respect to a given query.

Implementation of data mining as a support of business application strategy

2018 ◽  
Vol 5 (1) ◽  
pp. 47-55
Author(s):  
Florensia Unggul Damayanti
Keyword(s):  
Data Mining ◽  
Random Forest ◽  
Business Strategy ◽  
Input Parameter ◽  
Data Mining Algorithm ◽  
Complex Data ◽  
Business Decision ◽  
Marketing Department ◽  
Business Application ◽  
Complex Data Sets

Data mining help industries create intelligent decision on complex problems. Data mining algorithm can be applied to the data in order to forecasting, identity pattern, make rules and recommendations, analyze the sequence in complex data sets and retrieve fresh insights. Yet, increasing of technology and various techniques among data mining availability data give opportunity to industries to explore and gain valuable information from their data and use the information to support business decision making. This paper implement classification data mining in order to retrieve knowledge in customer databases to support marketing department while planning strategy for predict plan premium. The dataset decompose into conceptual analytic to identify characteristic data that can be used as input parameter of data mining model. Business decision and application is characterized by processing step, processing characteristic and processing outcome (Seng, J.L., Chen T.C. 2010). This paper set up experimental of data mining based on J48 and Random Forest classifiers and put a light on performance evaluation between J48 and random forest in the context of dataset in insurance industries. The experiment result are about classification accuracy and efficiency of J48 and Random Forest , also find out the most attribute that can be used to predict plan premium in context of strategic planning to support business strategy.

Database-Driven Modeling based on Variable Selection using Random Forest and Its Application for Linear Air Fuel Ratio Sensor Output Prediction

2019 ◽  
Vol 139 (8) ◽  
pp. 850-857
Author(s):  
Hiromu Imaji ◽  
Takuya Kinoshita ◽  
Toru Yamamoto ◽  
Keisuke Ito ◽  
Masahiro Yoshida ◽  
...  
Keyword(s):  
Random Forest ◽  
Variable Selection ◽  
Sensor Output ◽  
Fuel Ratio

Random Forest: A Review

2017 ◽  
Vol 7 (1) ◽  
pp. 251-257 ◽  
Author(s):  
Eesha Goel ◽  
◽  
Er. Abhilasha ◽  
Keyword(s):  
Random Forest

Random Forest Refinement of Pairwise Potentials for Protein-ligand Decoy Detection

2019 ◽  
Author(s):  
Jun Pei ◽  
Zheng Zheng ◽  
Hyunji Kim ◽  
Lin Song ◽  
Sarah Walworth ◽  
...  
Keyword(s):  
Machine Learning ◽  
Random Forest ◽  
Probability Function ◽  
Pair Potential ◽  
Scoring Function ◽  
Stable Structure ◽  
Scoring Functions ◽  
Atom Pair ◽  
Data Set ◽  
Atom Pairs

An accurate scoring function is expected to correctly select the most stable structure from a set of pose candidates. One can hypothesize that a scoring function’s ability to identify the most stable structure might be improved by emphasizing the most relevant atom pairwise interactions. However, it is hard to evaluate the relevant importance for each atom pair using traditional means. With the introduction of machine learning methods, it has become possible to determine the relative importance for each atom pair present in a scoring function. In this work, we use the Random Forest (RF) method to refine a pair potential developed by our laboratory (GARF6) by identifying relevant atom pairs that optimize the performance of the potential on our given task. Our goal is to construct a machine learning (ML) model that can accurately differentiate the native ligand binding pose from candidate poses using a potential refined by RF optimization. We successfully constructed RF models on an unbalanced data set with the ‘comparison’ concept and, the resultant RF models were tested on CASF-2013.5 In a comparison of the performance of our RF models against 29 scoring functions, we found our models outperformed the other scoring functions in predicting the native pose. In addition, we used two artificial designed potential models to address the importance of the GARF potential in the RF models: (1) a scrambled probability function set, which was obtained by mixing up atom pairs and probability functions in GARF, and (2) a uniform probability function set, which share the same peak positions with GARF but have fixed peak heights. The results of accuracy comparison from RF models based on the scrambled, uniform, and original GARF potential clearly showed that the peak positions in the GARF potential are important while the well depths are not. <br>

Sign in / Sign up

Export Citation Format

Share Document