default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Claude Fort
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j10]Jean-Claude Fort, Thierry Klein, Agnès Lagnoux
:
Global Sensitivity Analysis and Wasserstein Spaces. SIAM/ASA J. Uncertain. Quantification 9(2): 880-921 (2021)
2010 – 2019
- 2014
- [j9]Luis A. Salomón, Jean-Claude Fort, Li-Vang Lozada-Chang:
Average Competitive Learning Vector Quantization. Commun. Stat. Simul. Comput. 43(6): 1288-1303 (2014) - 2010
- [c9]Guillaume Roussel, Véronique Achard, Alexandre Alakian, Jean-Claude Fort:
Benefits of textural characterization for the classification of hyperspectral images. WHISPERS 2010: 1-4
2000 – 2009
- 2007
- [i1]Geoffroy Simon, Amaury Lendasse, Marie Cottrell, Jean-Claude Fort, Michel Verleysen:
Time Series Forecasting: Obtaining Long Term Trends with Self-Organizing Maps. CoRR abs/cs/0701052 (2007) - 2006
- [j8]Jean-Claude Fort:
SOM's mathematics. Neural Networks 19(6-7): 812-816 (2006) - 2005
- [j7]Geoffroy Simon, Amaury Lendasse, Marie Cottrell, Jean-Claude Fort, Michel Verleysen:
Time series forecasting: Obtaining long term trends with self-organizing maps. Pattern Recognit. Lett. 26(12): 1795-1808 (2005) - 2004
- [j6]Geoffroy Simon, Amaury Lendasse, Marie Cottrell, Jean-Claude Fort, Michel Verleysen:
Double quantization of the regressor space for long-term time series prediction: method and proof of stability. Neural Networks 17(8-9): 1169-1181 (2004) - 2002
- [j5]Jean-Claude Fort, Gilles Pagès:
Decreasing step Stochastic algorithms: a.s. behaviour of weighted empirical measures. Monte Carlo Methods Appl. 8(3): 237-270 (2002) - [c8]Jean-Claude Fort, Patrick Letrémy, Marie Cottrell:
Advantages and drawbacks of the Batch Kohonen algorithm. ESANN 2002: 223-230
1990 – 1999
- 1998
- [j4]Marie Cottrell, Jean-Claude Fort, Gilles Pagès:
Theoretical aspects of the SOM algorithm. Neurocomputing 21(1-3): 119-138 (1998) - 1997
- [c7]Avec M. Benaïm, Jean-Claude Fort, Gilles Pagès:
Almost sure convergence of the one-dimensional Kohonen algorithm. ESANN 1997 - [c6]Jean-Claude Fort, Gilles Pagès:
Convergences of the Kohonen Maps: A Dynamical System Approach. ICANN 1997: 631-636 - 1996
- [j3]Jean-Claude Fort, Gilles Pagès:
About the Kohonen Algorithm: Strong or Weak Self-organization? Neural Networks 9(5): 773-785 (1996) - [c5]Jean-Claude Fort, Gilles Pagès:
Quantization vs Organization in the Kohonen S.O.M. ESANN 1996 - 1995
- [j2]Marie Cottrell, Jean-Claude Fort, Gilles Pagès:
Comments about "Analysis of the convergence properties of topology preserving neural networks". IEEE Trans. Neural Networks 6(3): 797-799 (1995) - [c4]Jean-Claude Fort, Gilles Pagès:
About the Kohonen algorithm: strong or weak self-organization? ESANN 1995 - 1994
- [j1]Nicolas Pican, Jean-Claude Fort, Frédéric Alexandre:
An on-line learning algorithm for the orthogonal weight estimation of MLP. Neural Process. Lett. 1(1): 21-24 (1994) - [c3]Marie Cottrell, Jean-Claude Fort, Gilles Pagès:
Two or three things that we know about the Kohonen algorithm. ESANN 1994 - [c2]Jean-Claude Fort, Gilles Pagès:
A non linear Kohonen algorithm. ESANN 1994 - [c1]Nicolas Pican, Jean-Claude Fort, Frédéric Alexandre:
A lateral contribution learning algorithm for multi MLP architecture. ESANN 1994
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-24 22:56 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:
