SUMMARYWe propose a parallelization scheme for an existing algorithm for constructing a web-directory, that contains categories of web documents organized hierarchically. The clustering algorithm automatically infers the number of clusters using a quality function based on graph cuts. A parallel implementation of the algorithm has been developed to run on a cluster of multi-core processors interconnected by an intranet. The effect of the well-known Latent Semantic Indexing on the performance of the clustering algorithm is also considered. The parallelized graph-cut based clustering algorithm achieves an F-measure in the range OE0:69; 0:91 for the generated leaf-level clusters while yielding a precision-recall performance in the range OE0:66; 0:84 for the entire hierarchy of the generated clusters. As measured via empirical observations, the parallel algorithm achieves an average speedup of 7.38 over its sequential variant, at the same time yielding a better clustering performance than the sequential algorithm in terms of F-measure.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.