Sciweavers

1541 search results - page 146 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
ISBRA
2009
Springer
14 years 3 months ago
Mean Square Residue Biclustering with Missing Data and Row Inversions
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
Stefan Gremalschi, Gulsah Altun, Irina Astrovskaya...
HT
2010
ACM
13 years 10 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
14 years 3 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen
SIGIR
2008
ACM
13 years 8 months ago
EigenRank: a ranking-oriented approach to collaborative filtering
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...
Nathan Nan Liu, Qiang Yang