256 search results - page 28 / 52 » A practical comparison of two K-Means clustering algorithms |
122
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
115
click to vote
MCS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
BPM
2009
Springer
15 years 7 months ago
2009
Springer
The goal of performance analysis of business processes is to gain insights into operational processes, for the purpose of optimizing them. To intuitively show which parts of the pr...
108
click to vote
ACIVS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this paper, we introduce a novel evolution-based segmentation algorithm by using the heat flow analogy, to gain practical advantage. The proposed algorithm consists of...
107
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...