Trace Encoding Techniques for Multi‐Perspective Process Mining: A Comparative Study
ABSTRACT Process mining (PM) comprises a variety of methods for discovering information about processes from their execution logs. Some of them, such as trace clustering, trace classification, and anomalous trace detection require a preliminary preprocessing step in which the raw data is encoded into a numerical feature space.
Antonino Rullo +2 more
wiley +1 more source
Computational Drug Repositioning in Cardiorenal Disease: Opportunities, Challenges, and Approaches
PROTEOMICS, Volume 25, Issue 11-12, June 2025.
Paul Perco +7 more
wiley +1 more source
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey [PDF]
The current situation with bounds on the smallest number of edges in color-critical graphs and hypergraphs is discussed.
openaire +2 more sources
On 2-Colorability Problem for Hypergraphs with P_8-free Incidence Graphs
A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. The hypergraph 2- Coloring Problem is the question whether a given hypergraph is 2-colorable. It is known that deciding the 2-colorability of hypergraphs is NP-complete even for hypergraphs whose hyperedges have size at most 3.
openaire +2 more sources
ASPECTS OF TOPOLOGICAL APPROACHES FOR DATA SCIENCE. [PDF]
Grbić J, Wu J, Xia K, Wei GW.
europepmc +1 more source
What makes a reaction network "chemical"? [PDF]
Müller S, Flamm C, Stadler PF.
europepmc +1 more source
A study of cluster hypergraphs and its properties. [PDF]
Maity A +4 more
europepmc +1 more source
Bounded colorings of multipartite graphs and hypergraphs
Nina Kamčev, Benny Sudakov, Jan Volec
openalex +3 more sources
Solution of road network problem with the help of m-polar fuzzy graph using isometric and antipodal concept. [PDF]
Mondal U, Mahapatra T, Xin Q, Pal M.
europepmc +1 more source
Graph-Based Resource Allocation for Integrated Space and Terrestrial Communications. [PDF]
Ivanov A +4 more
europepmc +1 more source

