The week's pick
Random Articles
Reseach Article
EOPTICS "Enhancement Ordering Points to Identify the Clustering Structure"
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 40 - Number 17 |
| Year of Publication: 2012 |
| Authors: Mahmoud E. Alzaalan, Raed T. Aldahdooh, Wesam Ashour |
10.5120/5069-7130
|
Mahmoud E. Alzaalan, Raed T. Aldahdooh, Wesam Ashour . EOPTICS "Enhancement Ordering Points to Identify the Clustering Structure". International Journal of Computer Applications. 40, 17 ( February 2012), 1-6. DOI=10.5120/5069-7130
Abstract
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 methods are critical because of their ability to recognize clusters with arbitrarily shape. In particular, OPTICS density-based method is an improvement upon DBSCAN. It addresses the major DBSCAN's weakness, which is the problem of detecting clusters in data of varying density. OPTICS defines the core distance which is the shortest distance from the core that contains the minimum number of points. Those points within the radius of the core distance may contain points far from the core than all the other points located within the same core distance. This algorithm computes the mean distance among the points within the core distance and the core itself and the resulting distance is considered as the new core distance.
References
- J. Han, M. Kamber, 2001. Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco, CA, pp. 335–391.
- Ankerst M., Breunig M., Kriegel H.-P., Sander J, 99. OPTICS: Ordering Points To Identify the Clustering Structure.
- J. Han, M. Kamber, 2001. Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco, CA, pp. 335–391.
- J. MacQueen, 1967. Some methods for classi?cation and analysis of multivariate observations, in: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297.
- H. Vinod, 1969. Integer programming and the theory of grouping, Journal of the American Statistical Association vol. 64, pp. 506–519.
- T. Zhang, R. Ramakrishnan, M. Linvy, 1996. BIRCH: an e?cient data clustering method for very large databases, in: Proceeding ACM SIGMOD International Conference on Management of Data, pp. 103–114.
- S. Guha, R. Rastogi, K. Shim, 1998. CURE: an e?cient clustering algorithms for large databases, in: Proceeding ACM SIGMOD International Conference on Management of Data, Seattle, WA, pp. 73–84.
- W. Wang, J. Yang, R. Muntz, 1997. STING: a statistical information grid approach to spatial data mining, in: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB), pp. 186–195.
- R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan,98. Automatic subspace clustering of high dimensional data for data mining applications.
- G. Sheikholeslami, S. Chatterjee, A. Zhang, 1998. WaveCluster: a multi-resolution clustering approach for very large spatial databases, in: Proceedings of International Conference on Very Large Databases (VLDB’98), New York, USA, pp. 428–439.
- D. Fisher, 1987. Knowledge acquisition via incremental conceptual clustering, Machine Learning.
- Martin Ester, Hans-Peter Kriegel,1996. “A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”.
- A. Hinneburg, D.A. Keim, 1998. An e?cient approach to clustering in large multimedia databases with noise, in: Proceedings of 4th International Conference on Knowledge Discovery and Data Mining, New York City, NY, pp. 58–65.
- S. Ma, T.J. Wang, S.W. Tang, D.Q. Yang, J. Gao, A new fast clustering algorithm based on reference and density, in: Proceedings of WAIM, Lectures Notes in Computer Science, 2762, Springer, 2003, pp. 214–225.
- S. Roy, D.K, 2005.Bhattacharyya, an approach to ?nd embe9ed clusters using density based techniques, in: Proceedings of the ICDCIT, Lecture Notes in Computer Science, vol. 3816, pp. 523–535.
- X. Chen, Y. Min, Y. Zhao, P. Wang, 2008.GMDBSCAN: multi-density DBSCAN cluster based on grid, in: IEEE International Conference on E-Business Engineering, pp. 780–783.
- L. Duan, L. Xu, F. Guo, J. Lee, B. Yan, 2007. A local-density based spatial clustering algorithm with noise, Information Systems 32
- S. Gao, Y. Xia, 2006. A grid-based density-con?dence-interval clustering algorithm for multi-density dataset in large spatial database, in: International Conference on Intelligent Systems Design and Applications, vol. 1, pp. 713–717.
- S. Zhou, Y. Zhao, J. Guan, Z. Huang, 2005. A neighborhood-based clustering algorithm, in: Ninth Paci?c-Asia Conference on Knowledge Discovery and Data Mining, Springer Press, Hanoi, , pp. 361–371.
- N. Beckmann, H-P. Kriegel, R. Schneider, B. Seeger, 1990. The R*-tree: an ef?cient and robust access method for points and rectangles, International Conference on Management of data ACM SIGMOD’90, pp. 322–331.
Index Terms
Keywords