Base model combination algorithm for resolving tied predictions for K-nearest neighbor OVA ensemble models

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Institute for Operations Research and the Management Sciences INFORMS journal on computing
1. Verfasser: Lutu, Patricia E. N. (VerfasserIn)
Weitere Verfasser: Engelbrecht, Andries P. (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2013
Schlagworte:
ensemble classification > model aggregation > combination algorithm > OVA classification > K-nearest neighbor classification > predictive data mining > data mining > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Robust models for the kidney exchange problem 2021 Carvalho, Margarida
Tagging items automatically based on both content information and browsing behaviors 2021 Liu, Shen
Multicomponent maintenance optimization : a stochastic programming approach 2021 Zhu, Zhicheng
Rapid discrete optimization via simulation with Gaussian Markov random fields 2021 Semelhago, Mark
Time-dependent shortest path problems with penalties and limits on waiting 2021 He, Edward
An augmented lagrangian decomposition method for chance-constrained optimization problems 2021 Bai, Xiaodi
Knowledge learning of insurance risks using dependence models 2021 Zhao, Zifeng
A new combinatorial algorithm for separable convex resource allocation with nested bound constraints 2021 Wu, Zeyang
Vehicle sequencing at transshipment terminals with handover relations 2021 Briskorn, Dirk
A learning-based matheuristic for stochastic multicommodity network design 2021 Sarayloo, Fatemeh
Selecting the best alternative based on its quantile 2021 Batur, Demet
Exact multiple sequence alignment by synchronized decision diagrams 2021 Hosseininasab, Amin
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem 2021 Ran, Yingli
A multistage stochastic programming approach to the optimal surveillance and control of the emerald ash borer in cities 2021 Kıbış, Eyyüb Y.
Stochastic decomposition for two-stage stochastic linear programs with random cost coefficients 2021 Gangammanavar, Harsha
Exploiting the structure of two-stage robust optimization models with exponential scenarios 2021 Doubali, Hossein Hashemi
Integrating individual and aggregate diversity in top-n recommendation 2021 Çanakoğlu, Ethem
The migratory beekeeping routing problem : model and an exact algorithm 2021 Ma, Zujun
Decision diagram decomposition for quadratically constrained binary optimization 2021 Bergman, David
SDP-based bounds for the quadratic cycle cover problem via cutting-plane augmented Lagrangian methods and reinforcement learning 2021 Meijer, Frank de
Alle Artikel auflisten