Non-redundant Multi-view Clustering via Orthogonalization

Abstract

Abstract

Avoiding Bias in Text Clustering Using Constrained K-means and May-Not-Links

“…Some papers approach the inclusion of the constraints through the learning of distance functions [16], such as Davidson and Qi [11], which uses Must-Link and Cannot-Link knowledge but implies the use of Singular Value Decomposition (SVD), or Cui et al [12], an approach to produce multiple orthogonal clustering views using Principal Component Analysis (PCA).…”

“…This has been a very fruitful field in the last years [4][5][6][7][8][9][10][11][12]. This constrained clustering is quite different from a classification process, as the domain knowledge gives the clustering algorithm rules over data instances (documents), instead of examples of the categories.…”

MultiClust special issue on discovering, summarizing and using multiple clusterings

“…Discovering multiple clusterings is an emerging topic that has received significant attention in recent years at top international conferences. The seminal paper on the topic won the best paper award at ICDM 2004 (Gondek and Hofmann 2004) with follow-up work establishing various research directions in meta-clustering (Caruana et al 2006), alternative clustering (Bae and Bailey 2006), alternative clusterings using constraints (Davidson and Qi 2008), multi-view clustering via orthogonalization (Cui et al 2007), non-redundant subspace clustering (Assent et al 2008), disparate clustering (Hossain et al 2010), and non-redundant spectral clustering views (Niu et al 2010). All of these research directions on multiple clusterings provide a new way of looking at the clustering problem.…”

Clustering with flexible constraints and application to disease subtyping

“…There are a few multiple alternative clustering approaches that can output multiple clustering solutions [101,102,103,4,104]. However, all these methods are unsupervised; none of these methods are able to utilize expert inputs.…”