Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences - Computational Intelligence and Its Applications Access content directly
Conference Papers Year : 2018

Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences

Abstract

Nowadays, current trends of universal quantification-based queries are been oriented towards flexible ones (tolerant queries and-or those involving preferences). In this paper, we are interested in universal quantification-like queries dealing with both positive or negative preferences (requirements or prohibitions), considered separately or simultaneously. We have emphasised the improvement of the proposed operator, by designing new variants of the classical Hash-Division algorithm, presented in [1], for dealing with our context. The parallel implementation is also presented, and the issue of answers ranking is dealt with. Computational experiments are carried out in both sequential and parallel versions. They shows the relevance of our approach and demonstrate that the new operator outperforms the conventional one with respect to performance (the gain exceeds a ratio of 40).
Fichier principal
Vignette du fichier
467079_1_En_54_Chapter.pdf (382.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01913925 , version 1 (07-11-2018)

Licence

Attribution

Identifiers

Cite

Noussaiba Benadjimi, Walid Hidouci. Unified-Processing of Flexible Division Dealing with Positive and Negative Preferences. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.635-647, ⟨10.1007/978-3-319-89743-1_54⟩. ⟨hal-01913925⟩
61 View
25 Download

Altmetric

Share

Gmail Facebook X LinkedIn More