Sciweavers

174 search results - page 14 / 35
» How efficient is estimation with missing data
Sort
View
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 8 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
WCE
2007
13 years 9 months ago
A Dynamic Method for the Evaluation and Comparison of Imputation Techniques
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Estimating the uncertainty inherent ...
Norman Solomon, Giles Oatley, Kenneth McGarry
ICML
1994
IEEE
13 years 11 months ago
Efficient Algorithms for Minimizing Cross Validation Error
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
Andrew W. Moore, Mary S. Lee
NN
1998
Springer
13 years 7 months ago
Statistical estimation of the number of hidden units for feedforward neural networks
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
Osamu Fujita