17 search results - page 3 / 4 » Using the OLS Algorithm to Build Interpretable Rule Bases: A... |
AI
2011
Springer
12 years 12 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
WEBDB
2010
Springer
13 years 10 months ago
2010
Springer
The transition of search engine usersā intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how diļ...
MLDM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classiļ¬er. M...
ICCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...