The week's pick
Random Articles
Reseach Article
A Distance Metric that Combines Linkage, Connectivity and Density Information for Clustering in Image Processing
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 167 - Number 3 |
| Year of Publication: 2017 |
| Authors: Priyanka Khandelwal, Sonal Saxena |
10.5120/ijca2017914226
|
Priyanka Khandelwal, Sonal Saxena . A Distance Metric that Combines Linkage, Connectivity and Density Information for Clustering in Image Processing. International Journal of Computer Applications. 167, 3 ( Jun 2017), 40-44. DOI=10.5120/ijca2017914226
Abstract
Rapid development in Internet technology has generated data at high velocity in large volume and variety. It needs newer methods of analysis. Combining traditional and popular methods with specialized techniques give interesting clustering outputs and are of much use in some real life applications. This paper suggests a new dissimilarity metric to handle complex data. It combines the linkage and density information of data together. Multi-dimensional scaling summarizes the data model based on the proposed distance metric to use it for image processing. The low dimensional model obtained after dimensionality reduction can be easily clustered using standard algorithms.
References
- A. Hinneburg. and D. Keim, “An efficient approach to clustering large multimedia databases with noise”, Proceedings of the 4th ACM SIGKDD Conference, 1998, pp. 58-65.
- A. Rodriguez and A. Laio, “Clustering by fast search and find of density peaks”, Science, Vol. 344, 2014, pp. 1492–1496.
- J. Y. Chen and H. H. He, “A fast density-based data stream clustering algorithm with cluster centers self-determined for mixed data”, Information Sciences, Vol. 345, 2016, pp. 271–293
- A. E. Bayá and P. M. Granitto, “Clustering gene expression data with a penalized graph-based metric”, BMC Bioinformatics, vol. 12, no. 1, 2011.
- A. Strehl and J. Ghosh, “Cluster ensembles: A knowledge reuse framework for combining multiple partitions”, Journal of Machine Learning Research, vol. 3, pp. 583-617, 2002.
- S. Vega-Pons and J. Ruiz-Shulcloper, “Clustering ensemble method for heterogeneous partitions”, eds. E. Bayro-Corrochano and J.-O. Eklundh, Proceedings CIARP 2009, Vol. 5856 of Lecture Notes in Computer Science, 2009, pp. 481-488.
- A. Fred and A. K. Jain, “Combining multiple clusterings using evidence accumulation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 6, 2005, pp. 835–850.
- S. Mika, B. Schölkopf, A. Smola, K-R Müller, M. Scholz, and G. Rätsch, “Kernel PCA and de-noising in feature spaces”, Proceedings Of International Conference On Advances In Neural Information Processing Systems, 1999, pp. 536–542.
- T. F. Cox and M. A. A Cox, Multidimensional scaling (2nd ed.), Chapman & Hall/CRC, 2000.
- E. W. Forgy, “Cluster analysis of multivariate data: efficiency v/s interpretability of classifications”, Biometrics, Vol. 21, 1965, pp. 768–769.
- A. E. Bayá, M. G. Larese and P. M. Granitto, “Clustering using PK-D: A connectivity and density dissimilarity”, Expert Systems with Applications, Vol. 51, pp. 151–160, 2016.
- Y. Lecun and C. Cortes, “The MNIST database of handwritten digits”, 1998. http://yann.lecun.com/exdb/mnist. Accessed June 2015.
- AT&T Labs, “The Olivetti faces dataset”, Cambridge: AT&T Lab, 1992. http://www.cl.cam.ac.uk/research/dtg/attarchive/facedatabase.html. Accessed June 2015.
- F. Alimoglu, “Combining Multiple Classifiers for Pen-Based Handwritten Digit Recognition”, MSc Thesis, Institute of Graduate Studies in Science and Engineering, Bogazici University, 1996.
Index Terms
Keywords