Practical Solutions to the Problem of Diagonal Dominance in Kernel Document Clustering

Abstract

In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to the off-diagonal entries. This problem, referred to as diagonal dominance, often occurs when certain kernel functions are applied to sparse high-dimensional data, such as text corpora. In this paper we investigate the implications of diagonal dominance for unsupervised kernel methods, specifically in the task of document clustering. We discuss a selection of strategies for addressing this issue, and evaluate their effectiveness in producing more accurate and stable clusterings.