Co-clustering, an extension of one-sided clustering, refers to process of clustering data points and features simultaneously. During text clustering tasks, traditional one-sided clustering algorithms have encountered difficulties dealing with sparse problem. Instead, a co-clustering procedure, where data's common organizing form is a big matrix aggregated by data points, has proved more useful when faced with sparsity. Based on the traditional co-clustering approaches, a new model named SC-DNMF, which takes into account the semantic constraints between words, is proposed in this paper. Experiments on several datasets indicate that our proposal improves the clustering accuracy over traditional co-clustering models.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.