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

A novel algorithm for spectral interval combination optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 71 publications
(24 citation statements)
references
References 54 publications
0
24
0
Order By: Relevance
“…VISSA is an optimization algorithm for the selection of variable, based on weighted binary matrix sampling and model population analysis strategies (Deng et al., 2014). Its advantages include overcoming the uncertainty of a single model, generating synergistic/combination effects, and avoiding the elimination of important variables by mistake during the optimization process (Song et al., 2016). Up to now, it was mainly employed to deal with complex NIR datasets.…”
Section: Discussionmentioning
confidence: 99%
“…VISSA is an optimization algorithm for the selection of variable, based on weighted binary matrix sampling and model population analysis strategies (Deng et al., 2014). Its advantages include overcoming the uncertainty of a single model, generating synergistic/combination effects, and avoiding the elimination of important variables by mistake during the optimization process (Song et al., 2016). Up to now, it was mainly employed to deal with complex NIR datasets.…”
Section: Discussionmentioning
confidence: 99%
“…ICO is a method based on the appearance frequency of each interval (the weight) at the last iteration . The main principles are summarized as follows: (i) the whole spectra was generated into N equal‐width intervals and M random combinations were obtained via weighted bootstrap sampling (WBS), (ii) a ratio (α) of optimal interval combinations was extracted from the M random combinations according to root mean square error of cross‐validation (RMSECV), (iii) the appearance of frequencies (the weight) was calculated and intervals with weight over 0.5 were considered to be the optimum intervals and (iv) the optimal intervals were selected for modeling.…”
Section: Methodsmentioning
confidence: 99%
“…A variety of single wavelength selection methods have been raised including uninformative variable elimination (UVE), Monte Carlo based UVE (MC‐UVE), the successive projections algorithm (SPA), competitive adaptive reweighted sampling (CARS), the variable iterative space shrinkage approach (VISSA), the genetic algorithm (GA), simulated annealing (SA) and so on. Following the principles of selecting a spectral band, many interval wavelength selection methods have been put forward, such as interval PLS (iPLS), synergy iPLS (siPLS), backward iPLS (biPLS), moving window PLS (MWPLS), interval combination optimization (ICO) and so on. Recently, a series of random variable selection methods has been proposed, such as random forest, particle swarm optimization (PSO), grey wolf and the Fisher optimal partitions algorithm .…”
Section: Introductionmentioning
confidence: 99%
“…The MPA has been classified into single variable model population analysis and interval model population analysis. The former includes random frog (RF) [14], iteratively retains informative variables (IRIV) [15], variable iterative space shrinkage approach (VISSA) [16], iteratively variable subset optimization (IVSO) [17], CARS [18], stability competitive adaptive reweighted sampling (SCARS) [19], sampling error profile analysis LASSO (SEPA-LASSO) [20], BOSS [4] and SBOSS [5]; while the latter includes interval random frog (iRF) [21], interval variable iterative space shrinkage approach (iVISSA) [22], interval combination optimization (ICO) [23] and fisher optimal subspace shrinkage (FOSS) [6]. Moreover, selecting the variables on near-infrared spectroscopy by utilizing models that hybridize two or more different techniques was recommended in [12].…”
Section: Related Workmentioning
confidence: 99%