default search action
Antti Sorjamaa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j7]Souhaib Ben Taieb
, Gianluca Bontempi
A review and comparison of strategies for multi-step ahead time series forecasting based on the NN5 forecasting competition. Expert Syst. Appl. 39(8): 7067-7083 (2012) - 2011
- [i1]Souhaib Ben Taieb, Gianluca Bontempi, Amir F. Atiya, Antti Sorjamaa:
A review and comparison of strategies for multi-step ahead time series forecasting based on the NN5 forecasting competition. CoRR abs/1108.3259 (2011) - 2010
- [j6]Qi Yu, Yoan Miché, Antti Sorjamaa, Alberto Guillén, Amaury Lendasse, Eric Séverin:
OP-KNN: Method and Applications. Adv. Artif. Neural Syst. 2010: 597373:1-597373:6 (2010) - [j5]Paul Merlin, Antti Sorjamaa, Bertrand Maillet
X-SOM and L-SOM: A double classification approach for missing value imputation. Neurocomputing 73(7-9): 1103-1108 (2010) - [j4]Souhaib Ben Taieb
Multiple-output modeling for multi-step-ahead time series forecasting. Neurocomputing 73(10-12): 1950-1957 (2010) - [j3]Dusan Sovilj, Antti Sorjamaa, Qi Yu, Yoan Miche
OPELM and OPKNN in long-term prediction of time series using projected input data. Neurocomputing 73(10-12): 1976-1986 (2010) - [j2]Yoan Miche
OP-ELM: optimally pruned extreme learning machine. IEEE Trans. Neural Networks 21(1): 158-162 (2010)
2000 – 2009
- 2009
- [c14]Paul Merlin, Antti Sorjamaa, Bertrand Maillet, Amaury Lendasse:
X-SOM and L-SOM: a nested approach for missing value imputation. ESANN 2009 - [c13]Alberto Guillén
Mutual Information Based Initialization of Forward-Backward Search for Feature Selection in Regression Problems. ICANN (1) 2009: 1-9 - [c12]Souhaib Ben Taieb
Long-term prediction of time series by combining direct and MIMO strategies. IJCNN 2009: 3054-3061 - [c11]Alberto Guillén
Efficient Parallel Feature Selection for Steganography Problems. IWANN (1) 2009: 1224-1231 - [c10]Antti Sorjamaa, Francesco Corona
Sparse Linear Combination of SOMs for Data Imputation: Application to Financial Database. WSOM 2009: 290-297 - 2008
- [c9]Qi Yu, Antti Sorjamaa, Yoan Miche
Optimal Pruned K-Nearest Neighbors: OP-KNN - Application to Financial Modeling. HIS 2008: 764-769 - [c8]Yoan Miche
OP-ELM: Theory, Experiments and a Toolbox. ICANN (1) 2008: 145-154 - [c7]Antti Sorjamaa, Yoan Miche
Long-term prediction of time series using NNE-based projection and OP-ELM. IJCNN 2008: 2674-2680 - 2007
- [j1]Antti Sorjamaa, Jin Hao, Nima Reyhani, Yongnan Ji, Amaury Lendasse
Methodology for long-term prediction of time series. Neurocomputing 70(16-18): 2861-2869 (2007) - [c6]Antti Sorjamaa, Paul Merlin, Bertrand Maillet, Amaury Lendasse:
SOM+EOF for finding missing values. ESANN 2007: 115-120 - [c5]Antti Sorjamaa, Amaury Lendasse
Time Series Prediction as a Problem of Missing Values: Application to ESTSP2007 and NN3 Competition Benchmarks. IJCNN 2007: 2948-2953 - 2006
- [c4]Antti Sorjamaa, Amaury Lendasse:
Time series prediction using DirRec strategy. ESANN 2006: 143-148 - 2005
- [c3]Antti Sorjamaa, Amaury Lendasse, Michel Verleysen:
Pruned lazy learning models for time series prediction. ESANN 2005: 509-514 - [c2]Antti Sorjamaa, Jin Hao, Amaury Lendasse:
Mutual Information and k-Nearest Neighbors Approximator for Time Series Prediction. ICANN (2) 2005: 553-558 - [c1]Antti Sorjamaa, Nima Reyhani, Amaury Lendasse:
Input and Structure Selection for k-NN Approximator. IWANN 2005: 985-992
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: