| The Maximum Weighted Submatrix Coverage Problem: A CP Approach. | 0 | 0.34 | 2019 |
| Mining a Maximum Weighted Set of Disjoint Submatrices. | 0 | 0.34 | 2019 |
| Identifying gene-specific subgroups: an alternative to biclustering. | 0 | 0.34 | 2019 |
| Mining a Sub-Matrix of Maximal Sum. | 0 | 0.34 | 2017 |
| Inferring statistically significant features from random forests. | 0 | 0.34 | 2015 |
| Survival Analysis with Cox Regression and Random Non-linear Projections | 0 | 0.34 | 2015 |
| Kernel methods for heterogeneous feature selection. | 6 | 0.42 | 2015 |
| Kernel methods for mixed feature selection. | 1 | 0.35 | 2014 |
| The Coxlogit model: Feature selection from survival and classification data | 0 | 0.34 | 2014 |
| STAMINA: a competition to encourage the development and assessment of software model inference techniques | 22 | 0.86 | 2013 |
| Type 1 and 2 mixtures of Kullback-Leibler divergences as cost functions in dimensionality reduction based on similarity preservation | 26 | 1.13 | 2013 |
| Generalized spike-and-slab priors for Bayesian group feature selection using expectation propagation | 28 | 1.20 | 2013 |
| The stability of feature selection and class prediction from ensemble tree classifiers. | 5 | 0.46 | 2012 |
| Robust Multi-Class Gaussian Process Classification. | 9 | 0.51 | 2011 |
| Expectation propagation for Bayesian multi-task feature selection | 12 | 0.68 | 2010 |
| THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION | 30 | 1.45 | 2008 |
| State-Merging DFA Induction Algorithms with Mandatory Merge Constraints | 10 | 0.65 | 2008 |
| A Position-Based Propagator for the Open-Shop Problem | 1 | 0.35 | 2007 |
| The Deviation Constraint | 9 | 0.66 | 2007 |
| Learning Partially Observable Markov Models from First Passage Times | 0 | 0.34 | 2007 |
| Filtering for subgraph isomorphism | 8 | 0.67 | 2007 |
| Bound-consistent deviation constraint | 4 | 0.57 | 2007 |
| Sequence discrimination using phase-type distributions | 0 | 0.34 | 2006 |
| Inducing hidden Markov models to model long-term dependencies | 4 | 0.53 | 2005 |
| Approximate Constrained Subgraph Matching | 3 | 0.48 | 2005 |
| CP(Graph): Introducing a Graph Computation Domain in Constraint Programming | 38 | 1.54 | 2005 |
| Generating Annotated Behavior Models from End-User Scenarios | 63 | 2.32 | 2005 |
| Improving Probabilistic Automata Learning with Additional Knowledge | 2 | 0.51 | 2004 |
| A mozart implementation of CP(BioNet) | 0 | 0.34 | 2004 |
| Recherche de chemins contraints dans les réseaux biochimiques | 2 | 0.45 | 2004 |
| The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering | 97 | 10.15 | 2004 |
