An algorithm for calculating process similarity to cluster open-source process designs

	An algorithm for calculating process similarity to cluster open-source process designs
	Huang, K; Zhou, ZT; Han, YB; Li, G; Wang, J
	2004
发表期刊	GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS
ISSN	0302-9743
卷号	3252 页码:107-114
摘要	This paper proposes an algorithm for calculating process similarity in order to cluster process designs. A weighted graph is introduced for comparing processes in the intermediate form. The graph similarity is the weighted sum of similarity between sets of services and sets of service links that can be calculated based on the service similarity. The evaluation and application of the algorithm is discussed at the end of this paper.
收录类别	SCI
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000225062800014
出版者	SPRINGER-VERLAG BERLIN
引用统计	被引频次：13[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/13854
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Huang, K
作者单位	Chinese Acad Sci, Grad Sch, Inst Comp Technol, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Huang, K,Zhou, ZT,Han, YB,et al. An algorithm for calculating process similarity to cluster open-source process designs[J]. GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS,2004,3252:107-114.
APA	Huang, K,Zhou, ZT,Han, YB,Li, G,&Wang, J.(2004).An algorithm for calculating process similarity to cluster open-source process designs.GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS,3252,107-114.
MLA	Huang, K,et al."An algorithm for calculating process similarity to cluster open-source process designs".GRID AND COOPERATIVE COMPUTING GCC 2004 WORKSHOPS, PROCEEDINGS 3252(2004):107-114.