Sciweavers

440 search results - page 52 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
12 years 3 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Semi-Supervised Learning Based on Semiparametric Regularization
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many...
Zhen Guo, Zhongfei (Mark) Zhang, Eric P. Xing, Chr...
TNN
2008
181views more  TNN 2008»
13 years 8 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
CIKM
2010
Springer
13 years 6 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen