Le Song

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Justin Bedo

> Home > Persons > Le Song

Publications

2012
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jmlr/SongSGBB12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmlr/SongSGBB12
Le Song, Alexander J. Smola, Arthur Gretton, Justin Bedo, Karsten M. Borgwardt:
Feature Selection via Dependence Maximization. J. Mach. Learn. Res. 13: 1393-1434 (2012)
2007
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/icml/SongSGBB07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/SongSGBB07
Le Song, Alexander J. Smola, Arthur Gretton, Karsten M. Borgwardt, Justin Bedo:
Supervised feature selection via dependence estimation. ICML 2007: 823-830
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/ismb/SongBBGS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ismb/SongBBGS07
Le Song, Justin Bedo, Karsten M. Borgwardt, Arthur Gretton, Alexander J. Smola:
Gene selection via the BAHSIC family of algorithms. ISMB/ECCB (Supplement of Bioinformatics) 2007: 490-498
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0704-2668
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0704-2668
Le Song, Alexander J. Smola, Arthur Gretton, Karsten M. Borgwardt, Justin Bedo:
Supervised Feature Selection via Dependence Estimation. CoRR abs/0704.2668 (2007)

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.