当前期刊: Information Systems Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Comprehending 3D and 4D ontology-driven conceptual models: An empirical study
    Inform. Syst. (IF 2.066) Pub Date : 2020-06-03
    Michaël Verdonck; Frederik Gailly; Sergio de Cesare

    This paper presents an empirical study that investigates the extent to which the pragmatic quality of ontology-driven models is influenced by the choice of a particular ontology, given a certain understanding of that ontology. To this end, we analyzed previous research efforts and distilled three hypotheses based on different metaphysical characteristics. An experiment based on two foundational ontologies

    更新日期:2020-06-03
  • Continuous outlier mining of streaming data in flink
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-29
    Theodoros Toliopoulos; Anastasios Gounaris; Kostas Tsichlas; Apostolos Papadopoulos; Sandra Sampaio

    In this work, we focus on distance-based outliers in a metric space, where the status of an entity as to whether it is an outlier is based on the number of other entities in its neighborhood. In recent years, several solutions have tackled the problem of distance-based outliers in data streams, where outliers must be mined continuously as new elements become available. An interesting research problem

    更新日期:2020-05-29
  • Scenario-based process querying for compliance, reuse, and standardization
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-27
    Artem Polyvyanyy; Anastasiia Pika; Arthur H. M. ter Hofstede

    Process models constitute valuable artifacts for organizations. A process model formally captures the way an organization works internally and interacts with its customers and partners. Over time, more models may be created as business practices evolve (leading to different versions of models) or an organization expands, e.g., through mergers or acquisitions. It is not uncommon for large organizations

    更新日期:2020-05-27
  • Three-dimensional Entity Resolution with JedAI
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-27
    George Papadakis; George Mandilaras; Luca Gagliardelli; Giovanni Simonini; Emmanouil Thanos; George Giannakopoulos; Sonia Bergamaschi; Themis Palpanas; Manolis Koubarakis

    Entity Resolution (ER) is the task of detecting different entity profiles that describe the same real-world objects. To facilitate its execution, we have developed JedAI, an open-source system that puts together a series of state-of-the-art ER techniques that have been proposed and examined independently, targeting parts of the ER end-to-end pipeline. This is a unique approach, as no other ER tool

    更新日期:2020-05-27
  • Sports analytics — Evaluation of basketball players and team performance
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-23
    Vangelis Sarlis; Christos Tjortjis

    Given the recent trend in Data Science (DS) and Sports Analytics, an opportunity has arisen for utilizing Machine Learning (ML) and Data Mining (DM) techniques in sports. This paper reviews background and advanced basketball metrics used in National Basketball Association (NBA) and Euroleague games. The purpose of this paper is to benchmark existing performance analytics used in the literature for

    更新日期:2020-05-23
  • Scalable alignment of process models and event logs: An approach based on automata and S-components
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-22
    Daniel Reißner; Abel Armas-Cervantes; Raffaele Conforti; Marlon Dumas; Dirk Fahland; Marcello La Rosa

    Given a model of the expected behavior of a business process and given an event log recording its observed behavior, the problem of business process conformance checking is that of identifying and describing the differences between the process model and the event log. A desirable feature of a conformance checking technique is that it should identify a minimal yet complete set of differences. Existing

    更新日期:2020-05-22
  • Eras: Improving the quality control in the annotation process for Natural Language Processing tasks
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-21
    Jonatas S. Grosman; Pedro H.T. Furtado; Ariane M.B. Rodrigues; Guilherme G. Schardong; Simone D.J. Barbosa; Hélio C.V. Lopes

    The increasing amount of valuable, unstructured textual information poses a major challenge to extract value from those texts. We need to use NLP (Natural Language Processing) techniques, most of which rely on manually annotating a large corpus of text for its development and evaluation. Creating a large annotated corpus is laborious and requires suitable computational support. There are many annotation

    更新日期:2020-05-21
  • DMAKit: A user-friendly web platform for bringing state-of-the-art data analysis techniques to non-specific users
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-16
    David Medina-Ortiz; Sebastián Contreras; Cristofer Quiroz; Juan A. Asenjo; Álvaro Olivera-Nappa
    更新日期:2020-05-16
  • Vadalog: A modern architecture for automated reasoning with large knowledge graphs
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-11
    Luigi Bellomarini; Davide Benedetto; Georg Gottlob; Emanuel Sallinger

    The introduction of novel Datalog +/- fragments with good theoretical properties, together with the growing use of enterprise knowledge graphs motivated the development of Vadalog, a knowledge graph management system developed at the University of Oxford. It adopts Warded Datalog +/- as the core of its language for knowledge representation and reasoning, which exhibits a very good tradeoff between

    更新日期:2020-05-11
  • Process discovery with context-aware process trees
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-08
    Roee Shraga; Avigdor Gal; Dafna Schumacher; Arik Senderovich; Matthias Weidlich

    Discovery plays a key role in data-driven analysis of business processes. The vast majority of contemporary discovery algorithms aims at the identification of control-flow constructs. The increase in data richness, however, enables discovery that incorporates the context of process execution beyond the control-flow perspective. A “control-flow first” approach, where context data serves for refinement

    更新日期:2020-05-08
  • SchemaDecrypt++: Parallel on-line Versioned Schema Inference for Large Semantic Web Data sources
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-06
    Kenza Kellou-Menouer; Zoubida Kedad

    A growing number of linked data sources are published on the Web. They form a single huge data space referred to as the Web of data. These data sources contain both the data and the schema describing them, but the data is not constrained by this schema. Indeed, two instances of the same class may be described by different properties. This flexibility for describing the data eases their evolution, but

    更新日期:2020-05-06
  • Explaining data with descriptions
    Inform. Syst. (IF 2.066) Pub Date : 2020-05-04
    Matteo Paganelli; Paolo Sottovia; Antonio Maccioni; Matteo Interlandi; Francesco Guerra

    With the advent of Big Data, it is impossible for a human user to properly inspect and understand data at a glance. In this paper, we introduce the problem of generating data descriptions: a set of compact, readable and insightful formulas of boolean predicates that represents a set of data records. Unfortunately, finding the best description for a dataset is both NP-hard and task-specific. Therefore

    更新日期:2020-05-04
  • Recommender systems for smart cities
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-28
    Lara Quijano-Sánchez; Iván Cantador; María E. Cortés-Cediel; Olga Gil

    Among other conceptualizations, smart cities have been defined as functional urban areas articulated by the use of Information and Communication Technologies (ICT) and modern infrastructures to face city problems in efficient and sustainable ways. Within ICT, recommender systems are strong tools that filter relevant information, upgrading the relations between stakeholders in the polity and civil society

    更新日期:2020-04-28
  • Evaluation of factors contributing to the failure of information systems in public universities: The case of Iran
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-24
    Siamak Kheybari; Fariba Mahdi Rezaie; S. Ali Naji; Mahsa Javdanmehr; Jafar Rezaei

    In this paper, we evaluate the reasons for the failure of information systems in public universities. To that end, we start by presenting a hierarchical structure of criteria after reviewing related studies, and dividing the criteria into the categories of project management, organizational management, human-related, organizational and technical. To assess the weight of the criteria in the proposed

    更新日期:2020-04-24
  • Automatic latent street type discovery from web open data
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-24
    Yihong Zhang; Panote Siriaraya; Yukiko Kawai; Adam Jatowt

    Street categorization is an important topic in urban planning and in various applications such as routing and environment monitoring. Typically streets are classified as commercial, residential, and industrial. However, such broad categorization is insufficient to capture the rich properties a street may possess, and often cannot be used for specific applications. Previous works have proposed several

    更新日期:2020-04-24
  • Community-diversified influence maximization in social networks
    Inform. Syst. (IF 2.066) Pub Date : 2020-03-26
    Jianxin Li; Taotao Cai; Ke Deng; Xinjue Wang; Timos Sellis; Feng Xia

    To meet the requirement of social influence analytics in various applications, the problem of influence maximization has been studied in recent years. The aim is to find a limited number of nodes (i.e., users) which can activate (i.e. influence) the maximum number of nodes in social networks. However, the community diversity of influenced users is largely ignored even though it has unique value in

    更新日期:2020-04-21
  • Efficient processing of reverse nearest neighborhood queries in spatial databases
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-13
    Md. Saiful Islam; Bojie Shen; Can Wang; David Taniar; Junhu Wang

    This paper presents a novel query for spatial databases, called reverse nearest neighborhood (RNH) query, to discover the neighborhoods that find a query facility as their nearest facility among other facilities in the dataset. Unlike a reverse nearest neighbor (RNN) query, an RNH query emphasizes on group of users instead of an individual user. More specifically, given a set of user locations U, a

    更新日期:2020-04-21
  • A-BI+: A framework for Augmented Business Intelligence
    Inform. Syst. (IF 2.066) Pub Date : 2020-03-14
    Matteo Francia; Matteo Golfarelli; Stefano Rizzi

    Augmented reality allows users to superimpose digital information (typically, of operational type) upon real-world objects. The synergy of analytical frameworks and augmented reality opens the door to a new wave of situated analytics, in which users within a physical environment are provided with immersive analyses of local contextual data. In this paper, we propose an approach named A-BI+ (Augmented

    更新日期:2020-04-21
  • A survey on graph-based methods for similarity searches in metric spaces
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-25
    Larissa C. Shimomura; Rafael Seidi Oyamada; Marcos R. Vieira; Daniel S. Kaster

    Technology development has accelerated the volume growth of complex data, such as images, videos, time series, and georeferenced data. Similarity search is a widely used approach to retrieve complex data, which aims at retrieving similar data according to intrinsic characteristics of the data. Therefore, to facilitate the retrieval of complex data using similarity searches, one needs to organize large

    更新日期:2020-04-21
  • Using agile methodologies for adopting COBIT
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-19
    Ana Cláudia Amorim; Miguel Mira da Silva; Rúben Pereira; Margarida Gonçalves

    COBIT 5 is a widely-used framework for implementing sound governance of enterprise IT (GEIT). Currently, the ISACA’s official implementation solution follows a sequentially ordered process, raising several issues related with lack of commitment from top management and misaligned solutions. Nevertheless, new project life-cycle strategies have emerged along with the agile paradigm for project management

    更新日期:2020-04-21
  • Re-ranking via local embeddings: A use case with permutation-based indexing and the nSimplex projection
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-13
    Lucia Vadicamo; Claudio Gennaro; Fabrizio Falchi; Edgar Chávez; Richard Connor; Giuseppe Amato

    Approximate Nearest Neighbor (ANN) search is a prevalent paradigm for searching intrinsically high dimensional objects in large-scale data sets. Recently, the permutation-based approach for ANN has attracted a lot of interest due to its versatility in being used in the more general class of metric spaces. In this approach, the entire database is ranked by a permutation distance to the query. Typically

    更新日期:2020-04-21
  • Bitpart: Exact metric search in high(er) dimensions
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-04
    Alan Dearle; Richard Connor

    We define BitPart (Bitwise representations of binary Partitions), a novel exact search mechanism intended for use in high-dimensional spaces. In outline, a fixed set of reference objects is used to define a large set of regions within the original space, and each data item is characterised according to its containment within these regions. In contrast with other mechanisms only a subset of this information

    更新日期:2020-04-21
  • A comprehensive analysis of delayed insertions in metric access methods
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-11
    Humberto Razente; Maria Camila N. Barioni; Regis M. Santos Sousa

    Similarity queries are fundamental operations for applications that deal with complex data. This paper presents MIA (Metric Indexing Assisted by auxiliary memory with limited capacity), a new delayed insertion approach that can be employed to create enhanced dynamic metric access methods through short-term memories. We present a comprehensive evaluation of delayed insertion methods for metric access

    更新日期:2020-04-21
  • An Alternative View on Data Processing Pipelines from the DOLAP 2019 Perspective
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-27
    Oscar Romero; Robert Wrembel; Il-Yeol Song

    Data science requires constructing data processing pipelines (DPPs), which span diverse phases such as data integration, cleaning, pre-processing, and analysis. However, current solutions lack a strong data engineering perspective. As consequence, DPPs are error-prone, inefficient w.r.t. human efforts, and inefficient w.r.t. execution time. We claim that DPP design, development, testing, deployment

    更新日期:2020-04-21
  • Detecting coherent explorations in SQL workloads
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-09
    Verónika Peralta; Patrick Marcel; Willeme Verdeaux; Aboubakar Sidikhy Diakhaby

    This paper presents a proposal aiming at better understanding a workload of SQL queries and detecting coherent explorations hidden within the workload. In particular, our work investigates SQLShare (Jain et al., 2016), a database-as-a-service platform targeting scientists and data scientists with minimal database experience, whose workload was made available to the research community. According to

    更新日期:2020-04-21
  • Two-stage optimization for machine learning workflow
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-09
    Alexandre Quemy

    Machine learning techniques play a preponderant role in dealing with massive amount of data and are employed in almost every possible domain. Building a high quality machine learning model to be deployed in production is a challenging task, from both, the subject matter experts and the machine learning practitioners. For a broader adoption and scalability of machine learning systems, the construction

    更新日期:2020-04-21
  • Feedback driven improvement of data preparation pipelines
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-06
    Nikolaos Konstantinou; Norman W. Paton

    Data preparation, whether for populating enterprise data warehouses or as a precursor to more exploratory analyses, is recognised as being laborious, and as a result is a barrier to cost-effective data analysis. Several steps that recur within data preparation pipelines are amenable to automation, but it seems important that automated decisions can be refined in the light of user feedback on data products

    更新日期:2020-04-21
  • CoPModL: Construction Process Modeling Language and Satisfiability Checking
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-27
    Elisa Marengo; Werner Nutt; Matthias Perktold

    Process modeling has been widely investigated in the literature and several general purpose approaches have been introduced, addressing a variety of domains. However, generality goes to the detriment of the possibility to model details and peculiarities of a particular application domain. As acknowledged by the literature, known approaches predominantly focus on one aspect between control flow and

    更新日期:2020-04-21
  • Formalising and animating multiple instances in BPMN collaborations
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-01
    Flavio Corradini; Chiara Muzi; Barbara Re; Lorenzo Rossi; Francesco Tiezzi

    The increasing adoption of modelling methods contributes to a better understanding of the flow of processes, from the internal behaviour of a single organisation to a wider perspective where several organisations exchange messages. In this regard, BPMN collaborations provide a suitable modelling abstraction. Even if this is a widely accepted notation, only a limited effort has been expended in formalising

    更新日期:2020-04-21
  • A DSL for WSN software components coordination
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-31
    Marcos Aurélio Carrero; Martin A. Musicante; Aldri Luiz dos Santos; Carmem S. Hara

    Wireless Sensor Networks (WSNs) have become an integral part of urban scenarios. They are usually composed of a large number of devices. Developing systems for such networks is a hard task and often involves validation on simulation environments before deployment on real settings. Component-based development allows systems to be built from reusable, existing components that share a common interface

    更新日期:2020-04-21
  • Aligning observed and modelled behaviour by maximizing synchronous moves and using milestones
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-26
    Vincent Bloemen; Sebastiaan van Zelst; Wil van der Aalst; Boudewijn van Dongen; Jaco van de Pol

    Given a process model and an event log, conformance checking aims to relate the two together, e.g. to detect discrepancies between them. For the synchronous product net of the process and a log trace, we can assign different costs to a synchronous move, and a move in the log or model. By computing a path through this (synchronous) product net, whilst minimizing the total cost, we create a so-called

    更新日期:2020-04-21
  • BINet: Multi-perspective business process anomaly classification
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-26
    Timo Nolle; Stefan Luettgen; Alexander Seeliger; Max Mühlhäuser

    In this paper, we introduce BINet, a neural network architecture for real-time multi-perspective anomaly detection in business process event logs. BINet is designed to handle both the control flow and the data perspective of a business process. Additionally, we propose a set of heuristics for setting the threshold of an anomaly detection algorithm automatically. We demonstrate that BINet can be used

    更新日期:2020-04-21
  • Detecting trend deviations with generic stream processing patterns
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-22
    Massiva Roudjane; Djamal Rebaïne; Raphaël Khoury; Sylvain Hallé

    Information systems produce different types of event logs; in many situations, it may be desirable to look for trends inside these logs. We show how trends of various kinds can be computed over such logs in real time, using a generic framework called the trend distance workflow. Many common computations on event streams turn out to be special cases of this workflow, depending on how a handful of workflow

    更新日期:2020-04-21
  • Service contract modeling in Enterprise Architecture: An ontology-based approach
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-18
    Cristine Griffo; João Paulo A. Almeida; Giancarlo Guizzardi; Julio Cesar Nardi

    Service contracts bind parties legally, regulating their behavior in the scope of a (business) service relationship. Given that there are legal consequences attached to service contracts, understanding the elements of a contract is key to managing services in an enterprise. After all, provisions in a service contract and in legislation establish obligations and rights for service providers and customers

    更新日期:2020-04-21
  • Enabling runtime flexibility in data-centric and data-driven process execution engines
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-17
    Kevin Andrews; Sebastian Steinau; Manfred Reichert

    Contemporary process management systems support users during the execution of predefined business processes. However, when unforeseen situations occur, which are not part of the process model serving as the template for process execution, contemporary technology is often unable to offer adequate user support. One solution to this problem is to allow for ad-hoc changes to process models, i.e., changes

    更新日期:2020-04-21
  • Characterizing client usage patterns and service demand for car-sharing systems
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-11
    Victor A. Alencar; Felipe Rooke; Michele Cocca; Luca Vassio; Jussara Almeida; Alex Borges Vieira

    The understanding of the mobility on urban spaces is useful for the creation of smarter and sustainable cities. However, getting data about urban mobility is challenging, since only a few companies have access to accurate and updated data, that is also privacy-sensitive. In this work, we characterize three distinct car-sharing systems which operate in Vancouver (Canada) and nearby regions, gathering

    更新日期:2020-04-21
  • How meaningful are similarities in deep trajectory representations?
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-11
    Saeed Taghizadeh; Abel Elekes; Martin Schäler; Klemens Böhm

    Finding similar trajectories is an important task in moving object databases. However, classical similarity models face several limitations, including scalability and robustness. Recently, an approach named t2vec proposed transforming trajectories into points in a high dimensional vector space, and this transformation approximately keeps distances between trajectories. t2vec overcomes that scalability

    更新日期:2020-04-21
  • Speed prediction in large and dynamic traffic sensor networks
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-11
    Regis Pires Magalhaes; Francesco Lettich; Jose Antonio Macedo; Franco Maria Nardini; Raffaele Perego; Chiara Renso; Roberto Trani

    Smart cities are nowadays equipped with pervasive networks of sensors that monitor traffic in real-time and record huge volumes of traffic data. These datasets constitute a rich source of information that can be used to extract knowledge useful for municipalities and citizens. In this paper we are interested in exploiting such data to estimate future speed in traffic sensor networks, as accurate predictions

    更新日期:2020-04-21
  • A deep view-point language and framework for projective modeling
    Inform. Syst. (IF 2.066) Pub Date : 2019-09-18
    Colin Atkinson; Christian Tunjic

    Most view-based modeling approaches are today based on a “synthetic” approach in which the views hold all the information modeled about a system and are kept consistent using explicit, inter-view correspondence rules. The alternative “projective” approach, in which the contents of views are “projected” from a single underlying model on demand, is far less widely used due to the lack of suitable conceptual

    更新日期:2020-04-21
  • Formal foundations for responsible application integration
    Inform. Syst. (IF 2.066) Pub Date : 2019-09-18
    Daniel Ritter; Stefanie Rinderle-Ma; Marco Montali; Andrey Rivkin

    Enterprise Application Integration (EAI) constitutes the cornerstone in enterprise IT landscapes that are characterized by heterogeneity and distribution. Starting from established Enterprise Integration Patterns (EIPs) such as Content-based Router and Aggregator, EIP compositions are built to describe, implement, and execute integration scenarios. The EIPs and their compositions must be correct at

    更新日期:2020-04-21
  • A fully spatial personalized differentially private mechanism to provide non-uniform privacy guarantees for spatial databases
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-08
    Nadia Niknami; Mahdi Abadi; Fatemeh Deldar

    Spatial databases are essential to applications in a wide variety of domains. One of the main privacy concerns when answering statistical queries, such as range counting queries, over a spatial database is that an adversary observing changes in query answers may be able to determine whether or not a particular geometric object is present in the database. Differential privacy addresses this concern

    更新日期:2020-04-08
  • Winter is here! A decade of cache-based side-channel attacks, detection & mitigation for RSA
    Inform. Syst. (IF 2.066) Pub Date : 2020-04-06
    Maria Mushtaq; Muhammad Asim Mukhtar; Vianney Lapotre; Muhammad Khurram Bhatti; Guy Gogniat

    Timing-based side-channels play an important role in exposing the state of a process execution on underlying hardware by revealing information about timing and access patterns. Side-channel attacks (SCAs) are powerful cryptanalysis techniques that focus on the underlying implementation of cryptographic ciphers during execution rather than attacking the structure of cryptographic functions. This paper

    更新日期:2020-04-06
  • An efficient algorithm for approximated self-similarity joins in metric spaces
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-24
    Sebastián Ferrada; Benjamin Bustos; Nora Reyes

    Similarity join is a key operation in metric databases. It retrieves all pairs of elements that are similar. Solving such a problem usually requires comparing every pair of objects of the datasets, even when indexing and ad hoc algorithms are used. We propose a simple and efficient algorithm for the computation of the approximated k nearest neighbor self-similarity join. This algorithm computes Θ(n3∕2)

    更新日期:2020-02-25
  • A-Cure: An accurate information reconstruction from inaccurate data sources
    Inform. Syst. (IF 2.066) Pub Date : 2020-02-17
    Jiawei Xu; Vladimir Zadorozhny; John Grant

    We address the challenge of reconstructing historical information from aggregated, possibly inaccurate historical reports. For example, given a mixture of accurate and inaccurate monthly and weekly sums, how can we find accurately the daily counts of people infected with flu? We propose an approach, called A-Cure, that performs automatic data reconstruction from a combination of accurate and inaccurate

    更新日期:2020-02-20
  • On the declarative paradigm in hybrid business process representations: A conceptual framework and a systematic literature study
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-24
    Amine Abbad Andaloussi; Andrea Burattin; Tijs Slaats; Ekkart Kindler; Barbara Weber

    Process modeling plays a central role in the development of today’s process-aware information systems both on the management level (e.g., providing input for requirements elicitation and fostering communication) and on the enactment level (providing a blue-print for process execution and enabling simulation). The literature comprises a variety of process modeling approaches proposing different modeling

    更新日期:2020-01-24
  • Clustering biomedical and gene expression datasets with kernel density and unique neighborhood set based vein detection
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-23
    Md Anisur Rahman; Li-Minn Ang; Kah Phooi Seng

    It is a crucial need for a clustering technique to produce high-quality clusters from biomedical and gene expression datasets without requiring any user inputs. Therefore, in this paper we present a clustering technique called KUVClust that produces high-quality clusters when applied on biomedical and gene expression datasets without requiring any user inputs. The KUVClust algorithm uses three concepts

    更新日期:2020-01-23
  • A novel graph-based clustering method using noise cutting
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-21
    Lin-Tao Li; Zhong-Yang Xiong; Qi-Zhu Dai; Yong-Fang Zha; Yu-Fang Zhang; Jing-Pei Dan

    Recently, many methods have appeared in the field of cluster analysis. Most existing clustering algorithms have considerable limitations in dealing with local and nonlinear data patterns. Algorithms based on graphs provide good results for this problem. However, some widely used graph-based clustering methods, such as spectral clustering algorithms, are sensitive to noise and outliers. In this paper

    更新日期:2020-01-22
  • Understanding Service-Oriented Architecture (SOA): A systematic literature review and directions for further investigation
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-17
    Naghmeh Niknejad; Waidah Ismail; Imran Ghani; Behzad Nazari; Mahadi Bahari; Ab Razak Bin Che Hussin

    Service-Oriented Architecture (SOA) has emerged as an architectural approach that enhances the service delivery performance of existing traditional systems while still retaining their most important features. This approach, due to its flexibility of adoption, has gained the attention of both academic and business entities, especially in the development of world-leading technologies such as Cloud Computing

    更新日期:2020-01-17
  • Discovering and merging related analytic datasets
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-17
    Rutian Liu; Eric Simon; Bernd Amann; Stéphane Gançarski

    The production of analytic datasets is a significant big data trend and has gone well beyond the scope of traditional IT-governed dataset development. Analytic datasets are now created by data scientists and data analysts using big data frameworks and agile data preparation tools. However, despite the profusion of available datasets, it remains quite difficult for a data analyst to start from a dataset

    更新日期:2020-01-17
  • Improving malicious URLs detection via feature engineering: Linear and nonlinear space transformation methods
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-15
    Tie Li; Gang Kou; Yi Peng

    In malicious URLs detection, traditional classifiers are challenged because the data volume is huge, patterns are changing over time, and the correlations among features are complicated. Feature engineering plays an important role in addressing these problems. To better represent the underlying problem and improve the performance of classifiers in identifying malicious URLs, this paper proposed a combination

    更新日期:2020-01-15
  • What does existing NeuroIS research focus on?
    Inform. Syst. (IF 2.066) Pub Date : 2019-10-28
    Jie Xiong; Meiyun Zuo

    NeuroIS is a research field in which neuroscience theories and tools are used to better understand information systems phenomena. At present, NeuroIS is still an emerging field in information systems, and the number of available studies is limited. Because researchers who plan or execute NeuroIS research need to understand the status of the existing empirical research published in relevant journals

    更新日期:2020-01-04
  • Comparing the expressiveness of downward fragments of the relation algebra with transitive closure on trees
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-08
    Jelle Hellings; Marc Gyssens; Yuqing Wu; Dirk Van Gucht; Jan Van den Bussche; Stijn Vansummeren; George H.L. Fletcher

    Motivated by the continuing interest in the tree data model, we study the expressive power of downward navigational query languages on trees and chains. Basic navigational queries are built from the identity relation and edge relations using composition and union. We study the effects on relative expressiveness when we add transitive closure, projections, coprojections, intersection, and difference;

    更新日期:2020-01-04
  • Volunteering for Linked Data Wrapper maintenance: A platform perspective
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-08
    Iker Azpeitia; Jon Iturrioz; Oscar Díaz

    Linked Data Wrappers (LDWs) turn Web APIs into RDF end-points, leveraging the Linked Open Data cloud with current data. Unfortunately, LDWs are fragile upon upgrades on the underlying APIs, compromising LDW stability. Hence, for API-based LDWs to become a sustainable foundation for the Web of Data, we should recognize LDW maintenance as a continuous effort that outlives their breakout projects. This

    更新日期:2020-01-04
  • Operator implementation of Result Set Dependent KWS scoring functions
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-18
    Vinay M.S.; Jayant R. Haritsa

    A popular approach to hosting Keyword Search Systems (KWS) on relational DBMS platforms is to employ the Candidate Network framework. The quality of a Candidate Network-based search is critically dependent on the scoring function used to rank the relevant answers. In this paper, we first demonstrate, through detailed empirical and conceptual analysis studies, that the Labrador scoring function provides

    更新日期:2020-01-04
  • To index or not to index: Time–space trade-offs for positional ranking functions in search engines
    Inform. Syst. (IF 2.066) Pub Date : 2019-11-14
    Diego Arroyuelo; Senén González; Mauricio Marin; Mauricio Oyarzún; Torsten Suel; Luis Valenzuela

    Positional ranking functions, widely used in web search engines and related search systems, improve result quality by exploiting the positions of the query terms within documents. However, it is well known that positional indexes demand large amounts of extra space, typically about three times the space of a basic nonpositional index. Textual data, on the other hand, is needed to produce text snippets

    更新日期:2020-01-04
  • JSON: Data model and query languages
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-06
    Pierre Bourhis; Juan L. Reutter; Domagoj Vrgoč

    Despite the fact that JSON is currently one of the most popular formats for exchanging data on the Web, there are very few studies on this topic and there is no agreement upon a theoretical framework for dealing with JSON. Therefore in this paper we propose a formal data model for JSON documents and, based on the common features present in available systems using JSON, we define a lightweight query

    更新日期:2020-01-04
  • Discovering instance and process spanning constraints from process execution logs
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-09
    Karolin Winter; Florian Stertz; Stefanie Rinderle-Ma

    Instance spanning constraints (ISC) are the instrument to establish controls across multiple instances of one or several processes. A multitude of applications crave for ISC support. Consider, for example, the bundling and unbundling of cargo across several instances of a logistics process or dependencies between examinations in different medical treatment processes. Non-compliance with ISC can lead

    更新日期:2020-01-04
  • An empirical evaluation of exact set similarity join techniques using GPUs
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-13
    Christos Bellas; Anastasios Gounaris

    Exact set similarity join is a notoriously expensive operation, for which several solutions have been proposed. Recently, there have been studies that present a comparative analysis using MapReduce or a non-parallel setting. Our contribution is that we complement these works through conducting a thorough evaluation of the state-of-the-art GPU-enabled techniques. These techniques are highly diverse

    更新日期:2020-01-04
  • Automated discovery of declarative process models with correlated data conditions
    Inform. Syst. (IF 2.066) Pub Date : 2019-12-09
    Volodymyr Leno; Marlon Dumas; Fabrizio Maria Maggi; Marcello La Rosa; Artem Polyvyanyy

    Automated process discovery techniques enable users to generate business process models from event logs extracted from enterprise information systems. Traditional techniques in this field generate procedural process models (e.g., in the BPMN notation). When dealing with highly variable processes, the resulting procedural models are often too complex to be practically usable. An alternative approach

    更新日期:2020-01-04
  • Compatible byte-addressable direct I/O for peripheral memory devices in Linux
    Inform. Syst. (IF 2.066) Pub Date : 2020-01-02
    Sung Hoon Baek; Ki-Woong Park

    Memory devices can be used as storage systems to provide a lower latency that can be achieved by disk and flash storage. However, traditional buffered input/output (I/O) and direct I/O are not optimized for memory-based storages. Traditional buffered I/O includes a redundant memory copy with a disk cache. Traditional direct I/O does not support byte addressing. Memory-mapped direct I/O, which optimizes

    更新日期:2020-01-04
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
Springer化学材料学
骄傲月
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
汪铭
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug