Sciweavers

888 search results - page 136 / 178
» Learning to Select a Ranking Function
Sort
View
COLT
2008
Springer
13 years 9 months ago
Relating Clustering Stability to Properties of Cluster Boundaries
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
Shai Ben-David, Ulrike von Luxburg
DAC
2003
ACM
14 years 9 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...
TNN
2008
181views more  TNN 2008»
13 years 7 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
ECAGENTS
2001
Springer
127views ECommerce» more  ECAGENTS 2001»
14 years 13 days ago
User-Centered Agents for Structured Information Location
Abstract. This paper designs an electronic commerce system that integrates conventional electronic commerce services with contemporary WWW advantages, such as comprehensive coverag...
Xindong Wu, Daniel Ngu, Sameer Pradhan
CIKM
2011
Springer
12 years 8 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke