Sciweavers

28888 search results - page 5465 / 5778
» Computability and complexity in analysis
Sort
View
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 4 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
16 years 4 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
CHI
2008
ACM
16 years 4 months ago
Optimal parameters for efficient crossing-based dialog boxes
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...
Morgan Dixon, François Guimbretière,...
CHI
2008
ACM
16 years 4 months ago
LivOlay: interactive ad-hoc registration and overlapping of applications for collaborative visual exploration
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...
« Prev « First page 5465 / 5778 Last » Next »