Concepts of the cover coefficient-based clustering methodology

Abstract

Document cLzaste~ng has several unresolved. problems. Among them are high time and space complexity, difficulty of determining similarity thresholds, order dependence, nonuniform document distribution in clusters, and arbitrariness in determination of various cluster initiators. To overcome these problems, to some degree, the cover coefficient based clustering methodology has been introduced. The concepts used in this methodology have created certa/n nezv concepts, relationships, and meavures such as the effect of indexing on clustering, an optimal vocabulary generation for indezing, and a ne~v matching function.These new concepts are discussed. The result of performance experiments that shoe the effectiveness of the clustering methodology. and the matching function are also included. In these experiments, ~t has been also observed that the majority of the documents obtained in a search are concentrated in a fee clusters containing a lozu percentage of documents of the database.

Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases

“…901. ) Property (5) means that, if two documents are identical, then the extent to which they cover each other and themselves are identical.…”