{'fraction_non_alphanumeric': 0.025284450063211124, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Proposal to Represent the Linguistic Conditional Preference Networks

In this article, we focus on group decision making when preferences are expressed through the LCP-nets (Linguistic Conditional Preference networks). There is a need for complementing efforts and research on mixing LCP-nets together to be able to compute group preferences. First steps are the comparison between two LCP-nets and the aggregation of LCP-nets. In order to compare then aggregate two LCP-nets, we propose a matrix representation that takes into account the number of nodes, the directions and three kinds of arcs. With this simple modeling, computations become very easy and fast. In particular, we develop an adjunction operator called + that permit to aggregate two LCP-nets under certain conditions.