Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing compon...
In this paper, a neuro-fuzzy algorithm has been implemented to improve the path planning of a mobile robot based on modification of vector field histogram (VFH) approach using neu...
Finding sequential patterns is one of important issues in data mining. This paper deals with linguistic (fuzzy) sequential patterns. The existing algorithms for discovering such p...