Sciweavers

2424 search results - page 85 / 485
» A general algorithm for data dependence analysis
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
15 years 3 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 3 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
BMCBI
2006
119views more  BMCBI 2006»
15 years 3 months ago
Evaluation of microarray data normalization procedures using spike-in experiments
Background: Recently, a large number of methods for the analysis of microarray data have been proposed but there are few comparisons of their relative performances. By using so-ca...
Patrik Rydén, Henrik Andersson, Mattias Lan...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 3 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
APVIS
2007
15 years 4 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...