一个框架:基于工作流的社会网络发现与分析

Jihye Song, Minjoon Kim, Haksung Kim, K. Kim
{"title":"一个框架:基于工作流的社会网络发现与分析","authors":"Jihye Song, Minjoon Kim, Haksung Kim, K. Kim","doi":"10.1109/CSE.2010.74","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to build a fundamental framework of discovering and analyzing a workflow-based social network formed through workflow-based organizational business operations. A little more precisely speaking, the framework formalizes a series of theoretical steps from discovering a workflow-based social network to analyzing the discovered social network. For the sake of the discovery phase, we conceive an algorithm that is able to automatically discover the workflow-based social network from a workflow procedure; while on the other hand, in the analysis phase we apply the degree centrality algorithm to the discovered social network, which is one of the well-known social network analysis algorithms in the literature. Consequently, the crucial implication of the framework is in quantifying the degree of work-intimacy among performers who are involved in enacting the corresponding workflow procedure. Also, as a conceptual extension of the framework, it can be applied to discovering and analyzing d gree centrality or collaborative closeness and betweenness among architectural components and nodes of collaborative cloud workflow computing environments.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"A Framework: Workflow-Based Social Network Discovery and Analysis\",\"authors\":\"Jihye Song, Minjoon Kim, Haksung Kim, K. Kim\",\"doi\":\"10.1109/CSE.2010.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this paper is to build a fundamental framework of discovering and analyzing a workflow-based social network formed through workflow-based organizational business operations. A little more precisely speaking, the framework formalizes a series of theoretical steps from discovering a workflow-based social network to analyzing the discovered social network. For the sake of the discovery phase, we conceive an algorithm that is able to automatically discover the workflow-based social network from a workflow procedure; while on the other hand, in the analysis phase we apply the degree centrality algorithm to the discovered social network, which is one of the well-known social network analysis algorithms in the literature. Consequently, the crucial implication of the framework is in quantifying the degree of work-intimacy among performers who are involved in enacting the corresponding workflow procedure. Also, as a conceptual extension of the framework, it can be applied to discovering and analyzing d gree centrality or collaborative closeness and betweenness among architectural components and nodes of collaborative cloud workflow computing environments.\",\"PeriodicalId\":342688,\"journal\":{\"name\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2010.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2010.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

本文的目的是建立一个发现和分析通过基于工作流的组织业务操作形成的基于工作流的社会网络的基本框架。更准确地说,该框架形式化了从发现基于工作流的社交网络到分析发现的社交网络的一系列理论步骤。在发现阶段,我们设想了一种能够从工作流过程中自动发现基于工作流的社交网络的算法;另一方面,在分析阶段,我们对发现的社会网络应用度中心性算法,这是文献中比较知名的社会网络分析算法之一。因此,该框架的关键含义是量化参与制定相应工作流程的执行者之间的工作亲密程度。此外,作为框架的概念扩展,它可以用于发现和分析协同云工作流计算环境的架构组件和节点之间的度中心性或协作紧密性和之间性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Framework: Workflow-Based Social Network Discovery and Analysis
The purpose of this paper is to build a fundamental framework of discovering and analyzing a workflow-based social network formed through workflow-based organizational business operations. A little more precisely speaking, the framework formalizes a series of theoretical steps from discovering a workflow-based social network to analyzing the discovered social network. For the sake of the discovery phase, we conceive an algorithm that is able to automatically discover the workflow-based social network from a workflow procedure; while on the other hand, in the analysis phase we apply the degree centrality algorithm to the discovered social network, which is one of the well-known social network analysis algorithms in the literature. Consequently, the crucial implication of the framework is in quantifying the degree of work-intimacy among performers who are involved in enacting the corresponding workflow procedure. Also, as a conceptual extension of the framework, it can be applied to discovering and analyzing d gree centrality or collaborative closeness and betweenness among architectural components and nodes of collaborative cloud workflow computing environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Harmony Search Method Based on OBL GPU-RMAP: Accelerating Short-Read Mapping on Graphics Processors Fractional Exponent Coupling of RIO Optimizing Academic Conference Classification Using Social Tags Availability-Aware Cache Management with Improved RAID Reconstruction Performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1