CN110032494B - Double-granularity noise log filtering method based on incidence relation - Google Patents
Double-granularity noise log filtering method based on incidence relation Download PDFInfo
- Publication number
- CN110032494B CN110032494B CN201910218832.3A CN201910218832A CN110032494B CN 110032494 B CN110032494 B CN 110032494B CN 201910218832 A CN201910218832 A CN 201910218832A CN 110032494 B CN110032494 B CN 110032494B
- Authority
- CN
- China
- Prior art keywords
- event
- log
- events
- noise
- mixed
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3065—Monitoring arrangements determined by the means or processing involved in reporting the monitored data
- G06F11/3072—Monitoring arrangements determined by the means or processing involved in reporting the monitored data where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a dual-granularity noise log filtering method based on an incidence relation. The method obtains the mixed dependency degree based on the calculation of the local dependency degree and the global dependency degree, and can simultaneously realize the fine-grained filtration of noise events in the log and the coarse-grained filtration of noise tracks. Compared with the traditional log filtering method, the log filtering method has the following benefits: 1. a double-particle filtering mechanism is adopted, and different filtering mechanisms are used for different noise scenes, so that an excellent filtering effect is realized under the condition that original log data is kept as much as possible; 2. the filtered log file is used for process mining, so that the accuracy of the process discovery model can be greatly improved, and the understandability of the model is enhanced.
Description
Technical Field
The invention relates to the field of process mining, in particular to a dual-granularity noise log filtering method based on an incidence relation.
Background
Process mining aims to extract useful information from event logs recorded by process-aware information systems to help stakeholders understand the actual execution of the process. The process discovery is an important part of process mining, and the effect of the process discovery is to construct a process model which can reproduce event logging behaviors. The high-precision model can intuitively show the actual execution condition of the business process.
In a business process management system, the activities of a business process are performed according to a well-designed process model, and the execution of these activities is recorded in a log to help stakeholders analyze and monitor the execution of the process. In real life, most business processes have no standardized process model, or the process model has a great difference from the current business process along with the continuous evolution of the business process, so people need to extract the actual execution behavior of the process from the log generated by the process by means of a process discovery technology. However, the noise present in the log can negatively impact the quality of the flow discovery model. If the flow discovery technology is used for carrying out flow discovery on the log containing the noise, the discovery model of the log can generate invisible tasks and non-freely selected structures, and therefore complexity and understandability of the mining model are increased. Common log noise is of the following types: missing type noise events (some events in the flow are not logged for some reason), redundant type noise events (some events in the flow are repeatedly logged multiple times), and misplaced type noise events (some events are logged incorrectly in the order in which they occur in the flow trace).
The noise filtering algorithm can effectively filter noise events in the log, and the accuracy of the process discovery model is greatly improved. The current log noise filtering algorithm can be roughly divided into two types according to the filtering granularity, namely coarse-grained filtering and fine-grained filtering. Where coarse-grained filtering removes the traces containing noise events directly from the original log, removing the entire trace may produce large changes to the mined model structure for smaller-scale log data. The fine-grained filtering only removes the noise event and keeps other events on the trajectory, but the noise event is removed, and meanwhile, the behavior cannot be guaranteed to bring new noise to the trajectory, and meanwhile, the algorithm cannot solve the problem of the missing noise event.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a dual-granularity noise log filtering method based on an incidence relation, which can effectively solve the problems. The technical scheme adopted by the invention is as follows:
a dual-granularity noise log filtering method based on incidence relation comprises the following steps:
(1) inputting an original log file, preprocessing the original log file to generate a log set consisting of a plurality of process tracks sigmaEach flow track is composed of a plurality of flow events eiComposition σ ═<e1,…,en>Recording the set of all flow events e in all flow tracks as epsilon, namely e belongs to epsilon;
(2) statistics Log aggregationFrequency dependency DFD (e) between two process events in all process tracesi,ej);
(3) Further calculating the local dependence Dep between every two eventslocal(ei,ej) Global dependency Depglobal(ei,ej) And mixed dependencies Depmixed(ei,ej);
The local dependency Deplocal(ei,ej) The calculation formula is as follows:
wherein C is1、C2Is a constant number, Dsuc(ei) Indicating subsequent density, i.e. event eiAverage frequency of occurrence of all subsequent events of (a); dpre(ej) Representing precursor density for representing event ejAverage frequency of occurrence of all precursor events; the calculation formulas of the successor density and the predecessor density are as follows:
Dpre(ek)=Npre(ek)/|Upre(ek)|
Dsuc(ek)=Nsuc(ek)/|Usuc(ek)
wherein Dpre(ek) As an event ekPrecursor density of (D)suc(ek) As an event ekSubsequent density of (2), Npre(ek) To be by an event ekNumber of following relations for subsequent events, Nsuc(ek) As an event ekNumber of following relations for predecessor events, Upre(ek) As an event ekIs a precursor set, | Upre(ek) L is event ekNumber of events in the precursor set, Usuc(ek) As an event ekIs connected with the successor set of, | Usuc(ek) I event ekThe number of event categories in the successor set of (1);
the global dependency Depglobal(ei,ej) The calculation formula is as follows:
θ=Max{DFD(ex,ey)}
where ζ is the global noise factor used to partition global noise events.
The mixed dependency Depmixed(ei,ej) The calculation formula is as follows:
Depmixed(ei,ej)=α*Deplocal(ei,ej)+(1-α)*Depglobal(ei,ej)
wherein α weighs factors that balance the occupancy of global and local dependencies.
(4) Constructing log set according to the mixed dependencies calculated in the last stepMixed dependency matrix of all process events in
(5) The method for filtering log noise specifically comprises the following steps:
53) get start event e of σstartAnd will start event estartAdding to an empty sequence of events sigmafilterPerforming the following steps;
54) fetching a current event e according to the sequence of events in sigmai;
55) Taking out the next event e of the current event in the tracki+1;
56) In thatIn search to eiAnd ei+1Mixed dependency of Depmixed(ei,ei+1) First, fine-grained filtering of events is performed, if Depmixed(ei,ei+1) Is not less than the mixedness threshold β, event ei+1Is determined as a normal event, and is added to the trajectory σfilter,ei+1Becoming the current event, subscript i ═ i +1, and returning to step 55); if Depmixed(ei,ei+1) Is less than the mixedness threshold β, event ei+1Is determined as a noise event, and a penalty function is used to modify the discard value of the trajectory sigmaThe penalty function is formulated as follows:
if the corrected abandon value is not lower than the set abandon threshold valueReturn to step 55); if the corrected abandon valueBelow the abandon thresholdThen coarse-grained filtering operation of the track is executed, the track sigma is judged as a noise track, and the step 52) is returned;
57) if event ei+1End event e for current trajectory σendThen the trace σ will be filteredfilterAdding to a filtered Log setPerforming the following steps;
58) repeating the steps 52) to 57) until all the tracks in the original log set are taken out;
Preferably, the log collection described in step (1)All the execution examples of the business process are included, that is, each process track sigma corresponds to one execution example of the business process, and the process track sigma is composed of a plurality of process events eAnd (4) ordered sequence, wherein the flow event e is a record of the execution activity of the business flow.
Preferably, the frequency-dependent DFD (e) described in step (2)i,ej) Indicating degree of direct follow, i.e. event e in all flow instancesjFollowing event eiThe total frequency of occurrence.
Preferably, the global noise factor ζ described in step (3) is 0.02.
Preferably, the blending degree threshold β in step (5) is 0.5.
Preferably, the value of the trade-off factor α in step (5) is 0.5.
The filtering method provided by the invention considers the dependency relationship between events from the global and local angles, and judges whether the events are noise events according to the dependency relationship. Compared with the traditional log filtering method, the log filtering method has the following benefits: 1. a double-particle filtering mechanism is adopted, and different filtering mechanisms are used for different noise scenes, so that an excellent filtering effect is realized under the condition that original log data is kept as much as possible; 2. the filtered log file is used for process mining, so that the accuracy of the process discovery model can be greatly improved, and the understandability of the model is enhanced.
Drawings
FIG. 1 is a flow chart of a dual-granularity noise log filtering method based on an incidence relation according to the present invention;
FIG. 2 is a schematic diagram of an example of noise filtering according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
On the contrary, the invention is intended to cover alternatives, modifications, equivalents and alternatives which may be included within the spirit and scope of the invention as defined by the appended claims. Furthermore, in the following detailed description of the present invention, certain specific details are set forth in order to provide a better understanding of the present invention. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details.
As shown in fig. 1, the method for filtering a dual-granularity noise log based on an association relationship of the present invention includes the following steps:
(1) inputting an original log file, preprocessing the original log file to generate a log set consisting of a plurality of process tracks sigmaEach flow track is composed of a plurality of flow events eiComposition σ ═<e1,…,en>Recording the set of all flow events e in all flow tracks as epsilon, namely e belongs to epsilon;
log collectionAll the execution examples of the business process are included, that is, each process track sigma corresponds to one execution example of the business process, each process track sigma is an ordered sequence composed of a plurality of process events e, and the process events e are one record of the business process execution activity.
(2) Statistics Log aggregationFrequency dependency DFD (e) between two process events in all process tracesi,ej)。
Frequency dependence DFD (e)i,ej) Indicating degree of direct follow-up, i.e. in all process instancesMiddle event ejFollowing event eiThe total frequency of occurrence.
(3) Further calculating the local dependence Dep between every two eventslocal(ei,ej) Global dependency Depglobal(ei,ej) And mixed dependencies Depmixed(ei,ej);
The local dependency Deplocal(ei,ej) The calculation formula is as follows:
wherein C is1、C2Is a constant number, Dsuc(ei) Indicating subsequent density, i.e. event eiAverage frequency of occurrence of all subsequent events of (a); dpre(ej) Representing precursor density for representing event ejAverage frequency of occurrence of all precursor events; the calculation formulas of the successor density and the predecessor density are as follows:
Dpre(ek)=Npre(ek)/|Upre(ek)|
Dsuc(ek)=Nsuc(ek)/|Usuc(ek)|
wherein Dpre(ek) As an event ekPrecursor density of (D)suc(ek) As an event ekSubsequent density of (2), Npre(ek) To be by an event ekNumber of following relations for subsequent events, Nsuc(ek) As an event ekNumber of following relations for predecessor events, Upre(ek) As an event ekIs a precursor set, | Upre(ek) L is event ekNumber of events in the precursor set, Usuc(ek) As an event ekIs connected with the successor set of, | Usuc(ek) I event ekThe number of event categories in the successor set of (1);
the global dependency Depglobal(ei,ej) The calculation formula is as follows:
θ=Max{DFD(ex,ey)}
where ζ is the global noise factor, which is used to partition global noise events, and is taken to be 0.02.
The mixed dependency Depmixed(ei,ej) The calculation formula is as follows:
Depmixed(ei,ej)=α*Deplocal(ei,ej)+(1-α)*Depglobal(ei,ej)
wherein α is a weighing factor used to balance the occupancy of global and local dependencies, which is taken to be 0.5.
(4) Constructing log set according to the mixed dependencies calculated in the last stepMixed dependency matrix of all process events in
(5) The method for filtering log noise specifically comprises the following steps:
53) get start event e of σstartAnd will start event estartAdding to an empty sequence of events sigmafilterPerforming the following steps;
54) fetching a current event e according to the sequence of events in sigmai;
55) Taking out the next event e of the current event in the tracki+1;
56) In thatIn search to eiAnd ei+1Mixed dependency of Depmixed(ei,ei+1) First, fine-grained filtering of events is performed, if Depmixed(ei,ei+1) Is not less than the mixedness threshold β (taken to be 0.5), event ei+1Is determined as a normal event, and is added to the trajectory σfilter,ei+1Becoming the current event, subscript i ═ i +1, and returning to step 55); if Depmixed(ei,ei+1) Is less than the mixedness threshold β, event ei+1Is determined as a noise event, and a penalty function is used to modify the discard value of the trajectory sigmaThe penalty function is formulated as follows:
whereinDetermining the punishment degree of a punishment function as a punishment factor, and taking 0.8;
if the corrected abandon value is not lower than the set abandon threshold valueReturn to step 55); if the corrected abandon valueBelow the abandon thresholdA coarse-grained filtering operation of the trajectory is performed and the trajectory sigma is determined to be a noisy trajectory, returning to step 52). Abandon thresholdTake 0.7.
57) If event ei+1End event e for current trajectory σendThen the trace σ will be filteredfilterAdding to a filtered Log setPerforming the following steps;
58) repeating the steps 52) to 57) until all the tracks in the original log set are taken out;
Based on the above method flow, the technical effects are further shown by the embodiments.
Examples
The steps in this embodiment are the same as those in the previous embodiment, and are not described herein again. The following shows some of the implementation processes and implementation results:
data source acquisition: the original log file used in this embodiment reads the log file using java toolkit JDOM, obtains a root node root of the log file, obtains a child node element named Process from the root node, and further obtains all child node elements named Process instance from the Process node. A ProcessInstance node contains all the information of a process one-time execution instance, and usually has a plurality of node elements named audiotrailentry, and the detailed information of each event occurring in the process instance is recorded in one audiotrailentry node element, and these audiotrailentry nodes contain many event attributes, such as a timestamp attribute, an event name attribute, a resource attribute, and the like. Screening the event information, eliminating redundant information in the event information, reserving event name attributes of the events, sequencing the events of the same instance according to the starting timestamp attributes, and finally storing the events as a flow track sigma<e1,…,en>And endowing the track with the id attribute of the ProcessInstance node element corresponding to the track as the track id, and using a plurality of sets formed by all tracks in the log, namely an original log setAnd (5) storing.
Fig. 2 shows in detail a specific process of performing dual-granularity noise log filtering based on an association relationship on two tracks (example 1 and example 2) by using the method of the present invention:
example 1 trajectory σ1=<ABCDEFGH>
1) Obtaining sigma1And adds it to the empty trajectory sequence σfPerforming the following steps;
2) taking out the next event B of the event A, and calculating the mixed relevance Dep of the event ABmixed(a, B) ═ 0.80, greater than the mixedness threshold 0.5, so event B is a normal event (non-noise event), added to the sequence σfPerforming the following steps;
3) taking out the next event C of the event B, and calculating the mixed relevance Dep of the event BCmixed(B, C) ═ 0.75, greater than the mixedness threshold of 0.5, due toThis event C is a normal event (non-noise event) which is added to the sequence σfPerforming the following steps;
4) taking out the next event D of the event C, and calculating the mixed association degree Dep of the event CDmixed(C, D) ═ 0.85, greater than the mixedness threshold 0.5, so event D is a normal event (non-noise event), added to the sequence σfPerforming the following steps;
5) taking out the next event E of the event D, and calculating the mixed relevance Dep of the event DEmixed(D, E) ═ 0.87, greater than the mixedness threshold 0.5, so event E is a normal event (non-noise event) added to the sequence σfPerforming the following steps;
6) taking out the next event F of the event E, and calculating the mixed relevance Dep of the event EFmixed(E, F) ═ 0.26, small mixedness threshold 0.5, so event F is a noise event, which is not added to sequence σfPerforming the following steps; modifying trajectory sigma using penalty function1Value of abandonmentCalculated to be 0.9, greater than the discard threshold of 0.7, so σ1A normal trajectory (non-noisy trajectory);
7) taking out the next event G of the event F, and calculating the mixed relevance Dep of the event EGmixed(E, G) ═ 0.87, greater than the mixedness threshold 0.5, so event G is a normal event (non-noise event), added to the sequence σfPerforming the following steps;
8) taking out the next event H of the event G, and calculating the mixed relevance Dep of the event GHmixed(G, H) ═ 0.85, greater than the mixedness threshold 0.5, so event H is a normal event (non-noise event), added to the sequence σfPerforming the following steps;
9) event H is the current trajectory σ1The trajectory filtered by the method is sigmaf=<ABCDEGH>It is added to the filter log set.
Example 2 track σ2=<ABCEGH>
1) Obtaining sigma2And adds it to the empty trajectory sequence σfPerforming the following steps;
2) taking out the next event B of the event A, and calculating the mixed relevance Dep of the event ABmixed(a, B) ═ 0.80, greater than the mixedness threshold 0.5, so event B is a normal event (non-noise event), added to the sequence σfPerforming the following steps;
3) taking out the next event C of the event B, and calculating the mixed relevance Dep of the event BCmixed(B, C) ═ 0.75, greater than the mixedness threshold 0.5, so event C is a normal event (non-noise event) added to the sequence σfPerforming the following steps;
4) taking out the next event E of the event C, and calculating the mixed relevance Dep of the event CEmixed(C, E) ═ 0.26, less than the mixedness threshold 0.5, so event E is a noise event, which is not added to the sequence σfPerforming the following steps; modifying trajectory sigma using penalty function2Value of abandonmentCalculated to be 0.9, greater than the discard threshold of 0.7, so σ2A normal trajectory (non-noisy trajectory);
5) taking out the next event G of the event E, and calculating the mixed association degree Dep of the event CGmixed(C, G) ═ 0.01, less than the mixedness threshold 0.5, so event G is a noise event, which is not added to the sequence σfPerforming the following steps; modifying trajectory sigma using penalty function2Value of abandonmentCalculated as 0.72, greater than the discard threshold of 0.7, so σ2A normal trajectory (non-noisy trajectory);
taking out the next event H of the event G, and calculating the mixed relevance Dep of the event CHmixed(C, H) ═ 0.01, less than the mixedness threshold 0.5, so event H is a noise event, which is not added to the sequence σfPerforming the following steps;
Claims (8)
1. A dual-granularity noise log filtering method based on incidence relation is characterized by comprising the following steps:
(1) inputting an original log file, preprocessing the original log file to generate a log set consisting of a plurality of process tracks sigmaEach flow track is composed of a plurality of flow events eiComposition σ ═<e1,…,en>Recording the set of all flow events e in all flow tracks as epsilon, namely e belongs to epsilon;
(2) statistics Log aggregationFrequency dependency DFD (e) between two process events in all process tracesi,ej);
(3) Further calculating the local dependence Dep between every two eventslocal(ei,ej) Global dependency Depglobal(ei,ej) And mixed dependencies Depmixed(ei,ej);
The local dependency Deplocal(ei,ej) The calculation formula is as follows:
wherein C is1、C2Is a constant number, Dsuc(ei) Indicating subsequent density, i.e. event eiAverage frequency of occurrence of all subsequent events of (a); dpre(ej) Representing precursor density for representing event ejAverage frequency of occurrence of all precursor events; the calculation formulas of the successor density and the predecessor density are as follows:
Dpre(ek)=Npre(ek)/ |Upre(ek) |
Dsuc(ek)=Nsuc(ek)/ |Usuc(ek) |
wherein Dpre(ek) As an event ekPrecursor density of (D)suc(ek) As an event ekSubsequent density of (2), Npre(ek) To be by an event ekNumber of following relations for subsequent events, Nsuc(ek) As an event ekNumber of following relations for predecessor events, Upre(ek) As an event ekIs a precursor set, | Upre(ek) L is event ekNumber of events in the precursor set, Usuc(ek) As an event ekIs connected with the successor set of, | Usuc(ek) I event ekThe number of event categories in the successor set of (1);
the global dependency Depglobal(ei,ej) The calculation formula is as follows:
θ=Max{DFD(ex,ey)}
where ζ is a global noise factor used to partition global noise events;
the mixed dependency Depmixed(ei,ej) The calculation formula is as follows:
Depmixed(ei,ej)=α*Deplocal(ei,ej)+(1-α)*Depglobal(ei,ej)
α is a balance factor used for balancing the occupation proportion of the global dependency and the local dependency;
(4) constructing log set according to the mixed dependencies calculated in the last stepMixed dependency matrix of all process events in
(5) The method for filtering log noise specifically comprises the following steps:
53) get start event e of σstartAnd will start event estartAdding to an empty sequence of events sigmafilterPerforming the following steps;
54) fetching a current event e according to the sequence of events in sigmai;
55) Taking out the next event e of the current event in the tracki+1;
56) In thatIn search to eiAnd ei+1Mixed dependency of Depmixed(ei,ei+1) First, fine-grained filtering of events is performed, if Depmixed(ei,ei+1) Is not less than the mixedness threshold β, event ei+1Is determined as a normal event, and is added to the trajectory σfilter,ei+1Becoming the current event, subscript i ═ i +1, and returning to step 55); if Depmixed(ei,ei+1) Is less than the mixedness threshold β, event ei+1Is determined as a noise event, and a penalty function is used to modify the discard value of the trajectory sigmaThe penalty function is formulated as follows:
if the corrected abandon value is not lower than the set abandon threshold valueReturn to step 55); if the corrected abandon valueBelow the abandon thresholdThen coarse-grained filtering operation of the track is executed, the track sigma is judged as a noise track, and the step 52) is returned;
57) if event ei+1End event e for current trajectory σendThen the trace σ will be filteredfilterAdding to a filtered Log setPerforming the following steps;
58) repeating the steps 52) to 57) until all the tracks in the original log set are taken out;
2. The correlation-based dual-granularity noise log filtering method according to claim 1, wherein the log set in the step (1) isAll the execution examples of the business process are included, that is, each process track sigma corresponds to one execution example of the business process, the process track sigma is an ordered sequence composed of a plurality of process events e, and the process events e are one record of the business process execution activity.
3. The correlation-based dual-granularity noise log filtering method according to claim 1, wherein the frequency dependency DFD (e) in the step (2)i,ej) Indicating degree of direct follow, i.e. event e in all flow instancesjFollowing event eiThe total frequency of occurrence.
4. The correlation-based dual-granularity noise log filtering method according to claim 1, wherein the global noise factor ζ in step (3) is 0.02.
5. The correlation-based dual-granularity noise log filtering method as claimed in claim 1, wherein the mixedness threshold β in step (5) is 0.5.
6. The correlation-based dual-granularity noise log filtering method as claimed in claim 1, wherein the weighting factor α in the step (5) is 0.5.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910218832.3A CN110032494B (en) | 2019-03-21 | 2019-03-21 | Double-granularity noise log filtering method based on incidence relation |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910218832.3A CN110032494B (en) | 2019-03-21 | 2019-03-21 | Double-granularity noise log filtering method based on incidence relation |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110032494A CN110032494A (en) | 2019-07-19 |
CN110032494B true CN110032494B (en) | 2020-05-26 |
Family
ID=67236382
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910218832.3A Active CN110032494B (en) | 2019-03-21 | 2019-03-21 | Double-granularity noise log filtering method based on incidence relation |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110032494B (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110597686B (en) * | 2019-08-18 | 2022-10-18 | 南京理工大学 | Noise-tolerant process mining method based on mixed event log |
CN112052990B (en) * | 2020-08-21 | 2021-05-04 | 杭州电子科技大学 | CNN-BilSTM hybrid model-based next activity prediction method for multi-angle business process |
CN113176977A (en) * | 2021-04-27 | 2021-07-27 | 南开大学 | Interleaved log analysis method for networking workflow of construction |
CN114564473B (en) * | 2022-04-28 | 2022-07-12 | 江苏益柏锐信息科技有限公司 | Data processing method, equipment and medium based on ERP enterprise management system |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103198146A (en) * | 2013-04-19 | 2013-07-10 | 中国科学院计算技术研究所 | Real-time event filtering method and real-time event filtering system oriented to network stream data |
CN103593484A (en) * | 2013-12-03 | 2014-02-19 | 南京安讯科技有限责任公司 | Method for filtering garbage logs during mobile phone internet surfing |
KR20170127876A (en) * | 2016-05-13 | 2017-11-22 | 한국전자통신연구원 | System and method for dealing with troubles through fault analysis of log |
CN107909344A (en) * | 2017-11-21 | 2018-04-13 | 杭州电子科技大学 | Workflow logs iterative task recognition methods based on relational matrix |
-
2019
- 2019-03-21 CN CN201910218832.3A patent/CN110032494B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103198146A (en) * | 2013-04-19 | 2013-07-10 | 中国科学院计算技术研究所 | Real-time event filtering method and real-time event filtering system oriented to network stream data |
CN103593484A (en) * | 2013-12-03 | 2014-02-19 | 南京安讯科技有限责任公司 | Method for filtering garbage logs during mobile phone internet surfing |
KR20170127876A (en) * | 2016-05-13 | 2017-11-22 | 한국전자통신연구원 | System and method for dealing with troubles through fault analysis of log |
CN107909344A (en) * | 2017-11-21 | 2018-04-13 | 杭州电子科技大学 | Workflow logs iterative task recognition methods based on relational matrix |
Non-Patent Citations (1)
Title |
---|
Filtering log data: Finding the needles in the Haystack;Li Yu et al.;《ResearchGate》;20150627;1-10 * |
Also Published As
Publication number | Publication date |
---|---|
CN110032494A (en) | 2019-07-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110032494B (en) | Double-granularity noise log filtering method based on incidence relation | |
US7739666B2 (en) | Analyzing software users with instrumentation data and user group modeling and analysis | |
US9612892B2 (en) | Creating a correlation rule defining a relationship between event types | |
Li et al. | Mining context-dependent and interactive business process maps using execution patterns | |
US8127032B2 (en) | Performance sampling in distributed systems | |
Conforti et al. | Timestamp repair for business process event logs | |
Wagner et al. | Enhanced encoding techniques for the open trace format 2 | |
Itkin et al. | User-assisted log analysis for quality control of distributed fintech applications | |
CN115525693A (en) | Incremental event log-oriented process model mining method and system | |
CN110908870A (en) | Resource monitoring method and device for mainframe, storage medium and equipment | |
US10073938B2 (en) | Integrated circuit design verification | |
Li et al. | A self-adaptive process mining algorithm based on information entropy to deal with uncertain data | |
TWI482033B (en) | Method for arranging schedules and computer using the same | |
Piattini et al. | A metric-based approach for predicting conceptual data models maintainability | |
CN115345600B (en) | RPA flow generation method and device | |
Farkas et al. | Towards reliable benchmarks of timed automata | |
CN114329453A (en) | Anomaly detection method based on system log | |
KR20220115859A (en) | Edge table representation of the process | |
Shahzadi et al. | Enhancement in Process Mining Model by Repairing Noisy Behavior in Event Log | |
CN114730408A (en) | Process tree discovery using probabilistic inductive miners | |
Cuzzocrea et al. | Spatio-temporal analysis of greenhouse gas data via clustering techniques | |
CN113546426B (en) | Security policy generation method for data access event in game service | |
Chang et al. | Transformation from activity diagrams with time properties to Timed Coloured Petri Nets | |
Andreswari et al. | Analysis Study for Rabobank Group ICT Incident by using Fuzzy and Heuristic Miner in Process Mining. | |
van der Aalst | Discovery, verification and conformance of workflows with cancellation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
CB03 | Change of inventor or designer information |
Inventor after: Sun Xiaoxiao Inventor after: Hou Wenjie Inventor after: Yu Dongjin Inventor after: Pan Jianliang Inventor before: Sun Xiaoxiao Inventor before: Yu Dongjin Inventor before: Hou Wenjie Inventor before: Pan Jianliang |
|
CB03 | Change of inventor or designer information | ||
GR01 | Patent grant | ||
GR01 | Patent grant |