Graph Theory in the Classification of Information Systems
Daniel Zentai

TL;DR
This paper introduces a mathematical model and a polynomial-time algorithm for risk classification in information systems using graph theory, aiming to provide an optimal and standardized classification method.
Contribution
It presents a novel mathematical framework and an efficient algorithm for risk classification, addressing the lack of a universal optimal classification method.
Findings
Proposed a new graph-based risk classification model
Developed a polynomial-time classification algorithm
Achieved effective risk categorization in information systems
Abstract
Risk classification plays an important role in many regulations and standards. However, a general method that provides an optimal classification has not been proposed yet. Also, the criteria of optimality are not defined in these regulations. In this work, we will propose a mathematical model that is sufficient to describe this problem, and we also propose an algorithm that classifies graph vertices based on their risk value in polynomial time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Research in Systems and Signal Processing
