next up previous
Next: About this document ... Up: Using Co-clustering for Predicting Previous: Conclusion

Bibliography

1
A. Banerjee, I. S. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha.
A generalized maximum entropy approach to bregman co-clustering and matrix approximation.
In Proceedings of the 10th International Conference on Knowledge Discovery and Data Mining (KDD), pages 509-514, 2004.

2
A. Banerjee, I. S. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha.
A generalized maximum entropy approach to bregman co-clustering and matrix approximation.
In submission for publication, 2006 (personal copy obtained from Srujana).

3
I. S. Dhillon, S. Mallela, and D. S. Modha.
Information-theoretic co-clustering.
In Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003), pages 89-98, 2003.

4
T. George and S. Merugu.
A scalable collaborative filtering framework based on co-clustering.
In Proceedings of the 5th IEEE Conference on Data Mining (ICDM), pages 625-628, 2005.

5
G. Gorrell.
Generalized hebbian algorithm for incremental singular value decomposition in natural language processing.
In EACL. The Association for Computer Linguistics, 2006.

6
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl.
Application of dimensionality reduction in recommender systems-a case study.
In ACM WebKDD Workshop, 2000.

7
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl.
Application of dimensionality reduction in recommender systems-a case study.
Technical Report 00-043, Department of Computer Science and Engineering, University of Minnesota, 2000.

8
N. Srebro and T. Jaakkola.
Weighted low rank approximation.
In 20th International Conference on Machine Learning, 2003., 2003.


Tuyen Huynh 2007-05-09