𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data clustering with size constraints

✍ Scribed by Shunzhi Zhu; Dingding Wang; Tao Li

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
285 KB
Volume
23
Category
Article
ISSN
0950-7051

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fuzzy clustering with structural constra
Fuzzy clustering with structural constraints
✍ Victor Chepoi; Dan Dumitrescu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 510 KB

In this paper we propose a generalization of the standard clustering problem, which we call Structural Constrained Clustering (SCC) problem. In SCC problem, the cluster interconnections are given by a binary relation R. If this relation is empty then SCC problem reduces to the standard classificatio

Finite data-size scaling of clustering i
Finite data-size scaling of clustering in earthquake networks
✍ Sumiyoshi Abe; Denisse PastΓ©n; Norikazu Suzuki πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 574 KB

An earthquake network is known to be of the small-world type. The values of the network's characteristics, however, depend not only on the cell size (i.e., the scale of coarse graining needed for constructing the network) but also on the size of a seismic data set. Here, discovery of a scaling law f

Binary clustering with missing data
Binary clustering with missing data
✍ Nadif, M. ;Govaert, G. πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 532 KB
Clustering with obstacles for Geographic
Clustering with obstacles for Geographical Data Mining
✍ Vladimir Estivill-Castro; Ickjai Lee πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 381 KB

Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of use