default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Marcotorchino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j1]Pierre Bertrand
, Michel Broniatowski, Jean-François Marcotorchino:
Independence versus indetermination: basis of two canonical clustering criteria. Adv. Data Anal. Classif. 16(4): 1069-1093 (2022)
Conference and Workshop Papers
- 2021
- [c10]Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino:
Minimization with Respect to Divergences and Applications. GSI 2021: 818-828 - 2015
- [c9]Patricia Conde Céspedes, Jean-François Marcotorchino, Emmanuel Viennet:
Comparison of Linear Modularization Criteria Using the Relational Formalism, an Approach to Easily Identify Resolution Limit. EGC (best of volume) 2015: 101-120 - [c8]Patricia Conde Céspedes, Jean-François Marcotorchino, Emmanuel Viennet:
Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit. EGC 2015: 203-214 - [c7]Benoit Huyot, Yves Mabiala, Jean-François Marcotorchino:
Optimal Transport, Independance Versus Indetermination Duality, Impact on a New Copula Design. GSI 2015: 69-76 - 2014
- [c6]Benoit Huyot, Yves Mabiala, Jean-François Marcotorchino:
Online unsupervised anomaly detection in large information systems using copula theory. CCIS 2014: 679-684 - 2013
- [c5]François Marcotorchino, Patricia Conde Céspedes:
Optimal Transport and Minimal Trade Problem, Impacts on Relational Metrics and Applications to Large Graphs and Networks Modularity. GSI 2013: 169-179 - [c4]Patricia Conde Céspedes, Jean-François Marcotorchino:
Comparing Different Modularization Criteria Using Relational Metric. GSI 2013: 180-187 - 2012
- [c3]Patricia Conde Céspedes, François Marcotorchino:
Modularisation et Recherche de Communautés dans les réseaux complexes par Unification Relationnelle. AAFD 2012: 71-98 - 2008
- [c2]François Marcotorchino:
Essai de Typologie Structurelle des Indices de Similarité Vectoriels par Unification Relationnelle. AAFD 2008: 203-319 - 2006
- [c1]François Marcotorchino, Hamid Benhadda:
L'analyse relationnelle pour la fouille de grandes bases de données. AAFD 2006: 165-184
Informal and Other Publications
- 2021
- [i3]Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino:
Continuous indetermination and average likelihood minimization. CoRR abs/2105.01348 (2021) - 2020
- [i2]Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino:
"Statistical Independence" versus "Logical Indetermination", two ways of generating clustering criteria through couplings : Application to graphs modularization. CoRR abs/2007.08820 (2020) - [i1]Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino:
Logical indetermination coupling: a method to minimize drawing matches and its applications. CoRR abs/2012.14674 (2020)
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 2025-01-09 12:58 CET 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:
