Abstract
This paper describes how the concepts of agglomerative clustering and c-means clustering are adapted to analyze information tables in rough set studies. Agglomerative clustering is generalized into poset-valued clustering and kernel based c-means algorithms are proposed with natural kernels for information tables.