Abstract We propose two new algorithms for clustering graphs and networks. The first, called K?algorithm , is derived directly from the k -means algorithm. It applies similar iterative local optimization but without need to calculate means. inherits properties of in terms both good capability tendency get stuck at a optimum. second algorithm, M-algorithm gradually improves on results K -algorit...

-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...