Inderjit S. Dhillon

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 Hyuk Cho

> Home > Persons > Inderjit S. Dhillon

Publications

2009
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/icml/DeodharGGCD09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/DeodharGGCD09
Meghana Deodhar, Gunjan Gupta, Joydeep Ghosh, Hyuk Cho, Inderjit S. Dhillon:
A scalable framework for discovering coherent co-clusters in noisy data. ICML 2009: 241-248
2008
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/tcbb/ChoD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcbb/ChoD08
Hyuk Cho, Inderjit S. Dhillon:
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 385-400 (2008)
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/icdm/DeodharGGCD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdm/DeodharGGCD08
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk Cho, Inderjit S. Dhillon:
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets. ICDM Workshops 2008: 654-663
2004
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/sdm/SraCDG04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sdm/SraCDG04
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvrit Sra:
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data. SDM 2004: 114-125

a service of

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.