Classification using association rules has added a new dimension to the ongoing research for accurate classifiers. Over the years, a number of associative classifiers based on pos...
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...