Sueko Kanaya

  • Citations Per Year
Learn More
In this paper we present a graph clustering software called DPClus, which we have developed based on a clustering algorithm. The algorithm tends to isolate densely connected regions of a graph as clusters. Users have freedom to choose two input parameters within reasonable range and thus to affect the outcome of the clustering up to certain extent. Though(More)
  • 1