With the recent advances of data generation and acquisition systems and the success of several projects such as Human Genome, a large number of databases, especially in biological field are now available worldwide. The growing rate of such databases is also exponential. There is a need to explore and analyze such massive data to infer some inherent information. Clustering has been recognized as one of the widely used data mining techniques which is essential for data analysis to reveal natural structures and to identify interesting patterns in the underlying data. In the last decade, significant amount of research work has been carried out on cluster analysis and a large number of algorithms have been developed, particularly for biological data. Recently, much attention has been paid to develop various clustering algorithms based on neighborhood graphs such as minimum spanning tree (MST), Voronoi diagram and kd-trees. In this book, we mainly report on the hierarchical, partitional, density-based and graph-based clustering algorithms which are developed using such neighborhood graphs.
"Sinopsis" puede pertenecer a otra edición de este libro.
With the recent advances of data generation and acquisition systems and the success of several projects such as Human Genome, a large number of databases, especially in biological field are now available worldwide. The growing rate of such databases is also exponential. There is a need to explore and analyze such massive data to infer some inherent information. Clustering has been recognized as one of the widely used data mining techniques which is essential for data analysis to reveal natural structures and to identify interesting patterns in the underlying data. In the last decade, significant amount of research work has been carried out on cluster analysis and a large number of algorithms have been developed, particularly for biological data. Recently, much attention has been paid to develop various clustering algorithms based on neighborhood graphs such as minimum spanning tree (MST), Voronoi diagram and kd-trees. In this book, we mainly report on the hierarchical, partitional, density-based and graph-based clustering algorithms which are developed using such neighborhood graphs.
Dr. Damodar Reddy Edla is an Asst. Professor in the department of Computer Science & Engineering, National Institute of Technology Goa, India. Dr. Prasanta K. Jana is a Professor and Head of the department of Computer Science & Engineering, Indian School of Mines, Dhanbad, India. Prof. Jana is a Senior Member of IEEE, USA (August 2009-May 2013)
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoLibrería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -With the recent advances of data generation and acquisition systems and the success of several projects such as Human Genome, a large number of databases, especially in biological field are now available worldwide. The growing rate of such databases is also exponential. There is a need to explore and analyze such massive data to infer some inherent information. Clustering has been recognized as one of the widely used data mining techniques which is essential for data analysis to reveal natural structures and to identify interesting patterns in the underlying data. In the last decade, significant amount of research work has been carried out on cluster analysis and a large number of algorithms have been developed, particularly for biological data. Recently, much attention has been paid to develop various clustering algorithms based on neighborhood graphs such as minimum spanning tree (MST), Voronoi diagram and kd-trees. In this book, we mainly report on the hierarchical, partitional, density-based and graph-based clustering algorithms which are developed using such neighborhood graphs. 148 pp. Englisch. Nº de ref. del artículo: 9783659454745
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Edla Damodar ReddyDr. Damodar Reddy Edla is an Asst. Professor in the department of Computer Science & Engineering, National Institute of Technology Goa, India. Dr. Prasanta K. Jana is a Professor and Head of the department of Co. Nº de ref. del artículo: 5157137
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - With the recent advances of data generation and acquisition systems and the success of several projects such as Human Genome, a large number of databases, especially in biological field are now available worldwide. The growing rate of such databases is also exponential. There is a need to explore and analyze such massive data to infer some inherent information. Clustering has been recognized as one of the widely used data mining techniques which is essential for data analysis to reveal natural structures and to identify interesting patterns in the underlying data. In the last decade, significant amount of research work has been carried out on cluster analysis and a large number of algorithms have been developed, particularly for biological data. Recently, much attention has been paid to develop various clustering algorithms based on neighborhood graphs such as minimum spanning tree (MST), Voronoi diagram and kd-trees. In this book, we mainly report on the hierarchical, partitional, density-based and graph-based clustering algorithms which are developed using such neighborhood graphs. Nº de ref. del artículo: 9783659454745
Cantidad disponible: 1 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -With the recent advances of data generation and acquisition systems and the success of several projects such as Human Genome, a large number of databases, especially in biological field are now available worldwide. The growing rate of such databases is also exponential. There is a need to explore and analyze such massive data to infer some inherent information. Clustering has been recognized as one of the widely used data mining techniques which is essential for data analysis to reveal natural structures and to identify interesting patterns in the underlying data. In the last decade, significant amount of research work has been carried out on cluster analysis and a large number of algorithms have been developed, particularly for biological data. Recently, much attention has been paid to develop various clustering algorithms based on neighborhood graphs such as minimum spanning tree (MST), Voronoi diagram and kd-trees. In this book, we mainly report on the hierarchical, partitional, density-based and graph-based clustering algorithms which are developed using such neighborhood graphs.Books on Demand GmbH, Überseering 33, 22297 Hamburg 148 pp. Englisch. Nº de ref. del artículo: 9783659454745
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 148 pages. 8.66x5.91x0.34 inches. In Stock. Nº de ref. del artículo: __3659454745
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 148 pages. 8.66x5.91x0.34 inches. In Stock. Nº de ref. del artículo: 3659454745
Cantidad disponible: 1 disponibles