Další formáty:
BibTeX
LaTeX
RIS
@article{1218660,
author = {Tichý, Lubomír and Chytrý, Milan and BottaandDukát, Zoltán},
article_number = {6},
doi = {http://dx.doi.org/10.1111/jvs.12193},
keywords = {Classification stability; Clustering; Data analysis; k-means; Partitioning around medoids; Phytosociology; Plant community ecology; Vegetation type},
language = {eng},
issn = {1100-9233},
journal = {Journal of Vegetation Science},
title = {Semi-supervised classification of vegetation: preserving the good old units and searching for new ones},
url = {http://onlinelibrary.wiley.com/doi/10.1111/jvs.12193/abstract},
volume = {25},
year = {2014}
}
TY - JOUR
ID - 1218660
AU - Tichý, Lubomír - Chytrý, Milan - Botta-Dukát, Zoltán
PY - 2014
TI - Semi-supervised classification of vegetation: preserving the good old units and searching for new ones
JF - Journal of Vegetation Science
VL - 25
IS - 6
SP - 1504-1512
EP - 1504-1512
PB - Wiley-Blackwell
SN - 11009233
KW - Classification stability
KW - Clustering
KW - Data analysis
KW - k-means
KW - Partitioning around medoids
KW - Phytosociology
KW - Plant community ecology
KW - Vegetation type
UR - http://onlinelibrary.wiley.com/doi/10.1111/jvs.12193/abstract
N2 - Aim: The unsupervised nature of traditional numerical methods used to classify vegetation hinders the development of comprehensive vegetation classification systems. Each new unsupervised classification yields partitions that are partly inconsistent with previous classifications and change group membership for some sites. In contrast, supervised methods account for previously established vegetation units, but cannot define new ones. Therefore, we introduce the concept of semi-supervised classification to community ecology and vegetation science. Semi-supervised classification formally reproduces the existing units in a supervised mode and simultaneously identifies new units among unassigned sites in an unsupervised mode. We discuss the concept of semi-supervised clustering, introduce semi-supervised variants of two clustering algorithms that produce groups with crisp boundaries, k-means and partitioning around medoids (PAM), provide a free software tool to perform these classifications and demonstrate the advantages using example data sets of vegetation plots. Methods: Semi-supervised methods use a priori information about group membership for some sites to define centroids (k-means) or medoids (PAM) of site groups that represent previously established vegetation units. They identify these groups in a species hyperspace and assign new sites to them. At the same time, they search for a user-defined number of new groups. We compared the unsupervised, supervised and semi-supervised methods using an example of a forest vegetation data set that was previously classified using expert knowledge, and assessed how well these methods reproduced vegetation units defined by experts. Then we compared supervised and semi-supervised methods in a task when a grassland vegetation classification established in one country was extended to two neighbouring countries. Results and conclusions: Example analyses of vegetation plot data sets demonstrated that semi-supervised variants of k-means and PAM are extremely valuable tools for extending existing vegetation classifications while preserving previously defined vegetation units. They can be used both for identifying so far unrecognized vegetation types in the regions where a vegetation classification already exists and for extending a vegetation classification from a particular region to neighbouring regions with partly identical but partly different vegetation types. Both k-means and PAM provide site groups with crisp boundaries, which makes them a simpler alternative to fuzzy clustering methods.
ER -
TICHÝ, Lubomír, Milan CHYTRÝ a Zoltán BOTTA-DUKÁT. Semi-supervised classification of vegetation: preserving the good old units and searching for new ones. \textit{Journal of Vegetation Science}. Wiley-Blackwell, 2014, roč.~25, č.~6, s.~1504-1512. ISSN~1100-9233. Dostupné z: https://dx.doi.org/10.1111/jvs.12193.
|
