Improving the non‐compensatory trace‐clustering decision process

DOI10.1111/ITOR.13062MaRDI QIDQ6079902zbMATH OpenOpenAlexFDO

Authors Pavlos Delias, Michael Doumpos, Vangelis Grigoroudis, Nikolaos F. Matsatsinis

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

robustnessprocess miningoutranking methodstrace clustering

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 2209458 (Why is no real title available?)
• A general trimming approach to robust cluster analysis
• A non‐compensatory approach for trace clustering
• A review of robust clustering methods
• A robust method for cluster analysis
• A survey of outlier detection methodologies
• A survey on semi-supervised learning
• Discovering object-centric Petri nets
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Handling effects of reinforced preference and counter-veto in credibility of outranking
• Pseudo-orders: Definition, properties and numerical representation
• Semi-supervised clustering with user feedback
• Special issue on “Mind and Cognition in the Future of Decision Support Systems”
• Spectral methods for graph clustering - a survey

Cited in

(1)

• Multicriteria sorting method based on global and local search for supplier segmentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6079902)