Gruber, Peter and Theis, Fabian J. (2006) Grassmann clustering. In: (Proceedings of ) EUSIPCO 2006: 14th European Signal Processing Conference; September 4 - 8, Florence, Italy. CD-ROM. Piscataway, NJ.
Full text not available from this repository.
An important tool in high-dimensional, explorative data mining is given by clustering methods. They aim at identifying samples or regions of similar characteristics, and often code them by a single codebook vector or centroid. One of the most commonly used partitional clustering techniques is the k-means algorithm, which in its batch form partitions the data set into k disjoint clusters by simply ...
Export bibliographical data
|Item type:||Book section|
|Institutions:||Biology, Preclinical Medicine > Institut für Biophysik und physikalische Biochemie > Prof. Dr. Elmar Lang|
|Dewey Decimal Classification:||500 Science > 570 Life sciences|
|Created at the University of Regensburg:||Unknown|
|Deposited on:||13 Oct 2010 05:48|
|Last modified:||13 Oct 2010 05:48|