A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
Learning Simple Relations: Theory and Applications
[chapter]
2002
Proceedings of the 2002 SIAM International Conference on Data Mining
In addition to classic clustering algorithms, many different approaches to clustering are emerging for objects of special nature. In this article we deal with the grouping of rows and columns of a matrix with non-negative entries. Two rows (or columns) are considered similar if corresponding cross-distributions are close. This grouping is a dual clustering of two sets of elements, row and column indices. The introduced approach is based on the minimization of reduction of mutual information
doi:10.1137/1.9781611972726.25
dblp:conf/sdm/BerkhinB02
fatcat:rept7emfxzggjd2v6iamjoqjii