Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly aļ¬liated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
In this paper, we propose a framework for isolating text regions from natural scene images. The main algorithm has two functions: it generates text region candidates, and it veriļ...