Abstract. We present the Acyclic Bayesian Net Generator, a new approach to learn the structure of a Bayesian network using genetic algorithms. Due to the encoding mechanism, acycli...
Abstract. We introduce a new genetic algorithm approach for learning a Bayesian network structure from data. Our method is capable of learning over all node orderings and structure...
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
In this paper we present a method to represent knowledge associated with a course. Course knowledge can be represented in the form of hierarchical prerequisite relation based weigh...
Abstract. The approaches previously used for sentence alignment (sentence length, word correspondence and cognate matching) take into account different aspects of similarity betwe...