Dimas C. Nascimento

Orcid: 0000-0002-3195-6481

Affiliations:
  • Federal University of Campina Grande, Brazil
  • Federal Rural University of Pernambuco, Garanhuns, Brazil


According to our database1, Dimas C. Nascimento authored at least 26 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Leveraging BERT for extractive text summarization on federal police documents.
Knowl. Inf. Syst., November, 2023

Towards automatic Privacy-Preserving Record Linkage: A Transfer Learning based classification step.
Data Knowl. Eng., May, 2023

Avaliando o Processo de Seleção de Características na Tarefa de Junção de Similaridade.
Proceedings of the 38th Brazilian Symposium on Databases, 2023

Avaliando Fatores de Influência sobre Algoritmos de Aprendizado de Máquina na Etapa de Classificação da Resolução de Entidades.
Proceedings of the 38th Brazilian Symposium on Databases, 2023

2022
Explanation and answers to critiques on: Blockchain-based Privacy-Preserving Record Linkage.
Inf. Syst., 2022

A Decision Tree Ensemble Model for Predicting Bus Bunching.
Comput. J., 2022

2021
Blockchain-based Privacy-Preserving Record Linkage: enhancing data privacy in an untrusted environment.
Inf. Syst., 2021

2020
Exploiting block co-occurrence to control block sizes for entity resolution.
Knowl. Inf. Syst., 2020

Estimating record linkage costs in distributed environments.
J. Parallel Distributed Comput., 2020

Configurable assembly of classification rules for enhancing entity resolution results.
Inf. Process. Manag., 2020

Leveraging active learning to reduce human effort in the generation of ground-truth for entity resolution.
Comput. Intell., 2020

2019
Conformity Analysis of GTFS Routes and Bus Trajectories.
Proceedings of the 34th Brazilian Symposium on Databases, 2019

A noise tolerant and schema-agnostic blocking technique for entity resolution.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

2018
Heuristic-based approaches for speeding up incremental record linkage.
J. Syst. Softw., 2018

2017
An efficient spark-based adaptive windowing for entity matching.
J. Syst. Softw., 2017

Towards the efficient parallelization of multi-pass adaptive blocking for entity matching.
J. Parallel Distributed Comput., 2017

Uma Avaliação de Eficiência e Eficácia da Combinação de Técnicas para Deduplicação de Dados.
Proceedings of the XXXII Simpósio Brasileiro de Banco de Dados, 2017

2016
A fine-grained load balancing technique for improving partition-parallel-based ontology matching approaches.
Knowl. Based Syst., 2016

Applying machine learning techniques for scaling out data quality algorithms in cloud computing environments.
Appl. Intell., 2016

2015
A Parallel Approach for Matching Large-scale Ontologies.
J. Inf. Data Manag., 2015

A data quality-aware cloud service based on metaheuristic and machine learning provisioning algorithms.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Adaptive sorted neighborhood blocking for entity matching with MapReduce.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

A System Based on Ontology and Case-Based Reasoning to Support Distributed Teams.
Proceedings of the 12th International Conference on Information Technology, 2015

Data Quality Monitoring of Cloud Databases Based on Data Quality SLAs.
Proceedings of the Big-Data Analytics and Cloud Computing, 2015

2014
DKDs: An Ontology-based System for Distributed Teams.
Proceedings of the 26th International Conference on Software Engineering and Knowledge Engineering, 2014

2013
PL / SQL Advisor: uma ferramenta baseada em análise estática para sugerir melhorias para procedimentos armazenados.
Proceedings of the 9th Brazilian Symposium on Information Systems, 2013


  Loading...