Остановите войну!
for scientists:
default search action
Pierre Dupont
- > Home > Persons > Pierre Dupont
Publications
- 2019
- [j11]Vincent Branders, Pierre Schaus, Pierre Dupont:
Identifying gene-specific subgroups: an alternative to biclustering. BMC Bioinform. 20(1): 625 (2019) - [c43]Guillaume Derval, Vincent Branders, Pierre Dupont, Pierre Schaus:
The Maximum Weighted Submatrix Coverage Problem: A CP Approach. CPAIOR 2019: 258-274 - [c42]Vincent Branders, Guillaume Derval, Pierre Schaus, Pierre Dupont:
Mining a Maximum Weighted Set of Disjoint Submatrices. DS 2019: 18-28 - 2017
- [c41]Vincent Branders, Pierre Schaus, Pierre Dupont:
Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum. NFMCP@PKDD/ECML 2017: 65-79 - [i2]Vincent Branders, Pierre Schaus, Pierre Dupont:
Mining a Sub-Matrix of Maximal Sum. CoRR abs/1709.08461 (2017) - 2015
- [j10]Jérôme Paul, Pierre Dupont:
Inferring statistically significant features from random forests. Neurocomputing 150: 471-480 (2015) - [j9]Jérôme Paul, Roberto D'Ambrosio, Pierre Dupont:
Kernel methods for heterogeneous feature selection. Neurocomputing 169: 187-195 (2015) - [c40]Samuel Branders, Benoît Frénay, Pierre Dupont:
Survival Analysis with Cox Regression and Random Non-linear Projections. ESANN 2015 - [i1]Samuel Branders, Roberto D'Ambrosio, Pierre Dupont:
A mixture Cox-Logistic model for feature selection from survival and classification data. CoRR abs/1502.01493 (2015) - 2014
- [c39]Samuel Branders, Roberto D'Ambrosio, Pierre Dupont:
The Coxlogit model: Feature selection from survival and classification data. MCDM 2014: 137-143 - [c38]Jérôme Paul, Pierre Dupont:
Kernel methods for mixed feature selection. ESANN 2014 - 2013
- [j7]John Aldo Lee, Emilie Renard, Guillaume Bernard, Pierre Dupont, Michel Verleysen:
Type 1 and 2 mixtures of Kullback-Leibler divergences as cost functions in dimensionality reduction based on similarity preservation. Neurocomputing 112: 92-108 (2013) - [c37]Emilie Renard, Pierre Dupont, Michel Verleysen:
User Control for Adjusting Conflicting Objectives in Parameter-dependent Visualization of Data. VAMP@EuroVis 2013 - 2012
- [c36]Jérôme Paul, Michel Verleysen, Pierre Dupont:
The stability of feature selection and class prediction from ensemble tree classifiers. ESANN 2012 - 2010
- [j4]Karoline Faust, Pierre Dupont, Jérôme Callut, Jacques van Helden:
Pathway discovery in metabolic networks by subgraph extraction. Bioinform. 26(9): 1211-1218 (2010) - 2008
- [c29]Jérôme Callut, Kevin Françoisse, Marco Saerens, Pierre Dupont:
Semi-supervised Classification from Discriminative Random Walks. ECML/PKDD (1) 2008: 162-177 - 2007
- [c28]Pierre Schaus, Yves Deville, Pierre Dupont:
Bound-Consistent Deviation Constraint. CP 2007: 620-634 - [c27]Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont:
Filtering for Subgraph Isomorphism. CP 2007: 728-742 - [c26]Jean-Noël Monette, Yves Deville, Pierre Dupont:
A Position-Based Propagator for the Open-Shop Problem. CPAIOR 2007: 186-199 - [c25]Pierre Schaus, Yves Deville, Pierre Dupont, Jean-Charles Régin:
The Deviation Constraint. CPAIOR 2007: 260-274 - [c24]Jérôme Callut, Pierre Dupont:
Learning Partially Observable Markov Models from First Passage Times. ECML 2007: 91-103 - 2006
- [c23]Jérôme Callut, Pierre Dupont:
Sequence Discrimination Using Phase-Type Distributions. ECML 2006: 78-89 - 2005
- [c22]Jérôme Callut, Pierre Dupont:
Séparateurs à Vaste Marge Optimisant la Fonction Fbeta. CAP 2005: 79-92 - [c21]Grégoire Dooms, Yves Deville, Pierre Dupont:
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming. CP 2005: 211-225 - [c20]Stéphane Zampelli, Yves Deville, Pierre Dupont:
Approximate Constrained Subgraph Matching. CP 2005: 832-836 - [c19]Jérôme Callut, Pierre Dupont:
Inducing Hidden Markov Models to Model Long-Term Dependencies. ECML 2005: 513-521 - 2004
- [c18]Marco Saerens, François Fouss, Luh Yen, Pierre Dupont:
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering. ECML 2004: 371-383 - [c17]Jérôme Callut, Pierre Dupont:
A Markovian Approach to the Induction of Regular String Distributions. ICGI 2004: 77-90 - [c16]Grégoire Dooms, Yves Deville, Pierre Dupont:
Recherche de chemins contraints dans les réseaux biochimiques. JFPLC 2004 - [c15]Grégoire Dooms, Yves Deville, Pierre Dupont:
A Mozart Implementation of CP(BioNet). MOZ 2004: 237-250 - [c14]Christopher Kermorvant, Colin de la Higuera, Pierre Dupont:
Improving Probabilistic Automata Learning with Additional Knowledge. SSPR/SPR 2004: 260-268 - 2002
- [c13]Christopher Kermorvant, Pierre Dupont:
Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains. ECML 2002: 185-194 - [c11]Christopher Kermorvant, Pierre Dupont:
Stochastic Grammatical Inference with Multinomial Tests. ICGI 2002: 149-160 - 2000
- [c10]Pierre Dupont, Juan-Carlos Amengual:
Smoothing Probabilistic Automata: An Error-Correcting Approach. ICGI 2000: 51-64 - [c9]Franck Thollard, Pierre Dupont, Colin de la Higuera:
Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality. ICML 2000: 975-982 - 1994
- [c4]Pierre Dupont, Laurent Miclet, Enrique Vidal:
What Is the Search Space of the Regular Inference? ICGI 1994: 25-37
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 2023-09-27 22:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint