Practical Solutions to the Problem of Diagonal Dominance in Kernel Document Clustering
![Thumbnail](/xmlui/themes/Mirage2/images/white_rectangle.jpeg)
File Type:
PDFItem Type:
Technical ReportDate:
2006-02-07Citation:
Greene, Derek; Cunningham, Padraig. 'Practical Solutions to the Problem of Diagonal Dominance in Kernel Document Clustering'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-2006-04, 2006, pp14Download Item:
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.
Author: Greene, Derek; Cunningham, Padraig
Publisher:
Trinity College Dublin, Department of Computer ScienceType of material:
Technical ReportCollections
Series/Report no:
Computer Science Technical ReportTCD-CS-2006-04
Availability:
Full text availableKeywords:
Computer ScienceMetadata
Show full item recordLicences: