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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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)
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783659454745
Quantità: 2 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783659454745
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Condizione: 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. Codice articolo 5157137
Quantità: Più di 20 disponibili
Da: Books Puddle, Woodside, NY, U.S.A.
Condizione: New. Codice articolo 26405873175
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand. Codice articolo 407281096
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND. Codice articolo 18405873181
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 148 pp. Englisch. Codice articolo 9783659454745
Quantità: 1 disponibili
Da: preigu, Osnabrück, Germania
Taschenbuch. Condizione: Neu. Clustering Algorithms for Biological Data | Damodar Reddy Edla (u. a.) | Taschenbuch | 148 S. | Englisch | 2013 | LAP LAMBERT Academic Publishing | EAN 9783659454745 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 105618636
Quantità: 5 disponibili