Sciweavers

37 search results - page 1 / 8
» Automatic Cluster Number Selection Using a Split and Merge K...
Sort
View
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
13 years 11 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
ICASSP
2011
IEEE
12 years 8 months ago
An adaptive bayesian clustering and multivariate region merging based technique for efficient segmentation of color images
We propose a methodology for improved segmentation of images in a Bayesian framework by fusion of color, texture and gradient information. The proposed algorithm is initialized by...
Sreenath Rao Vantaram, Eli Saber
BMCBI
2010
164views more  BMCBI 2010»
13 years 2 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
ADMA
2007
Springer
106views Data Mining» more  ADMA 2007»
13 years 11 months ago
Topic Extraction with AGAPE
This paper uses an optimization approach to address the problem of conceptual clustering. The aim of AGAPE, which is based on the tabu-search meta-heuristic using split, merge and ...
Julien Velcin, Jean-Gabriel Ganascia
ICPR
2008
IEEE
13 years 11 months ago
Multi-stage branch-and-bound for maximum variance disparity clustering
A split-and-merge framework based on a maximum variance criterion is proposed for disparity clustering. The proposed algorithm transforms low-level stereo disparity information to...
Ninad Thakoor, Venkat Devarajan, Jean Gao