Information Systems最新文献_第8页

SuperGuardian: Superspreader removal for cardinality estimation in data streaming 超级守护者在数据流中消除超级散布器以估算心率

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-02-17 DOI: 10.1016/j.is.2024.102351

Jie Lu , Hongchang Chen , Penghao Sun , Tao Hu , Zhen Zhang , Quan Ren

{"title":"SuperGuardian: Superspreader removal for cardinality estimation in data streaming","authors":"Jie Lu , Hongchang Chen , Penghao Sun , Tao Hu , Zhen Zhang , Quan Ren","doi":"10.1016/j.is.2024.102351","DOIUrl":"https://doi.org/10.1016/j.is.2024.102351","url":null,"abstract":"<div><p>Measuring flow cardinality is one of the fundamental problems in data stream mining, where a data stream is modeled as a sequence of items from different flows and the cardinality of a flow is the number of distinct items in the flow. Many existing sketches based on estimator sharing have been proposed to deal with huge flows in data streams. However, these sketches suffer from inefficient memory usage due to allocating the same memory size for each estimator without considering the skewed cardinality distribution. To address this issue, we propose SuperGuardian to improve the memory efficiency of existing sketches. SuperGuardian intelligently separates flows with high-cardinality from the data stream, and keeps the information of these flows with the large estimator, while using existing sketches with small estimators to record low-cardinality flows. We carry out a mathematical analysis for the cardinality estimation error of SuperGuardian. To validate our proposal, we have implemented SuperGuardian and conducted experimental evaluations using real traffic traces. The experimental results show that existing sketches using SuperGuardian reduce error by 79 % - 96 % and increase the throughput by 0.3–2.3 times.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102351"},"PeriodicalIF":3.7,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139986939","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 survey for managing temporal data in RDF 用 RDF 管理时态数据的调查

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-02-17 DOI: 10.1016/j.is.2024.102368

Di Wu , Hsien-Tseng Wang , Abdullah Uz Tansel

{"title":"A survey for managing temporal data in RDF","authors":"Di Wu , Hsien-Tseng Wang , Abdullah Uz Tansel","doi":"10.1016/j.is.2024.102368","DOIUrl":"10.1016/j.is.2024.102368","url":null,"abstract":"<div><p>The Internet serves not only as a platform for communication, transactions, and cloud storage, but also as a vast knowledge store where both people and machines can create, manipulate, infer, and utilize data and knowledge. The Semantic Web was developed to facilitate this purpose, enabling machines to understand the meaning of data and knowledge for use in decision-making. The Resource Description Framework (RDF) forms the foundation of the Semantic Web, which is organized into layers known as the Semantic Web Layer Cake. However, RDF’s basic construct is a binary relationship in the format of <span><math><mrow><mo><</mo><mi>s</mi><mi>u</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mspace></mspace><mi>p</mi><mi>r</mi><mi>e</mi><mi>d</mi><mi>i</mi><mi>c</mi><mi>a</mi><mi>t</mi><mi>e</mi><mspace></mspace><mi>o</mi><mi>b</mi><mi>j</mi><mi>e</mi><mi>c</mi><mi>t</mi><mo>></mo></mrow></math></span>. Representing higher-order relationships with RDF requires reification, which can be cumbersome. Time-varying data is prevalent, but cannot be adequately represented using only binary relationships. We conducted a detailed review of the literature on extending RDF with temporal data, comparing approaches for representation, querying, storage, implementation, and evaluation. In addition, we briefly reviewed approaches for extending RDF with spatial, probability, and other dimensions in conjunction with temporal data.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102368"},"PeriodicalIF":3.7,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139923467","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

Temporal representation and reasoning in data-intensive systems 数据密集型系统中的时态表示和推理

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-02-06 DOI: 10.1016/j.is.2024.102350

Alexander Artikis, Roberto Posenato, Stefano Tonetta

引用次数: 0

ArZiGo: A recommendation system for scientific articles ArZiGo：科学文章推荐系统

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-02-06 DOI: 10.1016/j.is.2024.102367

Iratxe Pinedo, Mikel Larrañaga, Ana Arruarte

