Enhanced Duplicate Count Strategy

Aassem, Y.; Hafidi, Imad; Aboutabit, Noureddine

doi:10.1145/3386723.3387877

Proceedings of the 3rd International Conference on Networking, Information Systems &Amp; Security 2020

DOI: 10.1145/3386723.3387877

|View full text |Cite

Enhanced Duplicate Count Strategy

Y. Aassem¹,

Imad Hafidi²,

Noureddine Aboutabit³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

IGAEM: Improved Genetic Algorithm based Entity Matching

Aassem

Hafidi

Aboutabit

2021

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The presence of duplicate records is a major data quality concern in huge datasets. To detect duplicates, entity matching is used as an essential step of the data cleaning process to map records that refer to the same real-world entity. Most of proposed algorithms require labeled data in order to train a classifier. However, we cannot always obtain labeled data. In our paper we propose an unsupervised approach for entity matching problem using an improved version of genetic algorithm. We explain the main improvements added to genetic algorithm and the encoding strategy to encode partitions in the form of a chromosome. Different similarity functions are used to compute similarities between records. The obtained results prove that our proposition stands as a powerful approach in the entity matching field where it outperforms the traditional genetic algorithm based approach.

show abstract

IGAEM: Improved Genetic Algorithm based Entity Matching

Aassem

Hafidi

Aboutabit

2021

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

show abstract

PSOBER: PSO based entity resolution

Aassem¹,

Hafidi²,

Khalfi³

et al. 2021

Math. Model. Comput.

View full text Add to dashboard Cite

Entity Resolution is the task of mapping the records within a database to their corresponding entities. The entity resolution problem presents a lot of challenges because of the absence of complete information in records, variant distribution of records for different entities and sometimes overlaps between records of different entities. In this paper, we have proposed an unsupervised method to solve this problem. The previously mentioned problem is set as a partitioning problem. Thereafter, an optimization algorithm-based technique is proposed to solve the entity resolution problem. The presented approach enables the partitioning of records across entities. A comparative analysis with the genetic algorithm over datasets proves the efficiency of the considered approach.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Enhanced Duplicate Count Strategy

Cited by 2 publications

References 14 publications

IGAEM: Improved Genetic Algorithm based Entity Matching

IGAEM: Improved Genetic Algorithm based Entity Matching

PSOBER: PSO based entity resolution

Contact Info

Product

Resources

About