2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)最新文献_第10页

PSM-Flow: Probabilistic Subgraph Mining for Discovering Reusable Fragments in Workflows PSM-Flow:发现工作流中可重用片段的概率子图挖掘

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.00-93

Chin Wang Cheong, D. Garijo, Kwok Cheung, Y. Gil

{"title":"PSM-Flow: Probabilistic Subgraph Mining for Discovering Reusable Fragments in Workflows","authors":"Chin Wang Cheong, D. Garijo, Kwok Cheung, Y. Gil","doi":"10.1109/WI.2018.00-93","DOIUrl":"https://doi.org/10.1109/WI.2018.00-93","url":null,"abstract":"Scientific workflows define computational processes needed for carrying out scientific experiments. Existing workflow repositories contain hundreds of scientific workflows, where scientists can find materials and knowledge to facilitate workflow design for running related experiments. Identifying reusable fragments in growing workflow repositories has become increasingly important. In this paper, we present PSM-Flow, a probabilistic subgraph mining algorithm designed to discover commonly occurring fragments in a workflow corpus using a modified version of the Latent Dirichlet Allocation algorithm. The proposed model encodes the geodesic distance between workflow steps into the model for implicitly modeling fragments. PSM-Flow captures variations of frequent fragments while maintaining its space complexity bounded polynomially, as it requires no candidate generation. We applied PSM-Flow to three real-world scientific workflow datasets containing more than 750 workflows for neuroimaging analysis. Our results show that PSM-Flow outperforms three state of the art frequent subgraph mining techniques. We also discuss other potential future improvements of the proposed method.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Proposed Computational Classification System of Human Cognitive Biases 人类认知偏差的计算分类系统

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.00013

Bryan Boots

{"title":"Proposed Computational Classification System of Human Cognitive Biases","authors":"Bryan Boots","doi":"10.1109/WI.2018.00013","DOIUrl":"https://doi.org/10.1109/WI.2018.00013","url":null,"abstract":"Despite our aspirations to do so, we humans don't always make optimal or rational decisions. Researchers from psychology, behavioral economics, anthropology, decision sciences, and other related fields have described many human cognitive biases which help to explain such decisions. Most of the time, these cognitive biases are relatively harmless and relatively costless. However, sometimes they do result in significant costs to individuals, companies, governments and societies in the form of wasted or misdirected money, time, effort, and sometimes even in the form of lives lost. The antidote to such decisions has long been recognized to lie in algorithmic decision making. Until relatively recently, though, requirements and complexity of such algorithms have limited their deployment in real-world situations. However, we now enjoy a convergence of computing power, decrease in computing costs, and computational and predictive methods born of data science, artificial intelligence (AI), and machine learning (ML), such that we can begin to mitigate some of the most negative effects of some of these cognitive biases. This paper proposes a method for classifying these human cognitive biases for purposes of mitigation by means of computing methods, describes some of these biases that are most ripe for mitigation through computing, and proposes future research directions that build upon this work.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116977960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Cross-Language Information Retrieval Based on Multiple Information 基于多信息的跨语言信息检索

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.00-26

Pengyuan Liu, Zhijun Zheng, Qi Su

引用次数: 1

When Blockchain Meets the Right to Be Forgotten: Technology versus Law in the Healthcare Industry 当区块链遇到被遗忘的权利:医疗行业的技术与法律

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.00133

Aurelie Bayle, Mirko Koscina, D. Manset, Octavio Perez-Kempner

引用次数: 27

Towards Automated Contract Handling 迈向自动处理合约

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.000-4

R. Schumann, Audrey Dupont, Yvan Betrisey

引用次数: 0

Bayesian Knowledge Base Distance-Based Tuning 基于贝叶斯知识库距离的调优

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.0-106

Chase Yakaboski, E. Santos

{"title":"Bayesian Knowledge Base Distance-Based Tuning","authors":"Chase Yakaboski, E. Santos","doi":"10.1109/WI.2018.0-106","DOIUrl":"https://doi.org/10.1109/WI.2018.0-106","url":null,"abstract":"In order to rigorously characterize the difference or similarity between two probabilistic knowledge bases, a distance/divergence metric must be established. This becomes increasingly important when conducting parameter learning or tuning of a knowledge base. When tuning a knowledge base, it is essential to characterize the global probabilistic belief change as the knowledge base is tuned to ensure the underlying probability distribution of the knowledge base is not drastically compromised. In this paper, we develop an entropy-based distance measure for a Bayesian Knowledge Base (BKB) derived from the Chan-Darwiche distance measure used in a variety of probabilistic belief network analyses. Through this distance measure it is possible to calculate the theoretical minimum distance required to correct a BKB when the system's answer contradicts that of an expert. Having a theoretical minimization limit on distance allows for a quick calculation to test the integrity of either the BKB or the expert's judgement, since a high minimum distance would suggest the necessary tuning is not consistent with the rest of the knowledge base. Further still, this distance measure can be used to prove that in some cases the standard single causal rule set BKB tuning procedure (discussed in our prior work) in fact minimizes the global BKB distance. The final portion of this paper presents a few practical examples which analyze the utility of the BKB distance measure along with evidence supporting the proposition that the Causal Rule Set tuning procedure minimizes the distance between the original and tuned knowledge base in many cases.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Analysis of Political Party Twitter Accounts' Retweeters during Japan's 2017 Election 2017年日本大选期间政党推特账户转发者分析

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.000-2

Mitsuo Yoshida, F. Toriumi

引用次数: 7

WI 2018 Organizing Committee WI 2018组委会

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/wi.2018.00006

引用次数: 0

MAS-Aided Approval for Bypassing Decentralized Processes: an Architecture 绕过分散过程的mas辅助批准:一个体系结构

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.000-6

Timotheus Kampik, A. Najjar, D. Calvaresi

{"title":"MAS-Aided Approval for Bypassing Decentralized Processes: an Architecture","authors":"Timotheus Kampik, A. Najjar, D. Calvaresi","doi":"10.1109/WI.2018.000-6","DOIUrl":"https://doi.org/10.1109/WI.2018.000-6","url":null,"abstract":"Executing business processes in a decentralized manner can improve inter-organizational efficacy. For example, blockchain-based process execution allows, at least conceptually, for cross-organizational compatibility, data integration, and integrity assurance without the need for a centralized trusted operator. However, most business processes run in agile and rapidly changing business environments. Updating a decentralized process requires continuous and extensive consensus-building efforts. Reflecting all organizations' business requirements is hardly practicable. Hence, in many real-life scenarios, to support cases with initially unforeseen properties, organizations can allow to bypass the decentralized process and fall-back to local variants. Yet, the decision to bypass or update a given process can have significant social implications since it may encourage a social dynamic that encourages collective avoidance of the decentralized process. This paper proposes a multi-agent simulation system to assess the social consequences of approving a bypass under given conditions. The proposed simulation is intended to inform the decision-maker (human or machine) on whether to allow to bypass a process or not. Moreover, we present an architecture for the integration of multi-agent simulation system, local process engine, and decentralized process execution environment, and describe a possible implementation with a particular tool chain.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114837284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

PubTag: Generating Research Tag-Clouds with Keyphrase Extraction and Learning-to-Rank PubTag:利用关键词提取和排序学习生成研究标签云

2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2018-12-01 DOI: 10.1109/WI.2018.00-12

Paula Rios, A. Hogan

引用次数: 1