Mining of high dimensional data using enhanced clustering approach

  • Authors

    • S Sivakumar
    • Kumar Narayanan
    • Swaraj Paul Chinnaraju
    • Senthil Kumar Janahan
    2018-04-20
    https://doi.org/10.14419/ijet.v7i2.21.12384
  • .

  • Abstract

    Extraction of useful data from a set is known as Data mining. Clustering has top information mining process it supposed to help an individual, divide and recognize numerous data from records inside group consistent with positive similarity measure. Clustering excessive dimensional data has been a chief undertaking. Maximum present clustering algorithms have been inefficient if desired similarity is computed among statistics factors inside the complete dimensional space. Varieties of projected clustering algorithms were counseled for addressing those problems. However many of them face problems whilst clusters conceal in some space with low dimensionality. These worrying situations inspire our system to endorse a look at partitional distance primarily based projected clustering set of rules. The aimed paintings is successfully deliberate for projects clusters in excessive huge dimension space via adapting the stepped forward method in k Mediods set of pointers. The main goal for second one gadget is to take away outliers, at the same time as the 1/3 method will find clusters in numerous spaces. The (clustering) technique is based on the adequate Mediods set of guidelines, an excess distance managed to set of attributes everywhere values are dense.

  • References

    1. [1] Agrawal R, Gehrke J, Gunopulos D & Raghavan P, “Automatic Subspace Clustering of High Dimensional Dataâ€, Data Mining and Knowledge Discovery, Vol.11, No.1, (2005), pp.5-33.

      [2] Liu H & Yu L, “Toward Integrating Feature Selection Algorithms for Classification and Clusteringâ€, IEEE Trans. Knowledge and Data Eng., Vol.17, No.4, (2005), pp.491-502.

      [3] Yip KYL, Cheng DW & Ng MK, “On Discovery of Extremely Low-Dimensional Clusters Using Semi-Supervised Projected Clusteringâ€, Proc. 21st Int’l Conf. Data Eng, (2005), pp. 329-340.

      [4] Lung M & Mamoulis N, “Iterative Projected Clustering by Subspace Miningâ€, IEEE Trans. Knowledge and Data Eng., Vol.17, No.2, (2005), pp.176-189.

      [5] Bouguessa M, Wang S & Jiang Q, “A K-Means-Based Algorithm for Projective Clusteringâ€, Proc. 18th IEEE Int’l Conf. Pattern Recognition, (2006), pp.888-891.

      [6] Bouguessa M, Wang S & Sun H, “An Aim Approach to Cluster Validationâ€, Pattern Recognition Letters, Vol.27, No.13, (2006), pp.1419-1430.

      [7] Angiulli F & Pizzuti C, “Outlier Mining in Large High- Dimensional Data Setsâ€, IEEE Trans. Knowledge and Data Eng., Vol.17, No.2, (2005), pp.369-383.

      [8] Li T, “A Unified View on Clustering Binary Dataâ€, Machine Learning, Vol.62, No.3, (2006), pp.199-215.

      [9] Patrikainen A & Meila M, “Comparing Subspace Clusteringsâ€, IEEE Trans. Knowledge and Data Eng., Vol.18, No.7, (2006), pp.902-916.

      [10] Tjaden B, “An Approach for Clustering Gene Expression Data with Error Informationâ€, BMC Bioinformatics, Vol.7, No.17, (2006).

      Doherty KAJ, Adams RG & Davey N, “Unsupervised Learning with Normalized Data and Non-Euclidean Normsâ€, Applied Soft Computing, Vol.7, No.17, (2007), pp.203-210

  • Downloads

  • How to Cite

    Sivakumar, S., Narayanan, K., Paul Chinnaraju, S., & Kumar Janahan, S. (2018). Mining of high dimensional data using enhanced clustering approach. International Journal of Engineering & Technology, 7(2.21), 291-295. https://doi.org/10.14419/ijet.v7i2.21.12384

    Received date: 2018-05-03

    Accepted date: 2018-05-03

    Published date: 2018-04-20