![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Inderjit S. Dhillon 3 Inderjit S. Dhillon: Co-clustering documents and words using bipartite spectral graph partitioning. KDD 2001 : 269-274 2 Inderjit S. Dhillon, Dharmendra S. Modha : Concept Decompositions for Large Sparse Text Data Using Clustering. Machine Learning 42 (1/2): 143-175 (2001) 1 Inderjit S. Dhillon, Dharmendra S. Modha : A Data-Clustering Algorithm on Distributed Memory Multiprocessors. Large-Scale Parallel Data Mining 1999 : 245-260 ![]() DiSC'02 © 2003 Association for Computing Machinery |