Sciweavers

63 search results - page 10 / 13
» Constrained Ant Colony Optimization for Data Clustering
Sort
View
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
16 years 9 days ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson
ICASSP
2010
IEEE
14 years 12 months ago
Maximizing the lifetime of clusters with Slepian-Wolf coding
In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster ...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
ECCV
2010
Springer
15 years 2 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
EMMCVPR
2005
Springer
15 years 5 months ago
Optimizing the Cauchy-Schwarz PDF Distance for Information Theoretic, Non-parametric Clustering
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
82
Voted
BMCBI
2008
111views more  BMCBI 2008»
14 years 12 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...