The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Inderjit S. Dhillon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Inderjit S. Dhillon, Yuqiang Guan
    Information Theoretic Clustering of Sparse Co-Occurrence Data. [Citation Graph (0, 0)][DBLP]
    ICDM, 2003, pp:517-520 [Conf]
  2. Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
    Iterative Clustering of High Dimensional Text Data Augmented by Local Search. [Citation Graph (0, 0)][DBLP]
    ICDM, 2002, pp:131-138 [Conf]
  3. Arindam Banerjee, Inderjit S. Dhillon, Joydeep Ghosh, Srujana Merugu
    An information theoretic analysis of maximum likelihood mixture estimation for exponential families. [Citation Graph (0, 0)][DBLP]
    ICML, 2004, pp:- [Conf]
  4. Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Raymond J. Mooney
    Semi-supervised graph clustering: a kernel approach. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:457-464 [Conf]
  5. Brian Kulis, Mátyás Sustik, Inderjit S. Dhillon
    Learning low-rank kernel matrices. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:505-512 [Conf]
  6. Arindam Banerjee, Inderjit S. Dhillon, Joydeep Ghosh, Srujana Merugu, Dharmendra S. Modha
    A generalized maximum entropy approach to bregman co-clustering and matrix approximation. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:509-514 [Conf]
  7. Arindam Banerjee, Inderjit S. Dhillon, Joydeep Ghosh, Suvrit Sra
    Generative model-based clustering of directional data. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:19-28 [Conf]
  8. Jason V. Davis, Inderjit S. Dhillon
    Estimating the global pagerank of web communities. [Citation Graph (0, 0)][DBLP]
    KDD, 2006, pp:116-125 [Conf]
  9. Inderjit S. Dhillon
    Co-clustering documents and words using bipartite spectral graph partitioning. [Citation Graph (0, 0)][DBLP]
    KDD, 2001, pp:269-274 [Conf]
  10. Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
    Kernel k-means: spectral clustering and normalized cuts. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:551-556 [Conf]
  11. Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
    A fast kernel-based multilevel algorithm for graph clustering. [Citation Graph (0, 0)][DBLP]
    KDD, 2005, pp:629-634 [Conf]
  12. Inderjit S. Dhillon, Dharmendra S. Modha
    A Data-Clustering Algorithm on Distributed Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Large-Scale Parallel Data Mining, 1999, pp:245-260 [Conf]
  13. Inderjit S. Dhillon, Subramanyam Mallela, Rahul Kumar
    Enhanced word clustering for hierarchical text classification. [Citation Graph (0, 0)][DBLP]
    KDD, 2002, pp:191-200 [Conf]
  14. Inderjit S. Dhillon, Subramanyam Mallela, Dharmendra S. Modha
    Information-theoretic co-clustering. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:89-98 [Conf]
  15. Inderjit S. Dhillon, Suvrit Sra
    Generalized Nonnegative Matrix Approximations with Bregman Divergences. [Citation Graph (0, 0)][DBLP]
    NIPS, 2005, pp:- [Conf]
  16. Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
    Triangle Fixing Algorithms for the Metric Nearness Problem. [Citation Graph (0, 0)][DBLP]
    NIPS, 2004, pp:- [Conf]
  17. Jaeyoung Choi, James Demmel, Inderjit S. Dhillon, Jack Dongarra, Susan Ostrouchov, Antoine Petitet, Ken Stanley, David W. Walker, R. Clinton Whaley
    ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance. [Citation Graph (0, 0)][DBLP]
    PARA, 1995, pp:95-106 [Conf]
  18. Andrew J. Cleary, James Demmel, Inderjit S. Dhillon, Jack Dongarra, Sven Hammarling, Antoine Petitet, H. Ren, Ken Stanley, R. Clinton Whaley
    Practical Experience in the Dangers of Heterogeneous Computing. [Citation Graph (0, 0)][DBLP]
    PARA, 1996, pp:57-64 [Conf]
  19. L. Susan Blackford, Jaeyoung Choi, Andrew J. Cleary, Eduardo F. D'Azevedo, James Demmel, Inderjit S. Dhillon, Jack Dongarra, Sven Hammarling, Greg Henry, Antoine Petitet, Ken Stanley, David W. Walker, R. Clinton Whaley
    ScaLAPACK: A Linear Algebra Library for Message-Passing Computers. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  20. Inderjit S. Dhillon, George Fann, Beresford N. Parlett
    Application of a New Algorithm for the Symmetric Eigenproblem to Computational Quantum Chemistry. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  21. Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh
    Clustering with Bregman Divergences. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  22. Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvrit Sra
    Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  23. Inderjit S. Dhillon, Edward M. Marcotte, Usman Roshan
    Diametrical clustering for identifying anti-correlated gene clusters. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:13, pp:1612-1619 [Journal]
  24. Inderjit S. Dhillon, Subramanyam Mallela, Rahul Kumar
    A Divisive Information-Theoretic Feature Clustering Algorithm for Text Classification. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2003, v:3, n:, pp:1265-1287 [Journal]
  25. Arindam Banerjee, Inderjit S. Dhillon, Joydeep Ghosh, Suvrit Sra
    Clustering on the Unit Hypersphere using von Mises-Fisher Distributions. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:1345-1382 [Journal]
  26. Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh
    Clustering with Bregman Divergences. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:1705-1749 [Journal]
  27. Inderjit S. Dhillon, Dharmendra S. Modha
    Concept Decompositions for Large Sparse Text Data Using Clustering. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:42, n:1/2, pp:143-175 [Journal]
  28. Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr.
    Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2916-2921 [Journal]
  29. Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer
    Designing structured tight frames via an alternating projection method. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:188-209 [Journal]
  30. L. Susan Blackford, Andrew J. Cleary, Antoine Petitet, R. Clinton Whaley, James Demmel, Inderjit S. Dhillon, H. Ren, Ken Stanley, Jack Dongarra, Sven Hammarling
    Practical Experience in the Numerical Dangers of Heterogeneous Computing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1997, v:23, n:2, pp:133-147 [Journal]
  31. Inderjit S. Dhillon, Beresford N. Parlett, Christof Vömel
    The design and implementation of the MRRR algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2006, v:32, n:4, pp:533-560 [Journal]
  32. Inderjit S. Dhillon, Dharmendra S. Modha, W. Scott Spangler
    Class visualization of high-dimensional data with applications. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2002, v:41, n:1, pp:59-90 [Journal]
  33. Inderjit S. Dhillon, Beresford N. Parlett, Christof Vömel
    Glued Matrices and the MRRR Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Scientific Computing, 2005, v:27, n:2, pp:496-510 [Journal]
  34. Paolo Bientinesi, Inderjit S. Dhillon, Robert A. van de Geijn
    A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Scientific Computing, 2005, v:27, n:1, pp:43-66 [Journal]
  35. Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit Sra, Inderjit S. Dhillon
    Information-theoretic metric learning. [Citation Graph (0, 0)][DBLP]
    ICML, 2007, pp:209-216 [Conf]
  36. Jason V. Davis, Inderjit S. Dhillon
    Differential Entropic Clustering of Multivariate Gaussians. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:337-344 [Conf]
  37. Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
    Fast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation Problem. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]
  38. Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
    Weighted Graph Cuts without Eigenvectors A Multilevel Approach. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2007, v:29, n:11, pp:1944-1957 [Journal]

  39. Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets. [Citation Graph (, )][DBLP]


  40. Clustering with Multiple Graphs. [Citation Graph (, )][DBLP]


  41. Rank minimization via online learning. [Citation Graph (, )][DBLP]


  42. Geometry-aware metric learning. [Citation Graph (, )][DBLP]


  43. A scalable framework for discovering coherent co-clusters in noisy data. [Citation Graph (, )][DBLP]


  44. A scalable trust-region algorithm with application to mixed-norm regression. [Citation Graph (, )][DBLP]


  45. Adaptive Website Design Using Caching Algorithms. [Citation Graph (, )][DBLP]


  46. Structured metric learning for high dimensional problems. [Citation Graph (, )][DBLP]


  47. Online Metric Learning and Fast Similarity Search. [Citation Graph (, )][DBLP]


  48. Simultaneous Unsupervised Learning of Disparate Clusterings. [Citation Graph (, )][DBLP]


  49. A spatio-temporal approach to collaborative filtering. [Citation Graph (, )][DBLP]


  50. Guaranteed Rank Minimization via Singular Value Projection [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002