2016
DOI: 10.1016/j.ins.2015.08.001
|View full text |Cite
|
Sign up to set email alerts
|

Representing conditional preference by boosted regression trees for recommendation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(14 citation statements)
references
References 16 publications
0
14
0
Order By: Relevance
“…BRT is flexible to use and yet capable of dealing with complex soil-environmental responses, including interactions and nonlinearities [22,27]. Compared to the traditional regression approach, BRT showed better results in terms of prediction capability [40,41]. BRT performed well in soil properties modeling [42] and has been applied in various studies [27,43].…”
Section: Prediciton Model Based On Boosted Regression Treesmentioning
confidence: 99%
“…BRT is flexible to use and yet capable of dealing with complex soil-environmental responses, including interactions and nonlinearities [22,27]. Compared to the traditional regression approach, BRT showed better results in terms of prediction capability [40,41]. BRT performed well in soil properties modeling [42] and has been applied in various studies [27,43].…”
Section: Prediciton Model Based On Boosted Regression Treesmentioning
confidence: 99%
“…Although regression trees are not as popular as classification trees, they are highly competitive with different machine learning algorithms (Ortuno et al 2015) and are often applied to many real-life problems (Fakhari and Moghadam 2013;Liu et al 2016).…”
Section: Decision Treesmentioning
confidence: 99%
“…Because the coefficients in the high-frequency wavelet subbands are sparse, we can divide the subbands into several blocks and then check whether they contain significant coefficients. The tree structure is widely used in many fields of information sciences [30,31,32], and is also a good model for compression [33]. In [7], each block is split into four sub-blocks once it tests as significant with respective to the current threshold.…”
Section: The Btca Algorithmmentioning
confidence: 99%