Information Systems最新文献_第10页

GSM: A generalized approach to Supervised Meta-blocking for scalable entity resolution 一种用于可扩展实体解析的监督元阻塞的通用方法

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-17 DOI: 10.1016/j.is.2023.102307

Luca Gagliardelli , George Papadakis , Giovanni Simonini , Sonia Bergamaschi , Themis Palpanas

{"title":"GSM: A generalized approach to Supervised Meta-blocking for scalable entity resolution","authors":"Luca Gagliardelli , George Papadakis , Giovanni Simonini , Sonia Bergamaschi , Themis Palpanas","doi":"10.1016/j.is.2023.102307","DOIUrl":"https://doi.org/10.1016/j.is.2023.102307","url":null,"abstract":"<div><p>Entity Resolution (ER) constitutes a core data integration task that relies on Blocking in order to tame its quadratic time complexity. Schema-agnostic blocking achieves very high recall, requires no domain knowledge and applies to data of any structuredness and schema heterogeneity. This comes at the cost of many irrelevant candidate pairs (i.e., comparisons), which can be significantly reduced through Meta-blocking techniques, i.e., techniques that leverage the co-occurrence patterns of entities inside the blocks: first, a weighting scheme assigns a score to every pair of candidate entities in proportion to the likelihood that they are matching and then, a pruning algorithm discards the pairs with the lowest scores. Supervised Meta-blocking goes beyond this approach by combining multiple scores per comparison into a feature vector that is fed to a binary classifier. By using probabilistic classifiers, Generalized Supervised Meta-blocking associates every pair of candidates with a score that can be used: <em>(i)</em> by any pruning algorithm for retaining the set of candidate comparisons; and <em>(ii)</em> by state-of-the-art progressive ER methods to identify the most promising candidates as early as possible (when time is a critical component for the downstream applications that consume the data). For higher effectiveness, new weighting schemes are examined as features. Through an extensive experimental analysis, we identify the best pruning algorithms, their optimal sets of features as well as the minimum possible size of the training set. The resulting approaches achieve excellent performance across several established benchmark datasets.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306437923001436/pdfft?md5=d13ea8d3cba53c027d1df8065d1feffc&pid=1-s2.0-S0306437923001436-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92033617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A taxonomy and ontology for digital platforms 数字平台的分类和本体

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-10 DOI: 10.1016/j.is.2023.102293

Thomas Derave , Frederik Gailly , Tiago Prince Sales , Geert Poels

{"title":"A taxonomy and ontology for digital platforms","authors":"Thomas Derave , Frederik Gailly , Tiago Prince Sales , Geert Poels","doi":"10.1016/j.is.2023.102293","DOIUrl":"https://doi.org/10.1016/j.is.2023.102293","url":null,"abstract":"<div><p>In academic literature and in business communication digital platforms are categorized into different types including, but not limited to, multi-sided platform, digital marketplace, on-demand platform and sharing economy platform. Observing the substantial literature on these platform types, both in academia and professional contexts, there is lack of consensus on the definition of these digital platform types. On top of that, there is a lack of knowledge in the literature on the requirements and design of these digital platform types. We address the observed lack of shared conceptualizations by creating a taxonomy for digital platforms, by classifying digital platforms according to their distinctive features. Further, we address the lack of design knowledge with a digital platform reference ontology that describes the construction and operation of the different types of digital platform that are distinguished in the taxonomy. This reference ontology, developed using the Unified Foundational Ontology (UFO) and several of its core ontologies, is organized into different ontology modules, allowing to describe functionalities that are common to any digital platform and more specific functionalities that have their origin in the distinctive features that were used to construct the taxonomy. The taxonomy that we contribute helps to clearly define the different types of digital platform that can be observed today. It also helps analysing further evolutions in the platform domain. The contribution of a well-founded digital platform reference ontology is a step towards a better understanding of digital platform functionality, better communication between stakeholders, and eventually may facilitate future research and development of new types of digital platform.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49722328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Discovery, simulation, and optimization of business processes with differentiated resources 发现、模拟和优化具有差异化资源的业务流程

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-09 DOI: 10.1016/j.is.2023.102289

Orlenys López-Pintado, Marlon Dumas, Jonas Berx

{"title":"Discovery, simulation, and optimization of business processes with differentiated resources","authors":"Orlenys López-Pintado, Marlon Dumas, Jonas Berx","doi":"10.1016/j.is.2023.102289","DOIUrl":"https://doi.org/10.1016/j.is.2023.102289","url":null,"abstract":"<div><p>Business process simulation is a versatile technique to predict the impact of one or more changes on the performance of a process. Process simulation is often used to identify sets of changes that optimize one or more performance measures. Mainstream approaches to process simulation suffer from various limitations, some stemming from the fact that they treat resources as undifferentiated entities grouped into resource pools, and then assuming that all resources in a pool have the same performance and share the same availability calendars. Previous studies have acknowledged these assumptions, without quantifying their impact on simulation model accuracy. This article addresses this gap in the context of simulation models automatically discovered from event logs. Specifically, the contribution of the article is three-fold. First, the article proposes a simulation approach, wherein each resource is treated as an individual entity, with its own performance and availability calendar. Second, it proposes a method for discovering simulation models with differentiated performance and availability, starting from an event log of a business process. Third, it proposes a method to optimize the resource availability calendars in order to minimize resource cost while also minimizing cycle times. An empirical evaluation shows that simulation models with differentiated resources more closely replicate the distributions of cycle times and the work rhythm in a process than models with undifferentiated resources, and that iteratively optimizing resource allocations in conjunction with resource calendars leads to superior cost–time tradeoffs with respect to optimizing these allocations and calendars separately.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49736851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reinforcement learning with time intervals for temporal knowledge graph reasoning 时态知识图推理的时间间隔强化学习

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-07 DOI: 10.1016/j.is.2023.102292

Ruinan Liu , Guisheng Yin , Zechao Liu , Ye Tian

{"title":"Reinforcement learning with time intervals for temporal knowledge graph reasoning","authors":"Ruinan Liu , Guisheng Yin , Zechao Liu , Ye Tian","doi":"10.1016/j.is.2023.102292","DOIUrl":"https://doi.org/10.1016/j.is.2023.102292","url":null,"abstract":"<div><p>Temporal reasoning methods have been successful in temporal knowledge graphs (TKGs) and are widely employed in many downstream application areas. Most existing TKG reasoning models transform time intervals into continuous time snapshots, with each snapshot representing a subgraph of the TKG. Although such processing can produce satisfactory outcomes, it ignores the integrity of a time interval and increases the amount of data. Meanwhile, many previous works focuses on the logic of sequentially occurring facts, disregarding the complex temporal logics of various time intervals. Consequently, we propose a <strong>R</strong>einforcement Learning-based Model for <strong>T</strong>emporal Knowledge Graph Reasoning with <strong>T</strong>ime <strong>I</strong>ntervals (RTTI), which focuses on time-aware multi-hop reasoning arising from complex time intervals. In RTTI, we construct the time learning part to obtain the time embedding of the current path. It simulates the temporal logic with relation historical encoding and compute the time interval between two facts through the temporal logic feature matrix. Furthermore, we propose a new method for representing time intervals that breaks the original time interval embedding method, and express the time interval using median and embedding changes of two timestamps. We evaluate RTTI on four public TKGs for the link prediction task, and experimental results indicate that our approach can still perform well on more complicated tasks. Meanwhile, our method can search for more interpretable paths in the broader space and improve the reasoning ability in sparse spaces.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49722333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Medoid Silhouette clustering with automatic cluster number selection 中间轮廓聚类与自动簇数选择

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-06 DOI: 10.1016/j.is.2023.102290

Lars Lenssen, Erich Schubert

{"title":"Medoid Silhouette clustering with automatic cluster number selection","authors":"Lars Lenssen, Erich Schubert","doi":"10.1016/j.is.2023.102290","DOIUrl":"https://doi.org/10.1016/j.is.2023.102290","url":null,"abstract":"<div><p>The evaluation of clustering results is difficult, highly dependent on the evaluated data set and the perspective of the beholder. There are many different clustering quality measures, which try to provide a general measure to validate clustering results. A very popular measure is the Silhouette. We discuss the efficient medoid-based variant of the Silhouette, perform a theoretical analysis of its properties, provide two fast versions for the direct optimization, and discuss the use to choose the optimal number of clusters. We combine ideas from the original Silhouette with the well-known PAM algorithm and its latest improvements FasterPAM. One of the versions guarantees equal results to the original variant and provides a run speedup of <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>. In experiments on real data with 30000 samples and <span><math><mrow><mi>k</mi><mo>=</mo></mrow></math></span> 100, we observed a 10464<span><math><mo>×</mo></math></span> speedup compared to the original PAMMEDSIL algorithm. Additionally, we provide a variant to choose the optimal number of clusters directly.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49722327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

AI-based decision support system for public procurement 基于人工智能的公共采购决策支持系统

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-01 DOI: 10.1016/j.is.2023.102284

Lucia Siciliani , Vincenzo Taccardi , Pierpaolo Basile , Marco Di Ciano , Pasquale Lops

引用次数: 0

Supervisory control of business processes with resources, parallel and mutually exclusive branches, loops, and uncertainty 对具有资源、并行和互斥分支、循环和不确定性的业务流程进行监督控制

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-01 DOI: 10.1016/j.is.2023.102288

Davide Bresolin, Matteo Zavatteri

{"title":"Supervisory control of business processes with resources, parallel and mutually exclusive branches, loops, and uncertainty","authors":"Davide Bresolin, Matteo Zavatteri","doi":"10.1016/j.is.2023.102288","DOIUrl":"https://doi.org/10.1016/j.is.2023.102288","url":null,"abstract":"<div><p>A recent direction in <em>Business Process Management</em> studied methodologies to control the execution of <em>Business Processes</em> under several sources of uncertainty in order to always get to the end by satisfying all constraints. Current approaches encode business processes into temporal constraint networks or timed game automata in order to exploit their related strategy synthesis algorithms. However, the proposed encodings can only synthesize <em>single</em>-strategies and fail to handle loops. To overcome these limits we propose an approach based on <em>supervisory control</em>. We consider <em>structured business processes</em> with resources, parallel and mutually exclusive branches, loops, and uncertainty. We provide an encoding into finite state automata and prove that their concurrent behavior models exactly all possible executions of the process. After that, we introduce <em>tentative commitment constraints</em> as a new class of constraints restricting the executions of a process. We define a tree decomposition of the process that plays a central role in modular supervisory control, and we prove that this modular approach is equivalent to the monolithic one. We provide an algorithm to compute the <em>finest tree decomposition</em> to reduce the computational effort of synthesizing supervisors.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49717380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A review on missing values for main challenges and methods 主要挑战和方法的缺失值综述

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-01 DOI: 10.1016/j.is.2023.102268

Lijuan Ren , Tao Wang , Aicha Sekhari Seklouli , Haiqing Zhang , Abdelaziz Bouras

{"title":"A review on missing values for main challenges and methods","authors":"Lijuan Ren , Tao Wang , Aicha Sekhari Seklouli , Haiqing Zhang , Abdelaziz Bouras","doi":"10.1016/j.is.2023.102268","DOIUrl":"10.1016/j.is.2023.102268","url":null,"abstract":"<div><p>Several recent reviews summarize common missing value analysis methods. However, none of them provide a systematic and in-depth summary of the analytical challenges and solutions for dealing with missing values. For the purpose of guiding the handling of missing values, this review aims to consolidate current developments in novel missing-value research methodologies. In particular, we comprehensively investigated cutting-edge missing value solutions and methodically studied the main challenges associated with missing values analysis (missing mechanisms, missing patterns, and missing rates). Furthermore, we reviewed 63 publications that compare different strategies for deleting and imputing missing values. Then we investigated data characteristics, highlighted three main problems when analyzing missing values, and analyzed the performance of missing value solutions in these studied papers. Moreover, we conducted comprehensive experiments on 9 public datasets using typical missing value processing methods and provided a simple guided decision tree for handling missing values. Finally, we described current Research hotspots and open challenges, which give potential research topics.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49445145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Data augmentation via context similarity: An application to biomedical Named Entity Recognition 基于上下文相似性的数据增强:在生物医学命名实体识别中的应用

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-01 DOI: 10.1016/j.is.2023.102291

Ilaria Bartolini , Vincenzo Moscato , Marco Postiglione , Giancarlo Sperlì , Andrea Vignali

引用次数: 1

Dynamic sales prediction with auto-learning and elastic-adjustment mechanism for inventory optimization 基于自动学习和弹性调整机制的动态销售预测，用于库存优化

IF 3.7 2区计算机科学

Information Systems Pub Date : 2023-10-01 DOI: 10.1016/j.is.2023.102259

Daifeng Li , Fengyun Gu , Xin Li , Ruo Du , Dingquan Chen , Andrew Madden

{"title":"Dynamic sales prediction with auto-learning and elastic-adjustment mechanism for inventory optimization","authors":"Daifeng Li , Fengyun Gu , Xin Li , Ruo Du , Dingquan Chen , Andrew Madden","doi":"10.1016/j.is.2023.102259","DOIUrl":"10.1016/j.is.2023.102259","url":null,"abstract":"<div><p>The ability to predict product sales is invaluable for improving enterprises’ routine decisions of inventory optimization. The most effective solution of sales prediction in real applications is ensemble learning. One challenge of the solution is that it is hard to make timely and accurate predictions because of inadequate decision information and complicated and changeable sales environments. Besides, seeking optimal model combinations from the candidate set is often inaccurate and time-consuming. Another important challenge is that the predicted sales seldom consider “replenishment” of the inventory, which may lead to even higher cost. To address the challenges, we propose a novel dynamic sales prediction model with Auto-Learning and Elastic-Adjustment mechanisms (DSP-FAE): Dynamic sales prediction model can capture dynamic changing patterns of sales time series more effectively. Auto-Learning is used to automatically customize the optimal ensemble learning strategy for each warehouse-product combination in a more efficient way. Elastic-Adjustment is proposed to design a deep neural network-based adjustment factor to correct the predicted sales, which can significantly reduce inventory costs. Extensive offline and online experiments are conducted to verify the performance of the proposed model on two real-world datasets: Galanz and Cainiao. Experimental results show that the proposed DSP-FAE performs better than the selected 10 state-of-the-art baselines significantly in terms of MAE, RRSE and CORR. More importantly, it can save more than 20% inventory cost compared with traditional solutions.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":null,"pages":null},"PeriodicalIF":3.7,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47502004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0