Cost-effective Variational Active Entity Resolution
Accurately identifying different representations of the same real-world entity is an integral part of data cleaning and many methods have been proposed to accomplish it. The challenges of this entity resolution task that demand so much research attention are often rooted in the task-specificity and user-dependence of the process. Adopting deep learning techniques has the potential to lessen these challenges. In this paper, we set out to devise an entity resolution method that builds on the robustness conferred by deep autoencoders to reduce human-involvement costs. Specifically, we reduce the cost of training deep entity resolution models by performing unsupervised representation learning. This unveils a transferability property of the resulting model that can further reduce the cost of applying the approach to new datasets by means of transfer learning. Finally, we reduce the cost of labelling training data through an active learning approach that builds on the properties conferred by the use of deep autoencoders. Empirical evaluation confirms the accomplishment of our cost-reduction desideratum while achieving comparable effectiveness with state-of-the-art alternatives.
Code (0)
등록된 구현이 없습니다.
Tasks
Active LearningEntity ResolutionRepresentation LearningSpecificityTransfer LearningSimilar Papers 제목 키워드 기반
Variational Graph Autoencoding as Cheap Supervision for AMR Coreference Resolution
Coreference resolution over semantic graphs like AMRs aims to group the graph nodes that represent the same entity. This is a crucial step for making document-level formal semantic representations. With annotated data on…
coreference-resolutionCoreference ResolutionVariational Bayes for Merging Noisy Databases
Bayesian entity resolution merges together multiple, noisy databases and returns the minimal collection of unique individuals represented, together with their true, latent record values. Bayesian methods allow flexible g…
Bayesian InferenceEntity ResolutionGraph-boosted Active Learning for Multi-Source Entity Resolution
Supervised entity resolution methods rely on labeled record pairs for learning matching patterns between two or more data sources. Active learning minimizes the labeling effort by selecting informative pairs for labeling…
Active LearningEntity ResolutionActive Gradual Machine Learning for Entity Resolution
Recent work has shown that the task of entity resolution (ER) can be effectively performed by gradual machine learning (GML). GML begins with some easy instances, which can be automatically labeled by the machine with hi…
Active LearningBIG-bench Machine LearningEntity ResolutionLarge-scale entity resolution via microclustering Ewens--Pitman random partitions
We introduce the microclustering Ewens--Pitman model for random partitions, obtained by scaling the strength parameter of the Ewens--Pitman model linearly with the sample size. The resulting random partition is shown to …
Entity Resolution