Mario Marchand Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand: PAC-Bayesian learning of linear classifiers. ICML 2009: 45
2008
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrançois Laviolette, Mario Marchand, Sara Shanian: Selective Sampling for Classification. Canadian Conference on AI 2008: 191-202
2006
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLuc 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand: A PAC-Bayes Risk Bound for General Loss Functions. NIPS 2006: 449-456
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandre 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrançois Laviolette, Mario Marchand, Mohak Shah: Margin-Sparsity Trade-Off for the Set Covering Machine. ECML 2005: 206-217
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrançois Laviolette, Mario Marchand: PAC-Bayes risk bounds for sample-compressed Gibbs classifiers. ICML 2005: 481-488
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrançois Laviolette, Mario Marchand, Mohak Shah: A PAC-Bayes approach to the Set Covering Machine. NIPS 2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, Marina Sokolova: Learning with Decision Lists of Data-Dependent Features. Journal of Machine Learning Research 6: 427-451 (2005)
2004
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, Mohak Shah: PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data. NIPS 2004
2003
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, Mohak Shah, John Shawe-Taylor, Marina Sokolova: The Set Covering Machine with Data-Dependent Half-Spaces. ICML 2003: 520-527
2002
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarina Sokolova, Mario Marchand, Nathalie Japkowicz, John Shawe-Taylor: The Decision List Machine. NIPS 2002: 921-928
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, John Shawe-Taylor: The Set Covering Machine. Journal of Machine Learning Research 3: 723-746 (2002)
2001
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, John Shawe-Taylor: Learning with the Set Covering Machine. ICML 2001: 345-352
1996
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostefa Golea, Mario Marchand, Thomas R. Hancock: On learning ?-perceptron networks on the uniform distribution. Neural Networks 9(1): 67-82 (1996)
1995
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, Saeed Hadjifaradji: Strong Unimodality and Exact Learning of Constant Depth µ-Perceptron Networks. NIPS 1995: 288-294
1994
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Marchand, Saeed Hadjifaradji: Learning Stochastic Perceptrons Under k-Blocking Distributions. NIPS 1994: 279-286
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas R. Hancock, Mostefa Golea, Mario Marchand: Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries. Machine Learning 16(3): 161-183 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostefa Golea, Mario Marchand: Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks. COLT 1993: 151-157
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostefa Golea, Mario Marchand: Polynomial Time Algorithms for Learning Neural Nets of NonoverlappingPerceptrons. Computational Intelligence 9: 155-170 (1993)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostefa Golea, Mario Marchand: On Learning Perceptrons with Binary Weights. Neural Computation 5(5): 767-782 (1993)
1992
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostefa Golea, Mario Marchand, Thomas R. Hancock: On Learning µ-Perceptron Networks with Binary Weights. NIPS 1992: 591-598

Coauthor Index

1Pascal Germain [18] [19] [22]
2Mostefa Golea [1] [2] [3] [4] [5] [8]
3Saeed Hadjifaradji [6] [7]
4Thomas R. Hancock [1] [5] [8]
5Nathalie Japkowicz [11]
6Alexandre Lacasse [18] [19] [22]
7Luc Lamontagne [20]
8François Laviolette [15] [16] [17] [18] [19] [21] [22]
9Mohak Shah [12] [13] [15] [17]
10Sara Shanian [21]
11John Shawe-Taylor [9] [10] [11] [12]
12Marina Sokolova [11] [12] [14]
13Nicolas Usunier [18]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)