Resumen
Clustering has been widely used in areas as Pattern Recognition, Data Analysis and Image Processing. Recently, clustering algorithms have been recognized as one of a powerful tool for Data Mining. However, the well-known clustering algorithms offer no solution to the case of Large Mixed Incomplete Data Sets. In this paper we comment the possibilities of application of the methods, techniques and philosophy of the Logical Combinatorial approach for clustering in these kinds of data sets. We present the new clustering algorithm DGLC for discovering β0-density connected components from large mixed incomplete data sets. This algorithm combines the ideas of Logical Combinatorial Pattern Recognition with the Density Based Notion of Cluster. Finally, an example is showed in order to illustrate the work of the algorithm.
Idioma original | Inglés |
---|---|
Páginas | 2846-2848 |
Número de páginas | 3 |
Estado | Publicada - 2000 |
Publicado de forma externa | Sí |
Evento | 2000 International Geoscience and Remote Sensing Symposium (IGARSS 2000) - Honolulu, HI, USA Duración: 24 jul. 2000 → 28 jul. 2000 |
Conferencia
Conferencia | 2000 International Geoscience and Remote Sensing Symposium (IGARSS 2000) |
---|---|
Ciudad | Honolulu, HI, USA |
Período | 24/07/00 → 28/07/00 |