George Karypis
(Redirected from G. Karypis)
Jump to navigation
Jump to search
George Karypis is a person.
References
2011a
- (Zhao & Karypis, 2011) ⇒ Ying Zhao; and George Karypis. (2011). “Document Clustering.” In: (Sammut & Webb, 2011)
2011b
- (Ning & Karypis, 2011) ⇒ Xia Ning, and George Karypis. (2011). “SLIM: Sparse Linear Methods for Top-N Recommender Systems.” In: Proceedings of the 2011 IEEE 11th International Conference on Data Mining. ISBN:978-0-7695-4408-3 doi:10.1109/ICDM.2011.134
2011c
- (Desrosiers & Karypis, 2011) ⇒ Christian Desrosiers, and George Karypis. (2011). “A Comprehensive Survey of Neighborhood-based Recommendation Methods.” Recommender systems handbook
2002
- (Karypis, 2002) ⇒ George Karypis. (2002). “CLUTO - a Clustering Toolkit." No. TR-02-017. MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE,
2001
- (Sarwar et al., 2001) ⇒ Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl. (2001). “Item-based Collaborative Filtering Recommendation Algorithms.” In: Proceedings of the 10th International Conference on World Wide Web, pp. 285-295 . ACM,
- (Ramakrishnan, 2001) ⇒ Naren Ramakrishnan, Benjamin J. Keller, Batul J. Mirza, Ananth Y. Grama, and George Karypis. (2001). “Privacy Risks in Recommender Systems.” In: IEEE Internet Computing, 5(6).
2000
- (Steinbach, 2000) ⇒ Michael Steinbach, George Karypis, and Vipin Kumar. (2000). “A Comparison of Document Clustering Techniques.” In: Proceedings of SIGKDD Workshop on Text Mining.
1999
- (Karypsis et al., 1999) ⇒ George Karypis, E. Han, and Vipin Kumar. (1999). “Chameleon: Hierarchical clustering using dynamic modeling.” In: IEEE Computer, 32(8).
1998
- (Karypis & Kumar, 1998) ⇒ George Karypis, and Vipin Kumar. (1998). “A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs.” In: SIAM Journal on scientific Computing, 20(1).