Implementation of Space Optimized Bisecting K-Means (BKM) Based on Hadoop

This article is composed in the background of the study of scientific field of coauthors phenomenon factual basis. By the study of massive amounts of relational data, it provides us with major significances theoretically and practically on retrieving and obtaining professionally academic information and getting knowing of academic development trend of miscellaneous fields. In process of studying this type of project, the problem of cluttering for coauthors that are in the data is involved. However, it is hard to meet the need of implementing the analysis of massive amounts of data cluttering by the existing cluttering software and algorithms, for this reason, finding an approach to deal with this kind of question is toughly important. To solve this question, this article presents an optimized Bisecting K-Means (BKM) clustering algorithm based on Hadoop and states the fashion of how to optimize the algorithm and the key point of implementing in details after analyzing the status quo related to this study. Estimating the complexity of the algorithm by experiments indicates the current problems and the direction for the future study.