{"title":"ArZiGo: A recommendation system for scientific articles","authors":"Iratxe Pinedo, Mikel Larrañaga, Ana Arruarte","doi":"10.1016/j.is.2024.102367","DOIUrl":"https://doi.org/10.1016/j.is.2024.102367","url":null,"abstract":"<div><p>The large number of scientific publications around the world is increasing at a rate of approximately 4%–5% per year. This fact has resulted in the need for tools that deal with relevant and high-quality publications. To address this necessity, search and reference management tools that include some recommendation algorithms have been developed. However, many of these solutions are proprietary tools and the full potential of recommender systems is rarely exploited. There are some solutions which provide recommendations for specific domains, by using ad-hoc resources. Furthermore, some other systems do not consider any personalization strategy to generate the recommendations. This paper presents <em>ArZiGo</em>, a web-based full prototype system for the search, management, and recommendation of scientific articles, which feeds on the Semantic Scholar Open Research Corpus, a corpus that is growing continually with more than 190M papers from all fields of science so far. <em>ArZiGo</em> combines different recommendation approaches within a hybrid system, in a configurable way, to recommend those papers that best suit the preferences of the users. A group of 30 human experts has participated in the evaluation of 500 recommendations in 10 research areas, 7 of which belong to the area of Computer Science and 3 to the area of Medicine, obtaining quite satisfactory results. Besides the appropriateness of the articles recommended, the execution time of the implemented algorithms has also been analyzed.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102367"},"PeriodicalIF":3.7,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306437924000255/pdfft?md5=1cc6db90e90efa1af108cb01ca199a19&pid=1-s2.0-S0306437924000255-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139731503","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

An improved context-aware weighted matrix factorization algorithm for point of interest recommendation in LBSN 用于 LBSN 中兴趣点推荐的改进型上下文感知加权矩阵因式分解算法

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-02-05 DOI: 10.1016/j.is.2024.102366

Xu Zhou , Zhuoran Wang , Xuejie Liu , Yanheng Liu , Geng Sun

{"title":"An improved context-aware weighted matrix factorization algorithm for point of interest recommendation in LBSN","authors":"Xu Zhou , Zhuoran Wang , Xuejie Liu , Yanheng Liu , Geng Sun","doi":"10.1016/j.is.2024.102366","DOIUrl":"https://doi.org/10.1016/j.is.2024.102366","url":null,"abstract":"<div><p>The point of interest (POI) recommendation algorithm in location based social network (LBSN) can assist people to find more appealing locations and satisfy their specific demands. However, it is challengeable to infer user’s preference due to the sparsity of the user’s check-in data. To address the problem and improve recommendation performance, this paper proposes an improved context-aware weighted matrix factorization algorithm for POI recommendation (ICWMF). It takes advantage of time factor, geographical information, and social relationship to obtain user’s preference for locations. Firstly, the Ebbinghaus forgetting curve is employed to model the influence of time attenuation, so as to reflect that user preferences change over time. In order to assign dynamic weights to unvisited POI and infer user preference, we build the implicit feedback term by modeling the geographical influence from user perspective and the social relationship. In addition, the Gaussian model is employed to construct proximity location relationship to represent the probability of locations being discovered by users. Then, it is taken as the regularization term to avoid overfitting. Finally, the objective function of weighted matrix factorization is reconstructed with the implicit feedback term and the regularization term we designed. ICWMF naturally learns two potential feature matrices during weighted matrix decomposition based on new designed objective function to achieve better recommendation results. The results of simulation experiments on Brightkite and Gowalla dataset indicate that ICWMF outperforms other four comparison methods in terms of precision and recall.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102366"},"PeriodicalIF":3.7,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306437924000243/pdfft?md5=820111c51793f02a204ed785f84b746b&pid=1-s2.0-S0306437924000243-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139719595","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

Model repair supported by frequent anomalous local instance graphs 频繁异常局部实例图支持模型修复

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-01-29 DOI: 10.1016/j.is.2024.102349

Laura Genga , Fabio Rossi , Claudia Diamantini , Emanuele Storti , Domenico Potena

{"title":"Model repair supported by frequent anomalous local instance graphs","authors":"Laura Genga , Fabio Rossi , Claudia Diamantini , Emanuele Storti , Domenico Potena","doi":"10.1016/j.is.2024.102349","DOIUrl":"10.1016/j.is.2024.102349","url":null,"abstract":"<div><p>Model repair techniques aim at automatically updating a process model to incorporate behaviors that are observed in reality but are not compliant with the original model. Most state-of-the-art techniques focus on the fitness of the repaired models, with the goal of including single anomalous behaviors observed in a log in the form of the events. This often hampers the precision of the obtained models, which end up allowing much more behaviors than intended. In the quest of techniques avoiding this over-generalization pitfall, some notion of higher-level anomalous structure is taken into account. The type of structure considered is however typically limited to sequences of low-level events. In this work, we introduce a novel repair approach targeting more general high-level anomalous structures. To do this, we exploit instance graph representations of anomalous behaviors, that can be derived from the event log and the original process model. Our experiments show that considering high-level anomalies allows to generate repaired models that incorporate the behaviors of interest while maintaining precision and simplicity closer to the original model.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102349"},"PeriodicalIF":3.7,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306437924000073/pdfft?md5=e6a9000a2b961598d7bb3c3022cb43d2&pid=1-s2.0-S0306437924000073-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139587015","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

