Sciweavers

6575 search results - page 1216 / 1315
» Specializing visualization algorithms
Sort
View
WWW
2006
ACM
14 years 8 months ago
Searching with context
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi...
WWW
2005
ACM
14 years 8 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
KDD
2007
ACM
156views Data Mining» more  KDD 2007»
14 years 8 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 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
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 8 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
« Prev « First page 1216 / 1315 Last » Next »