Now showing items 1-2 of 2

    • Thumbnail

      Avoiding objects with few neighbors in the K-Means process and adding ROCK Links to its distance

      Alnabriss, Hadi A; Ashour, Wesam M. (International Journal of Computer Applications, 244 5 th Avenue,# 1526, New York, NY 10001, USA India, 2011)
      K-means is considered as one of the most common and powerful algorithms in data clustering, in this paper we're going to present new techniques to solve two problems in the K-means traditional clustering algorithm, the 1st ...
    • Thumbnail

      EOPTICS “Enhancement Ordering Points to Identify the Clustering Structure”

      Alzaalan, Mahmoud; Aldahdooh, Raed T; Ashour, Wesam M. (International Journal of Computer Applications, 244 5 th Avenue,# 1526, New York, NY 10001, USA India, 2012)
      Grouping a set of physical or abstract objects into classes of similar objects is a process of clustering. Clustering is very important technique in statistical data analysis. Among the clustering methods, density-based ...