Sciweavers

1845 search results - page 159 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
135
Voted
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 2 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
15 years 7 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu
SBIA
2004
Springer
15 years 7 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
100
Voted
IJDAR
2010
110views more  IJDAR 2010»
15 years 5 days ago
Locating and parsing bibliographic references in HTML medical articles
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
Jie Zou, Daniel X. Le, George R. Thoma
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
15 years 6 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén