scholar.google.com › citations
Research has showed that, by combining an ensemble of multiple clusterings, a superior solution can be attained. In this paper, we solve the cluster combination ...
In this paper, we solve the cluster combination problem in term of finding a “best” subspace and formulate it as an optimization problem. Then, we get the ...
In this paper, we solve the cluster combination problem in term of finding a "best" subspace and formulate it as an optimization problem. Then, we get the ...
Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg. 2013 p189-195. Type chapter. Stage published. Year 2013.
Sen Xu, Zhenggang Wang, Xianfeng Li, Rui Cao: A Novel Cluster Combination Algorithm for Document Clustering. IScIDE 2012: 189-195.
In this paper, we have developed a novel algorithm which generates number of clusters automatically for any unknown text dataset and clusters the documents ...
Missing: Combination | Show results with:Combination
We propose a novel cluster ensemble method based on a single clustering algorithm (CES). In this method, we iterate a clustering algorithm affinity propagation ...
In this paper, we have developed a novel algorithm which generates number of clusters automatically for any unknown text dataset and clusters the documents ...
People also ask
What is the best algorithm for document clustering?
What are the two document clustering methods?
Detection of clusters in this network requires assistance from other methods ... This paper has proposed a novel ant-based clustering algorithm and its applica-.
A novel non-parametric clustering algorithm based on the concept of divide-and-merge. Ability to discover both convex and non-convex shaped clusters.