检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东工业大学自动化学院,广州510090 [2]广东水利电力职业技术学院计算机信息工程系,广州510635
出 处:《计算机应用》2008年第12期3235-3239,共5页journal of Computer Applications
摘 要:强循环、弱循环、跳、不可见任务等复杂结构是业务流程中常见的流程结构,从事件日志中挖掘这些复杂结构是亟待解决的问题。分析了强循环、弱循环、跳、不可见任务的特征并给出了它们的判定定理,在此基础上结合同步管理器模型提出了γ+算法,该算法克服了目前过程挖掘算法的限制,在挖掘流程结构的同时挖掘管理行为,能够处理强循环、弱循环、跳、不可见任务等复杂结构,实例分析表明了算法的有效性与可适用性。Strong-loop, weak-loop, jump and invisible tasks are ubiquitous between tasks in the business process, and mining them from the event logs is a problem to be solved. The features of strong-loop, weak-loop, jump and invisible tasks were analyzed, and the determinant theorems were offered, on the basis of which the γ^+ algorithm was proposed with synchronized-manager models. The γ^+ algorithm overcomes the limitation of the converutional mining algorithms, executes the mining of management actions along with the mining of process structure, and manages to solve problems such as strong-loop, weak-loop, jump and invisible tasks. Experimental results indicate the effectiveness and applicability.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.4