pm4py.algo.reduction.process_tree.variants package#
PM4Py – A Process Mining Library for Python
Copyright (C) 2024 Process Intelligence Solutions UG (haftungsbeschränkt)
This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License along with this program. If not, see this software project’s root or visit <https://www.gnu.org/licenses/>.
Website: https://processintelligence.solutions Contact: info@processintelligence.solutions
Submodules#
pm4py.algo.reduction.process_tree.variants.tree_tr_based module#
PM4Py – A Process Mining Library for Python
Copyright (C) 2024 Process Intelligence Solutions UG (haftungsbeschränkt)
This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License along with this program. If not, see this software project’s root or visit <https://www.gnu.org/licenses/>.
Website: https://processintelligence.solutions Contact: info@processintelligence.solutions
- class pm4py.algo.reduction.process_tree.variants.tree_tr_based.Outputs(value, names=<not given>, *values, module=None, qualname=None, type=None, start=1, boundary=None)[source]#
Bases:
Enum- DFG = 'dfg'#
- SEQUENCE = 'sequence'#
- PARALLEL = 'parallel'#
- START_ACTIVITIES = 'start_activities'#
- END_ACTIVITIES = 'end_activities'#
- ACTIVITIES = 'activities'#
- SKIPPABLE = 'skippable'#
- ACTIVITIES_ALWAYS_HAPPENING = 'activities_always_happening'#
- MIN_TRACE_LENGTH = 'min_trace_length'#
- TRACE = 'trace'#
- class pm4py.algo.reduction.process_tree.variants.tree_tr_based.Parameters(value, names=<not given>, *values, module=None, qualname=None, type=None, start=1, boundary=None)[source]#
Bases:
Enum- ACTIVITY_KEY = 'pm4py:param:activity_key'#
- pm4py.algo.reduction.process_tree.variants.tree_tr_based.apply(tree: ProcessTree, trace: Trace, parameters: Dict[Any, Any] | None = None, **kwargs) ProcessTree[source]#
Reduce a process tree replacing the skippable elements that have empty intersection with the trace.
Parameters#
- tree
Process tree
- trace
Trace of an event log
- parameters
Parameters of the algorithm, possible values: Parameters.ACTIVITY_KEY
Returns#
- tree
Reduced process tree
- pm4py.algo.reduction.process_tree.variants.tree_tr_based.reduce(bottomup_nodes: List[ProcessTree], fps: Dict[str, Any], activities: Set[str]) ProcessTree[source]#
Reduce a process tree replacing the skippable elements that have empty intersection with the trace.
Parameters#
- bottomup_nodes
List of nodes of the process tree (that are process trees by themselves) in a bottomup order
- fps
Footprints of the process tree
- activities
Set of activities in the trace
Returns#
- tree
Reduced process tree