Catálogo de publicaciones - revistas

Compartir en
redes sociales


ACM Computing Surveys (CSUR)

Resumen/Descripción – provisto por la editorial en inglés
A journal of the Association for Computing Machinery (ACM), which publishes surveys, tutorials, and special reports on all areas of computing research. Volumes are published yearly in four issues appearing in March, June, September, and December.
Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Período Navegá Descargá Solicitá
No detectada desde mar. 1969 / hasta dic. 2023 ACM Digital Library

Información

Tipo de recurso:

revistas

ISSN impreso

0360-0300

ISSN electrónico

1557-7341

Editor responsable

Association for Computing Machinery (ACM)

País de edición

Estados Unidos

Fecha de publicación

Tabla de contenidos

The Secondary Use of Electronic Health Records for Data Mining: Data Characteristics and Challenges

Tabinda SarwarORCID; Sattar Seifollahi; Jeffrey Chan; Xiuzhen Zhang; Vural Aksakalli; Irene Hudson; Karin Verspoor; Lawrence Cavedon

<jats:p>The primary objective of implementing Electronic Health Records (EHRs) is to improve the management of patients’ health-related information. However, these records have also been extensively used for the secondary purpose of clinical research and to improve healthcare practice. EHRs provide a rich set of information that includes demographics, medical history, medications, laboratory test results, and diagnosis. Data mining and analytics techniques have extensively exploited EHR information to study patient cohorts for various clinical and research applications, such as phenotype extraction, precision medicine, intervention evaluation, disease prediction, detection, and progression. But the presence of diverse data types and associated characteristics poses many challenges to the use of EHR data. In this article, we provide an overview of information found in EHR systems and their characteristics that could be utilized for secondary applications. We first discuss the different types of data stored in EHRs, followed by the data transformations necessary for data analysis and mining. Later, we discuss the data quality issues and characteristics of the EHRs along with the relevant methods used to address them. Moreover, this survey also highlights the usage of various data types for different applications. Hence, this article can serve as a primer for researchers to understand the use of EHRs for data mining and analytics purposes.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-40

A Comprehensive Report on Machine Learning-based Early Detection of Alzheimer's Disease using Multi-modal Neuroimaging Data

Shallu Sharma; Pravat Kumar MandalORCID

<jats:p> <jats:bold>Alzheimer's Disease (AD)</jats:bold> is a devastating neurodegenerative brain disorder with no cure. An early identification helps patients with AD sustain a normal living. We have outlined <jats:bold>machine learning (ML)</jats:bold> methodologies with different schemes of feature extraction to synergize complementary and correlated characteristics of data acquired from multiple modalities of neuroimaging. A variety of feature selection, scaling, and fusion methodologies along with confronted challenges are elaborated for designing an ML-based AD diagnosis system. Additionally, thematic analysis has been provided to compare the ML workflow for possible diagnostic solutions. This comprehensive report adds value to the further advancement of computer-aided early diagnosis system based on multi-modal neuroimaging data from patients with AD. </jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-44

Tackling Climate Change with Machine Learning

David RolnickORCID; Priya L. Donti; Lynn H. Kaack; Kelly Kochanski; Alexandre Lacoste; Kris Sankaran; Andrew Slavin Ross; Nikola Milojevic-Dupont; Natasha Jaques; Anna Waldman-Brown; Alexandra Sasha Luccioni; Tegan Maharaj; Evan D. Sherwin; S. Karthik Mukkavilli; Konrad P. Kording; Carla P. Gomes; Andrew Y. Ng; Demis Hassabis; John C. Platt; Felix Creutzig; Jennifer Chayes; Yoshua Bengio

<jats:p>Climate change is one of the greatest challenges facing humanity, and we, as machine learning (ML) experts, may wonder how we can help. Here we describe how ML can be a powerful tool in reducing greenhouse gas emissions and helping society adapt to a changing climate. From smart grids to disaster management, we identify high impact problems where existing gaps can be filled by ML, in collaboration with other fields. Our recommendations encompass exciting research questions as well as promising business opportunities. We call on the ML community to join the global effort against climate change.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-96

Experimental Comparisons of Clustering Approaches for Data Representation

Sanjay Kumar Anand; Suresh Kumar

<jats:p>Clustering approaches are extensively used by many areas such as IR, Data Integration, Document Classification, Web Mining, Query Processing, and many other domains and disciplines. Nowadays, much literature describes clustering algorithms on multivariate data sets. However, there is limited literature that presented them with exhaustive and extensive theoretical analysis as well as experimental comparisons. This experimental survey paper deals with the basic principle, and techniques used, including important characteristics, application areas, run-time performance, internal, external, and stability validity of cluster quality, etc., on five different data sets of eleven clustering algorithms. This paper analyses how these algorithms behave with five different multivariate data sets in data representation. To answer this question, we compared the efficiency of eleven clustering approaches on five different data sets using three validity metrics-internal, external, and stability and found the optimal score to know the feasible solution of each algorithm. In addition, we have also included four popular and modern clustering algorithms with only their theoretical discussion. Our experimental results for only traditional clustering algorithms showed that different algorithms performed different behavior on different data sets in terms of running time (speed), accuracy and, the size of data set. This study emphasized the need for more adaptive algorithms and a deliberate balance between the running time and accuracy with their theoretical as well as implementation aspects.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-33

On the Structure of the Boolean Satisfiability Problem: A Survey

Tasniem Nasser Alyahya; Mohamed El Bachir Menai; Hassan Mathkour

