An Enhanced Projected Clustering Algorithm for High Dimensional Space
R.Aggarwal, J.Gehrke, D.Gunopulos and P.Raghavan, “Automatic Subspace Clustering of High Dimensional Data,” Data Mining and Knowledge Discovery, vol.11, no.1, pp.5-33, 2005.
C.C.Aggarwal, C.Procopuic, J.L.Wolf, P.S.Yu, and J.S.Park, “Fast Algorithm for Projected Clustering,” Proceeding of ACM SIGMOD ’99, pp.61-72, 1999.
K.Y.L.Yip, D.W.Cheng,and M.K.Ng, “On Discovery of Extremely Low Dimensional Clusters Using Semi-Supervised Projected Clustering,”, Proceedings of 21st International Conference in Data Engineering(ICDE ’05) pp.329-340, 2005.
C.C.Aggarwal and P.S.Yu, “Redefining Clustering For High Dimensional Applications”, IEEE Transactions on Knowledge and Data Engineering, vol.14, no.2, pp. 210-225, Mar./Apr.2002.
K.Y.L.Yip, D.W.Cheng, and M.K.Ng, “HARP: A Practical Projected Clustering Algorithm,” IEEE Transactions on Knowledge and Data Engineering, vol.16, no.11, pp.1387-1397, Nov.2004.
C.M.Procopuic, M.Jones, P.K.Aggarwal, and T.M.Murali, “Monte Carlo Algorithm For Fast Projective Clustering,” Proceedings of ACM SIGMOD ’02, pp.418-427, 2002.
M.Ling and N.Mamoulis, “Iterative Projected Clustering by Subspace Mining,”, IEEE Transactions on Knowledge and Data Engineering, vol.17, no.2, pp.176-189, Feb.2005.
E.K.K.Ng, A.W.Fu, and R.C.Wong, “Projective Clustering by Histograms,” IEEE Transactions on Knowledge and Data Engineering, vol.17, no.3, pp.369-383, Mar.2005.
J.Han and M.Kamber, Data Mining, Concepts and Techniques .Morgan Kaufman, 2001.
A.Patrikainen and M.Meila, “Comparing Subspace Clusterings,” IEEE Transactions on Knowledge and Data Engineering, vol.18, no.7, pp.902- 916, Jul.2006.
Mohammed Bouguessa and Shengrui Wang, “Mining Projected Clusters in High-Dimensional Spaces”, IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 507 – 522, April 2009.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.