Sensitivity analysis of discrete preference functions using Koszul simplicial complexes

DOI10.1145/3597066.3597095OpenAlexW4383222127MaRDI QIDQ6060373

Eduardo Sáenz-de-Cabezón, Henry P. Wynn, Fatemeh Mohammadi, Jose Divasón

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3597066.3597095

zbMATH Keywords

sensitivity analysismonomial idealspersistent homologyunsupervised machine learningKoszul simplicial complexes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Types of signature analysis in reliability based on Hilbert series
• Finite atomic lattices and resolutions of monomial ideals
• Stability of persistence diagrams
• Betti numbers and minimal free resolutions for multi-state system reliability bounds
• A framework for sensitivity analysis in discrete multi-objective decision-making
• The lcm-lattice in monomial resolutions
• Betti numbers of polynomial hierarchical models for experimental designs
• Maximum likelihood solutions for multicriterial choice problems
• Hierarchical Clustering for Finding Symmetries and Other Patterns in Massive, High Dimensional Datasets
• Sensitivity Analysis in Practice
• Monomial Ideals
• Monomial Resolutions for Efficient Computation of Simplicial Homology
• AN ALGEBRAIC TOPOLOGICAL METHOD FOR FEATURE IDENTIFICATION
• Sensitivity analyses and measurements for group decisions using weighted scoring rules
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sensitivity analysis of discrete preference functions using Koszul simplicial complexes