Sciweavers

2383 search results - page 2 / 477
» Finding Representative Set from Massive Data
Sort
View
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 5 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 15 days ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
BMCBI
2006
119views more  BMCBI 2006»
13 years 5 months ago
Utilization of two sample t-test statistics from redundant probe sets to evaluate different probe set algorithms in GeneChip stu
Background: The choice of probe set algorithms for expression summary in a GeneChip study has a great impact on subsequent gene expression data analysis. Spiked-in cRNAs with know...
Zihua Hu, Gail R. Willsky
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
14 years 4 days ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...
CVPR
2012
IEEE
11 years 8 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...