Sciweavers

2004 search results - page 13 / 401
» Sampling from large graphs
Sort
View
JMLR
2012
13 years 2 months ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 11 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
BMCBI
2006
93views more  BMCBI 2006»
14 years 11 months ago
A summarization approach for Affymetrix GeneChip data using a reference training set from a large, biologically diverse database
Background: Many of the most popular pre-processing methods for Affymetrix expression arrays, such as RMA, gcRMA, and PLIER, simultaneously analyze data across a set of predetermi...
Simon Katz, Rafael A. Irizarry, Xue Lin, Mark Trip...
JACM
2012
13 years 2 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 5 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...