<jats:p> The Boolean <jats:bold>satisfiability problem (SAT)</jats:bold> is a fundamental NP-complete decision problem in automated reasoning and mathematical logic. As evidenced by the results of SAT competitions, the performance of SAT solvers varies substantially between different SAT categories (random, crafted, and industrial). A suggested explanation is that SAT solvers may exploit the underlying structure inherent to SAT instances. There have been attempts to define the structure of SAT in terms of structural measures such as phase transition, backbones, backdoors, small-world, scale-free, treewidth, centrality, community, self-similarity, and entropy. Still, the empirical evidence of structural measures for SAT has been provided for only some SAT categories. Furthermore, the evidence has not been theoretically proven. Also, the impact of structural measures on the behavior of SAT solvers has not been extensively examined. This work provides a comprehensive study on structural measures for SAT that have been presented in the literature. We provide an overview of the works on structural measures for SAT and their relatedness to the performance of SAT solvers. Accordingly, a taxonomy of structural measures for SAT is presented. We also review in detail important applications of structural measures for SAT, focusing mainly on enhancing SAT solvers, generating SAT instances, and classifying SAT instances. </jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-34

Constructive or Optimized: An Overview of Strategies to Design Networks for Time-Critical Applications

Voica GavriluţORCID; Aleksander PruskiORCID; Michael Stübert BergerORCID

<jats:p>Distributed systems are pervasive nowadays, being found in different areas, from smart toys to smart factories. As the usage of such systems increases, so does their complexity and design. Therefore, this work aims to overview the methods for designing networks that accommodate time-constrained distributed applications.</jats:p> <jats:p>The work starts with a history of time-aware Ethernet-based protocols. Then, it continues with an overview of the design strategies from the literature. For each research paper, there are presented the model, addressed problem, exploration strategy, and results. Furthermore, for each type of problem are identified the constructive and optimization design strategies. Regarding the results, this work investigates the improvements of reliability, timeliness, and network cost.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-35

A Survey on Task Assignment in Crowdsourcing

Danula Hettiachchi; Vassilis Kostakos; Jorge Goncalves

<jats:p>Quality improvement methods are essential to gathering high-quality crowdsourced data, both for research and industry applications. A popular and broadly applicable method is task assignment that dynamically adjusts crowd workflow parameters. In this survey, we review task assignment methods that address: heterogeneous task assignment, question assignment, and plurality problems in crowdsourcing. We discuss and contrast how these methods estimate worker performance, and highlight potential challenges in their implementation. Finally, we discuss future research directions for task assignment methods, and how crowdsourcing platforms and other stakeholders can benefit from them.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-35

Security and Privacy in Unified Communication

Thomas Reisinger; Isabel Wagner; Eerke Albert Boiten

<jats:p>The use of unified communication; video conferencing, audio conferencing, and instant messaging has skyrocketed during the COVID-19 pandemic. However, security and privacy considerations have often been neglected. This article provides a comprehensive survey of security and privacy in Unified Communication (UC). We systematically analyze security and privacy threats and mitigations in a generic UC scenario. Based on this, we analyze security and privacy features of the major UC market leaders, and we draw conclusions on the overall UC landscape. While confidentiality in communication channels is generally well protected through encryption, other privacy properties are mostly lacking on UC platforms.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-36

LoRa Networking Techniques for Large-scale and Long-term IoT: A Down-to-top Survey

Chenning Li; Zhichao Cao

<jats:p>Low-Power Wide-Area Networks (LPWANs) are an emerging Internet-of-Things (IoT) paradigm, which caters to large-scale and long-term sensory data collection demand. Among the commercialized LPWAN technologies, LoRa (Long Range) attracts much interest from academia and industry due to its open-source physical (PHY) layer and standardized networking stack. In the flourishing LoRa community, many observations and countermeasures have been proposed to understand and improve the performance of LoRa networking in practice. From the perspective of the LoRa networking stack; however, we lack a whole picture to comprehensively understand what has been done or not and reveal what the future trends are.</jats:p> <jats:p>This survey proposes a taxonomy of a two-dimensional (i.e., networking layers, performance metrics) to categorize and compare the cutting-edge LoRa networking techniques. One dimension is the layered structure of the LoRa networking stack. From down to the top, we have the PHY layer, Link layer, Media-access Control (MAC) layer, and Application (App) layer. In each layer, we focus on the three most representative layer-specific research issues for fine-grained categorizing. The other dimension is LoRa networking performance metrics, including range, throughput, energy, and security. We compare different techniques in terms of these metrics and further overview the open issues and challenges, followed by our observed future trends. According to our proposed taxonomy, we aim at clarifying several ways to achieve a more effective LoRa networking stack and find more LoRa applicable scenarios, leading to a brand-new step toward a large-scale and long-term IoT.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-36

Understanding Online Privacy—A Systematic Review of Privacy Visualizations and Privacy by Design Guidelines

Susanne Barth; Dan Ionita; Pieter Hartel

<jats:p>Privacy visualizations help users understand the privacy implications of using an online service. Privacy by Design guidelines provide generally accepted privacy standards for developers of online services. To obtain a comprehensive understanding of online privacy, we review established approaches, distill a unified list of 15 privacy attributes and rank them based on perceived importance by users and privacy experts. We then discuss similarities, explain notable differences, and examine trends in terms of the attributes covered. Finally, we show how our results provide a foundation for user-centric privacy visualizations, inspire best practices for developers, and give structure to privacy policies.</jats:p>

Palabras clave: General Computer Science; Theoretical Computer Science.

Pp. 1-37