We investigate why discretization is effective in naive-Bayes learning. We prove a theorem that identifies particular conditions under which discretization will result in naiveBay...
Hidden markov models (HMMs) and prediction by partial matching models (PPM) have been successfully used in language processing tasks including learning-based token identification. ...
This paper introduces a new method for the rapid development of complex rule bases involving cue phrases for the purpose of classifying text segments. The method is based on Ripple...
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Behavior-based artificial intelligent system is to derive the complicated behaviors by selecting appropriate one from a set of basic behaviors. Many robot systems have used behavi...
RoboCup is an international robot soccer competition that has been running since 1997. A frequent criticism of any such competition is that all of a team’s development is narrowl...
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...