Sciweavers

2001 search results - page 348 / 401
» An Update on Generalized Information Theory
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 9 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
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 9 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
CHI
2004
ACM
14 years 9 months ago
Older adults and web usability: is web experience the same as web expertise?
Level of Web experience is often a factor for which researchers attempt to control while conducting experimental studies on Web usability. It is typically measured by some means o...
Ann Chadwick-Dias, Donna P. Tedesco, Thomas S. Tul...
POPL
2008
ACM
14 years 9 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen