Improving the non‐compensatory trace‐clustering decision process

DOI10.1111/itor.13062OpenAlexW3201990977MaRDI QIDQ6079902

Evangelos Grigoroudis, Michael Doumpos, Nikolaos F. Matsatsinis, Pavlos Delias

Publication date: 29 September 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13062

zbMATH Keywords

robustnessoutranking methodsprocess miningtrace clustering

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Spectral methods for graph clustering - a survey
• A general trimming approach to robust cluster analysis
• Pseudo-orders: Definition, properties and numerical representation
• A robust method for cluster analysis
• A survey on semi-supervised learning
• A survey of outlier detection methodologies
• A review of robust clustering methods
• Handling effects of reinforced preference and counter-veto in credibility of outranking
• Discovering Object-centric Petri Nets
• A non‐compensatory approach for trace clustering
• Special issue on “Mind and Cognition in the Future of Decision Support Systems”

This page was built for publication: Improving the non‐compensatory trace‐clustering decision process