踪迹聚类下组织实体的重要度排序方法
|
摘要
针对简单套用交接网络等社会网络分析方式不能很好地反映踪迹聚类生成的一系列流程的组织实体的重要度的问题,提出了一种踪迹聚类下组织实体的重要度排序方法。首先,对于参与踪迹聚类生成的一系列流程的组织实体构建踪迹聚类与组织实体关系网络;其次,定义基于踪迹聚类与组织实体关系网络的节点重要度评估方法;最后,对踪迹聚类下的各个组织实体节点计算其在关系网络中的重要度评分并排序。实验结果表明,所提方法构建的关系网络相比踪迹聚类下的交接网络能够更准确地反映组织实体的实际重要度;与基于拓扑势的网络社区节点重要度排序算法相比,所提方法的节点重要度排序结果更符合实际业务流程,能更好地区分关系网络中重要度不同的节点。
Aiming at the issue that the social network analysis method like hand-over network cannot express the importance of organizational entities precisely,a method to sort the quantified importance of organizational entities organized under the trace clusters was proposed. Firstly,a relation network was constructed to describe the relationship between trace clusters and organizational entities; secondly,a quantitative assessment of the nodes' importance of this network was defined;finally,all these nodes were sorted respectively according to their quantified importance. The experimental results show that this relation network can express the actual importance of organizational entities more precisely than the hand-over network generated by trace clustering. Compared to the importance sorting algorithm of network community nodes based on topological potential,the proposed method is more suitable for the actual business processes,meanwhile it can distinguish distinct organizational entities better than the importance-sorting algorithm based on topological potential.
Aiming at the issue that the social network analysis method like hand-over network cannot express the importance of organizational entities precisely,a method to sort the quantified importance of organizational entities organized under the trace clusters was proposed. Firstly,a relation network was constructed to describe the relationship between trace clusters and organizational entities; secondly,a quantitative assessment of the nodes' importance of this network was defined;finally,all these nodes were sorted respectively according to their quantified importance. The experimental results show that this relation network can express the actual importance of organizational entities more precisely than the hand-over network generated by trace clustering. Compared to the importance sorting algorithm of network community nodes based on topological potential,the proposed method is more suitable for the actual business processes,meanwhile it can distinguish distinct organizational entities better than the importance-sorting algorithm based on topological potential.
引文
[1]van der AALST W M P.Process Mining:Discovery,Conformance and Enhancement of Business Processes[M].Berlin:Springer Science&Business Media,2011:11-16.
[2]ROZINAT A,de JONG I S M,GUNTHER C W,et al.Process mining applied to the test process of wafer scanners in ASML[J].IEEE Transactions on Systems,Man,and Cybernetics,Part C:Applications and Reviews,2009,39(4):474-479.
[3]van der AALST W M P,ADRIANSYAH A,de MEDEIROS A K A,et al.Process mining manifesto[C]//Proceedings of the 10th International Conference on Business Process Management.Berlin:Springer,2012:169-194.
[4]van der AALST W M P,DUSTDAR S.Process mining put into context[J].IEEE Internet Computing,2012,16(1):82-86.
[5]FERREIA D R,ALVES C.Discovering user communities in large event logs[C]//Proceedings of the 7th International Workshop on Business Process Intelligence.Berlin:Springer,2012:123-134.
[6]LI M,LIU L,YIN L,et al.A process mining based approach to knowledge maintenance[J].Information Systems Frontiers,2011,13(3):371-380.
[7]LIU R,AGAWAL S,SINDHGATTA R R,et al.Accelerating collaboration in task assignment using a socially enhanced resource model[C]//Proceedings of the 11th International Conference of Business Process Management.Berlin:Springer,2013,8094:251-258.
[8]SONG M,GUNTHER C W,van der AALST W M P.Trace clustering in process mining[C]//Proceedings of the 7th International Conference on Business Process Management.Berlin:Springer,2009:109-120.
[9]BOSE R P J C,van der AALST W M P.Context aware trace clustering:towards improving process mining results[C]//Proceedings of the 2009 SIAM Data Mining Conference.Philadelphia:SIAM,2009:401-412.
[10]BOSE R P J C,van der AALST W M P.Trace clustering based on conserved patterns:towards achieving better process models[C]//Proceedings of the 8th International Conference on Business Process Management.Berlin:Springer,2010:170-181.
[11]SUN Y,HAN J,ZHAO P,et al.Rank Clus:integrating clustering with ranking for heterogeneous information network analysis[C]//Proceedings of the 12th International Conference on Extending Database Technology:Advances in Database Technology.New York:ACM,2009:565-576.
[12]SUN Y,YU Y,HAN J.Ranking-based clustering of heterogeneous information networks with star network schema[C]//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM,2009:797-806.
[13]ZHONG S.Efficient online spherical k-means clustering[C]//Proceedings of the 2005 IEEE International Joint Conference on Neural Networks.Piscataway,NJ:IEEE,2005:3180-3185.
[14]谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83.(TAN Y J,WU J,DENG H Z.Evaluation method for node importance based on node contraction in complex networks[J].Systems Engineering—Theory&Practice,2006,26(11):79-83.)
[15]张健沛,李泓波,杨静,等.基于拓扑势的网络社区结点重要度排序算法[J].哈尔滨工程大学学报,2012,33(6):745-752.(ZHANG J P,LI H B,YANG J,et al.An importance-sorting algorithm of network community nodes based on topological potential[J].Journal of Harbin Engineering University,2012,33(6):745-752.)
[16]朱涛,张水平,郭茂潇,等.改进的加权复杂网络节点重要度评估的收缩方法[J].系统工程与电子技术,2009,31(8):1902-1905.(ZHU T,ZHANG S P,GUO M X,et al.Improved evaluation for node importance based on node contraction in weighted complex networks[J].Systems Engineering and Electronics,2009,31(8):1902-1905.)
[17]CHEN D,LU L,SHANG M,et al.Identifying influential nodes in complex networks[J].Physica A:Statistical Mechanics and its Applications,2012,391(4):1777-1787.
[18]陈静,孙林夫.复杂网络中节点重要度评估[J].西南交通大学学报,2009,44(3):426-429.(CHEN J,SUN L F.Evaluation of node importance in complex networks[J].Journal of Southwest Jiaotong University,2009,44(3):426-429.)
[19]赵毅寰,王祖林,郑晶,等.利用重要性贡献矩阵确定通信网中最重要节点[J].北京航空航天大学学报,2009,35(9):1076-1079.(ZHAO Y H,WANG Z L,ZHENG J,et al.Finding most vital node by node importance contribution matrix in communication networks[J].Journal of Beijing University of Aeronautics and Astronautics,2009,35(9):1076-1079.)
[20]周漩,张凤鸣,李克武,等.利用重要度评价矩阵确定复杂网络关键节点[J].物理学报,2012,61(5):050201.(ZHOU X,ZHANG F M,LI K W,et al.Finding vital node by node importance evaluation matrix in complex networks[J].Acta Physica Sinica,2012,61(5):050201.)
[21]淦文燕,赫南,李德毅,等.一种基于拓扑势的网络社区发现方法[J].软件学报,2009,20(8):2241-2254.(GAN W Y,HE N,LI D Y,et al.Community discovery method in networks based on topological potential[J].Journal of Software,2009,20(8):2241-2254.)
[2]ROZINAT A,de JONG I S M,GUNTHER C W,et al.Process mining applied to the test process of wafer scanners in ASML[J].IEEE Transactions on Systems,Man,and Cybernetics,Part C:Applications and Reviews,2009,39(4):474-479.
[3]van der AALST W M P,ADRIANSYAH A,de MEDEIROS A K A,et al.Process mining manifesto[C]//Proceedings of the 10th International Conference on Business Process Management.Berlin:Springer,2012:169-194.
[4]van der AALST W M P,DUSTDAR S.Process mining put into context[J].IEEE Internet Computing,2012,16(1):82-86.
[5]FERREIA D R,ALVES C.Discovering user communities in large event logs[C]//Proceedings of the 7th International Workshop on Business Process Intelligence.Berlin:Springer,2012:123-134.
[6]LI M,LIU L,YIN L,et al.A process mining based approach to knowledge maintenance[J].Information Systems Frontiers,2011,13(3):371-380.
[7]LIU R,AGAWAL S,SINDHGATTA R R,et al.Accelerating collaboration in task assignment using a socially enhanced resource model[C]//Proceedings of the 11th International Conference of Business Process Management.Berlin:Springer,2013,8094:251-258.
[8]SONG M,GUNTHER C W,van der AALST W M P.Trace clustering in process mining[C]//Proceedings of the 7th International Conference on Business Process Management.Berlin:Springer,2009:109-120.
[9]BOSE R P J C,van der AALST W M P.Context aware trace clustering:towards improving process mining results[C]//Proceedings of the 2009 SIAM Data Mining Conference.Philadelphia:SIAM,2009:401-412.
[10]BOSE R P J C,van der AALST W M P.Trace clustering based on conserved patterns:towards achieving better process models[C]//Proceedings of the 8th International Conference on Business Process Management.Berlin:Springer,2010:170-181.
[11]SUN Y,HAN J,ZHAO P,et al.Rank Clus:integrating clustering with ranking for heterogeneous information network analysis[C]//Proceedings of the 12th International Conference on Extending Database Technology:Advances in Database Technology.New York:ACM,2009:565-576.
[12]SUN Y,YU Y,HAN J.Ranking-based clustering of heterogeneous information networks with star network schema[C]//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM,2009:797-806.
[13]ZHONG S.Efficient online spherical k-means clustering[C]//Proceedings of the 2005 IEEE International Joint Conference on Neural Networks.Piscataway,NJ:IEEE,2005:3180-3185.
[14]谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83.(TAN Y J,WU J,DENG H Z.Evaluation method for node importance based on node contraction in complex networks[J].Systems Engineering—Theory&Practice,2006,26(11):79-83.)
[15]张健沛,李泓波,杨静,等.基于拓扑势的网络社区结点重要度排序算法[J].哈尔滨工程大学学报,2012,33(6):745-752.(ZHANG J P,LI H B,YANG J,et al.An importance-sorting algorithm of network community nodes based on topological potential[J].Journal of Harbin Engineering University,2012,33(6):745-752.)
[16]朱涛,张水平,郭茂潇,等.改进的加权复杂网络节点重要度评估的收缩方法[J].系统工程与电子技术,2009,31(8):1902-1905.(ZHU T,ZHANG S P,GUO M X,et al.Improved evaluation for node importance based on node contraction in weighted complex networks[J].Systems Engineering and Electronics,2009,31(8):1902-1905.)
[17]CHEN D,LU L,SHANG M,et al.Identifying influential nodes in complex networks[J].Physica A:Statistical Mechanics and its Applications,2012,391(4):1777-1787.
[18]陈静,孙林夫.复杂网络中节点重要度评估[J].西南交通大学学报,2009,44(3):426-429.(CHEN J,SUN L F.Evaluation of node importance in complex networks[J].Journal of Southwest Jiaotong University,2009,44(3):426-429.)
[19]赵毅寰,王祖林,郑晶,等.利用重要性贡献矩阵确定通信网中最重要节点[J].北京航空航天大学学报,2009,35(9):1076-1079.(ZHAO Y H,WANG Z L,ZHENG J,et al.Finding most vital node by node importance contribution matrix in communication networks[J].Journal of Beijing University of Aeronautics and Astronautics,2009,35(9):1076-1079.)
[20]周漩,张凤鸣,李克武,等.利用重要度评价矩阵确定复杂网络关键节点[J].物理学报,2012,61(5):050201.(ZHOU X,ZHANG F M,LI K W,et al.Finding vital node by node importance evaluation matrix in complex networks[J].Acta Physica Sinica,2012,61(5):050201.)
[21]淦文燕,赫南,李德毅,等.一种基于拓扑势的网络社区发现方法[J].软件学报,2009,20(8):2241-2254.(GAN W Y,HE N,LI D Y,et al.Community discovery method in networks based on topological potential[J].Journal of Software,2009,20(8):2241-2254.)