TY - GEN
T1 - Construction and Refinement of Preference Ordered Decision Classes
AU - Dau, Hoang Nhat
AU - Chakhar, Salem
AU - Ouelhadj, Djamila
AU - ABUBAHIA, AHMED
PY - 2019/8/29
Y1 - 2019/8/29
N2 - Preference learning methods are commonly used in multicriteria analysis. The working principle of these methods is similar to classical machine learning techniques. A common issue to both machine learning and preference learning methods is the difficulty of the definition of decision classes and the assignment of objects to these classes, especially for large datasets. This paper proposes two procedures permitting to automatize the construction of decision classes. It also proposes two simple refinement procedures, that rely on the 80-20 principle, permitting to map the output of the construction procedures into a manageable set of decision classes. The proposed construction procedures rely on the most elementary preference relation, namely dominance relation, which avoids the need for additional information or distance/(di)similarity functions, as with most of existing clustering methods. Furthermore, the simplicity of the 80-20 principle on which the refinement procedures are based, make them very adequate to large datasets. Proposed procedures are illustrated and validated using real-world datasets.
AB - Preference learning methods are commonly used in multicriteria analysis. The working principle of these methods is similar to classical machine learning techniques. A common issue to both machine learning and preference learning methods is the difficulty of the definition of decision classes and the assignment of objects to these classes, especially for large datasets. This paper proposes two procedures permitting to automatize the construction of decision classes. It also proposes two simple refinement procedures, that rely on the 80-20 principle, permitting to map the output of the construction procedures into a manageable set of decision classes. The proposed construction procedures rely on the most elementary preference relation, namely dominance relation, which avoids the need for additional information or distance/(di)similarity functions, as with most of existing clustering methods. Furthermore, the simplicity of the 80-20 principle on which the refinement procedures are based, make them very adequate to large datasets. Proposed procedures are illustrated and validated using real-world datasets.
U2 - 10.1007/978-3-030-29933-0_21
DO - 10.1007/978-3-030-29933-0_21
M3 - Conference proceeding (ISBN)
T3 - Advances in Intelligent Systems and Computing (AISC, volume 1043)
SP - 248
EP - 261
BT - Advances in Computational Intelligence Systems
PB - Springer
ER -