𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for maximal margin clustering

✍ Scribed by Jiming Peng; Lopamudra Mukherjee; Vikas Singh; Dale Schuurmans; Linli Xu

Publisher
Springer US
Year
2011
Tongue
English
Weight
331 KB
Volume
52
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An iterative algorithm learning the maxi
An iterative algorithm learning the maximal margin classifier
✍ VojtΔ›ch Franc; VΓ‘clav HlavÑč πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 444 KB

A simple learning algorithm for maximal margin classiΓΏers (also support vector machines with quadratic cost function) is proposed. We build our iterative algorithm on top of the Schlesinger-Kozinec algorithm (S-K-algorithm) from 1981 which ΓΏnds a maximal margin hyperplane with a given precision for

An efficient clustering algorithm for pa
An efficient clustering algorithm for partitioning parallel programs
✍ Piyush Maheshwari; Hong Shen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled Ε½ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm