Sciweavers

185 search results - page 6 / 37
» A Simple Min Cut Algorithm
Sort
View
ICCS
2005
Springer
14 years 1 months ago
A Multi-level Approach for Document Clustering
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
Suely Oliveira, Sang-Cheol Seok
CIMCA
2005
IEEE
14 years 1 months ago
Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms
This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three ge...
Jinghui Zhong, Xiaomin Hu, Jun Zhang, Min Gu
DAGM
2008
Springer
13 years 9 months ago
Simple Incremental One-Class Support Vector Classification
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
Kai Labusch, Fabian Timm, Thomas Martinetz
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...