Sciweavers

6 search results - page 1 / 2
» A Coincidence-Based Test for Uniformity Given Very Sparsely ...
Sort
View
IDA
2002
Springer
13 years 5 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
BMCBI
2005
113views more  BMCBI 2005»
13 years 5 months ago
Normal uniform mixture differential gene expression detection for cDNA microarrays
Background: One of the primary tasks in analysing gene expression data is finding genes that are differentially expressed in different samples. Multiple testing issues due to the ...
Nema Dean, Adrian E. Raftery
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 5 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
ALT
2008
Springer
14 years 2 months ago
Nonparametric Independence Tests: Space Partitioning and Kernel Approaches
Abstract. Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-...
Arthur Gretton, László Györfi