A new approach to clustering data with arbitrary shapes
โ Scribed by Mu-Chun Su; Yi-Chun Liu
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 900 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In solving clustering problem, traditional methods, for example, the K-means algorithm and its variants, usually ask the user to provide the number of clusters. Unfortunately, the number of clusters in general is unknown to the user. The traditional neighborhood clustering algorithm usually needs th
Each amino acid is represented by a vector of numerical measurements for the attributes of volume, area, hydrophilicity, polarity, hydrogen bonding, shape, and charge. Inter-residue distances are then calculated according to common metrics, and we introduce a new clustering objective function derive
## Abstract In this article, we develop a new method for image matching of any two images with arbitrary orientations. The idea comes from the workpiece localization in machining industry. We first describe an image as a 3D point set other than the common 2D function __f__(__x, y__), then, making t