Classification is one of the core topics in data mining technologies. This paper studies the geometry of classifying convex clusters based on support functionals in the dual spaces. For the convex clusters that are to be classified, a combination of linear discriminant functions could solve the problem. The geometrical depiction of linear discriminant functions and supporting hyperplanes for the convex clusters help to characterize the relations of the convex clusters, and the distances to the convex clusters and complement of convex clusters calibrate the measures between the support functionals and convex clusters. Examples are given. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Liang, X. (2005). Mathematical analysis of classifying convex clusters based on support functionals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3584 LNAI, pp. 761–768). Springer Verlag. https://doi.org/10.1007/11527503_90
Mendeley helps you to discover research relevant for your work.