Sciweavers

2277 search results - page 344 / 456
» Clustering by pattern similarity in large data sets
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
16 years 3 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
NIPS
2004
15 years 7 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
BMCBI
2005
163views more  BMCBI 2005»
15 years 6 months ago
Rank-invariant resampling based estimation of false discovery rate for analysis of small sample microarray data
Background: The evaluation of statistical significance has become a critical process in identifying differentially expressed genes in microarray studies. Classical p-value adjustm...
Nitin Jain, HyungJun Cho, Michael O'Connell, Jae K...
BCB
2010
166views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...
DCC
2007
IEEE
16 years 6 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...