2008 |
20 | EE | François Laviolette,
Mario Marchand,
Sara Shanian:
Selective Sampling for Classification.
Canadian Conference on AI 2008: 191-202 |
2006 |
19 | | Luc Lamontagne,
Mario Marchand:
Advances in Artificial Intelligence, 19th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2006, Québec City, Québec, Canada, June 7-9, 2006, Proceedings
Springer 2006 |
18 | EE | Pascal Germain,
Alexandre Lacasse,
François Laviolette,
Mario Marchand:
A PAC-Bayes Risk Bound for General Loss Functions.
NIPS 2006: 449-456 |
17 | EE | Alexandre Lacasse,
François Laviolette,
Mario Marchand,
Pascal Germain,
Nicolas Usunier:
PAC-Bayes Bounds for the Risk of the Majority Vote and the Variance of the Gibbs Classifier.
NIPS 2006: 769-776 |
2005 |
16 | EE | François Laviolette,
Mario Marchand,
Mohak Shah:
Margin-Sparsity Trade-Off for the Set Covering Machine.
ECML 2005: 206-217 |
15 | EE | François Laviolette,
Mario Marchand:
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers.
ICML 2005: 481-488 |
14 | EE | François Laviolette,
Mario Marchand,
Mohak Shah:
A PAC-Bayes approach to the Set Covering Machine.
NIPS 2005 |
13 | EE | Mario Marchand,
Marina Sokolova:
Learning with Decision Lists of Data-Dependent Features.
Journal of Machine Learning Research 6: 427-451 (2005) |
2004 |
12 | EE | Mario Marchand,
Mohak Shah:
PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data.
NIPS 2004 |
2003 |
11 | | Mario Marchand,
Mohak Shah,
John Shawe-Taylor,
Marina Sokolova:
The Set Covering Machine with Data-Dependent Half-Spaces.
ICML 2003: 520-527 |
2002 |
10 | EE | Marina Sokolova,
Mario Marchand,
Nathalie Japkowicz,
John Shawe-Taylor:
The Decision List Machine.
NIPS 2002: 921-928 |
9 | EE | Mario Marchand,
John Shawe-Taylor:
The Set Covering Machine.
Journal of Machine Learning Research 3: 723-746 (2002) |
2001 |
8 | | Mario Marchand,
John Shawe-Taylor:
Learning with the Set Covering Machine.
ICML 2001: 345-352 |
1996 |
7 | EE | Mostefa Golea,
Mario Marchand,
Thomas R. Hancock:
On learning ?-perceptron networks on the uniform distribution.
Neural Networks 9(1): 67-82 (1996) |
1995 |
6 | EE | Mario Marchand,
Saeed Hadjifaradji:
Strong Unimodality and Exact Learning of Constant Depth µ-Perceptron Networks.
NIPS 1995: 288-294 |
1994 |
5 | EE | Mario Marchand,
Saeed Hadjifaradji:
Learning Stochastic Perceptrons Under k-Blocking Distributions.
NIPS 1994: 279-286 |
4 | | Thomas R. Hancock,
Mostefa Golea,
Mario Marchand:
Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries.
Machine Learning 16(3): 161-183 (1994) |
1993 |
3 | EE | Mostefa Golea,
Mario Marchand:
Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks.
COLT 1993: 151-157 |
2 | | Mostefa Golea,
Mario Marchand:
Polynomial Time Algorithms for Learning Neural Nets of NonoverlappingPerceptrons.
Computational Intelligence 9: 155-170 (1993) |
1992 |
1 | EE | Mostefa Golea,
Mario Marchand,
Thomas R. Hancock:
On Learning µ-Perceptron Networks with Binary Weights.
NIPS 1992: 591-598 |