256 search results - page 36 / 52 » A practical comparison of two K-Means clustering algorithms |
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
106
click to vote
PRL
2008
14 years 11 months ago
2008
In recent years, relevance feedback has been studied extensively as a way to improve performance of content-based image retrieval (CBIR). Since users are usually unwilling to prov...
111
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: Data mining in large DNA sequences is a major challenge in microbial genomics and bioinformatics. Oligonucleotide usage (OU) patterns provide a wealth of information f...
104
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
CIS
2007
Springer
15 years 5 months ago
2007
Springer
—Real-world data mining deals with noisy information sources where data collection inaccuracy, device limitations, data transmission and discretization errors, or man-made pertur...