Abstract
Clustering techniques aim at partitioning a given set of data into clusters. Chapter 3 presents the basic k-means approach and many variants to the standard algorithm. All these algorithms search for an optimal partition in clusters of a given set of samples. The number of clusters is usually denoted by the symbol k. As previously discussed in Chapter 3, each cluster is usually labeled with an integer number ranging from 0 to k- 1. Once a partition is available for a certain set of samples, the samples can then be sorted by the label of the corresponding cluster in the partition. If a color is then assigned to the label, a graphic visualization of the partition in clusters is obtained. This kind of graphic representation is used often in two-dimensional spaces for representing partitions found with biclustering methods.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Mucherino, A., Papajorgji, P.J., Pardalos, P.M. (2009). Biclustering. In: Data Mining in Agriculture. Springer Optimization and Its Applications, vol 34. Springer, New York, NY. https://doi.org/10.1007/978-0-387-88615-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-88615-2_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-88614-5
Online ISBN: 978-0-387-88615-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)