Sciweavers

2245 search results - page 186 / 449
» Metrics that Learn Relevance
Sort
View
98
Voted
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 21 days ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
123
Voted
ECIR
2009
Springer
15 years 10 months ago
Active Sampling for Rank Learning via Optimizing the Area under the ROC Curve
Abstract. Learning ranking functions is crucial for solving many problems, ranging from document retrieval to building recommendation systems based on an individual user’s prefer...
Pinar Donmez, Jaime G. Carbonell
116
Voted
WISE
2007
Springer
15 years 7 months ago
Learning Implicit User Interests Using Ontology and Search History for Personalization
Abstract. The key for providing a robust context for personalized information retrieval is to build a library which gathers the long term and the short term user’s interests and ...
Mariam Daoud, Lynda Tamine, Mohand Boughanem, Bila...
81
Voted
SIGIR
2003
ACM
15 years 6 months ago
A maximal figure-of-merit learning approach to text categorization
A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integ...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
90
Voted
DAGM
1995
Springer
15 years 4 months ago
Learning Weights in Discrimination Functions Using a priori Constraints
We introduce a learning algorithm for the weights in a very common class of discrimination functions usually called weighted average". Di erent submodules are produced by som...
Norbert Krüger