Corrigendum to “BPMN 2.0 OR-Join Semantics: Global and local characterisation” [Information Systems 105 (2022), 101934] BPMN 2.0 OR-Join 语义：全局和局部特征" [Information Systems 105 (2022), 101934] （信息系统 105 (2022), 101934

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-01-26 DOI: 10.1016/j.is.2023.102319

Asvin Goel

引用次数: 0

Paraconsistent reasoning for inconsistency measurement in declarative process specifications 用于测量声明式流程规范中不一致性的旁证推理

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-01-24 DOI: 10.1016/j.is.2024.102347

Carl Corea , Isabelle Kuhlmann , Matthias Thimm , John Grant

{"title":"Paraconsistent reasoning for inconsistency measurement in declarative process specifications","authors":"Carl Corea , Isabelle Kuhlmann , Matthias Thimm , John Grant","doi":"10.1016/j.is.2024.102347","DOIUrl":"10.1016/j.is.2024.102347","url":null,"abstract":"<div><p>Inconsistency is a core problem in fields such as AI and data-intensive systems. In this work, we address the problem of <em>measuring</em> inconsistency in declarative process specifications, with an emphasis on linear temporal logic (LTL). As we will show, existing inconsistency measures for classical logic cannot provide a meaningful assessment of inconsistency in LTL in general, as they cannot adequately handle the temporal operators. We therefore propose a novel paraconsistent semantics for LTL over fixed traces (LTL<span><math><msub><mrow></mrow><mrow><mtext>ff</mtext></mrow></msub></math></span>) as a framework for time-sensitive inconsistency measurement. We develop and implement novel approaches for (element-based) inconsistency measurement, and propose a novel semantics for reasoning in LTL<span><math><msub><mrow></mrow><mrow><mtext>ff</mtext></mrow></msub></math></span> in the presence of preference relations between formulas. We implement our approach for inconsistency measurement with Answer Set Programming and evaluate our results with real-life data sets from the Business Process Intelligence Challenge.</p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102347"},"PeriodicalIF":3.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139551647","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

Enterprise sellers’ satisfaction with business-to-business cross-border e-commerce platforms: Alibaba.com as an example 企业卖家对企业对企业跨境电子商务平台的满意度：以阿里巴巴网站为例

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-01-24 DOI: 10.1016/j.is.2024.102348

Jhong-Min Yang , Yu-Xin Xiang , Chi-Wen Liu

引用次数: 0

Secure multi-dimensional data retrieval with access control and range query in the cloud 在云中通过访问控制和范围查询进行安全的多维数据检索

IF 3.7 2区计算机科学

Information Systems Pub Date : 2024-01-23 DOI: 10.1016/j.is.2024.102343

Zhuolin Mei , Jin Yu , Caicai Zhang , Bin Wu , Shimao Yao , Jiaoli Shi , Zongda Wu

{"title":"Secure multi-dimensional data retrieval with access control and range query in the cloud","authors":"Zhuolin Mei , Jin Yu , Caicai Zhang , Bin Wu , Shimao Yao , Jiaoli Shi , Zongda Wu","doi":"10.1016/j.is.2024.102343","DOIUrl":"10.1016/j.is.2024.102343","url":null,"abstract":"<div><p><span>Outsourcing data to the cloud offers various advantages, such as improved reliability, enhanced flexibility, accelerated deployment, and so on. However, data security concerns arise due to potential threats such as malicious attacks and internal misuse of privileges, resulting in data leakage. </span>Data encryption<span> is a recognized solution to address these issues and ensure data confidentiality<span><span> even in the event of a breach. However, encrypted data presents challenges for common operations like access control and range queries. To address these challenges, this paper proposes Secure Multi-dimensional Data Retrieval with Access Control and Range Search in the Cloud (SMDR). In this paper, we propose SMDR policy, which supports both access control and range queries. The design of the SMDR policy cleverly utilizes the minimum and maximum points of buckets, enabling the SMDR policy is highly appropriate for supporting range queries on multi-dimensional data. Additionally, we have made modifications to </span>Ciphertext Policy-Attribute Based Encryption (CP-ABE) to enable effective integration with the SMDR policy, and then constructed a secure index using the SMDR policy and CP-ABE. By utilizing the secure index, access control and range queries can be effectively supported over the encrypted multi-dimensional data. To evaluate the efficiency of SMDR, extensive experiments have been conducted. The experimental results demonstrate the effectiveness and suitability of SMDR in handling encrypted multi-dimensional data. Additionally, we provide a detailed security analysis of SMDR.</span></span></p></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"122 ","pages":"Article 102343"},"PeriodicalIF":3.7,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139551969","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