Sciweavers

376 search results - page 25 / 76
» Approximating Probability Distributions Using Small Sample S...
Sort
View
ILP
2004
Springer
14 years 1 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
SDM
2011
SIAM
223views Data Mining» more  SDM 2011»
12 years 10 months ago
Characterizing Uncertain Data using Compression
Motivated by sensor networks, mobility data, biology and life sciences, the area of mining uncertain data has recently received a great deal of attention. While various papers hav...
Francesco Bonchi, Matthijs van Leeuwen, Antti Ukko...
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 8 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
CIKM
2008
Springer
13 years 9 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
ALT
2008
Springer
14 years 4 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