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.

L'autore

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.

Descrizione libreria

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Edward Bowditch Ltd
Exstowe, Exton, Exeter, EX3 0PP, United Kingdom

Condizioni di vendita e spedizione

Condizioni di vendita

Legal entity name: Edward Bowditch Ltd
Legal entity form: Limited company
Business correspondence address: Exstowe, Exton, Exeter, EX3 0PP
Company registration number: 04916632
VAT registration: GB834241546
Authorised representative: Mr. E. Bowditch