PROBABILISTIC RECORD MATCHING USING MACHINE LEARNING TECHNIQUES
نویسندگان
چکیده
منابع مشابه
A Survey of Probabilistic Record Matching Models, Techniques and Tools
Probabilistic record linkage regards the use of stochastic decision models to solve the problem of record linkage (also known as record matching). Data quality has became a key aspect in many institutions and the demand for novel, effective techniques is increasing. Record linkage in general has been studied in the last three decades and a solid probabilistic decision framework has been propose...
متن کاملGraph matching: filtering databases of graphs using machine learning techniques
Graphs are a powerful concept useful for various tasks in science and engineering. In applications such as pattern recognition and information retrieval, object similarity is an important issue. If graphs are used for object representation, then the problem of determining the similarity of objects turns into the problem of graph matching. Some of the most common graph matching paradigms include...
متن کاملSchema Matching using Machine Learning
Schema Matching is a method of finding attributes that are either similar to each other linguistically or represent the same information. In this project, we take a hybrid approach at solving this problem by making use of both the provided data and the schema name to perform one to one schema matching and introduce creation of a global dictionary to achieve one to many schema matching. We exper...
متن کاملImprove Record Linkage Using Active Learning Techniques
Record linkage is a crucial step in data integration and data mining. It has been studied extensively in the past several decades due to its wide-spread applications in e-commerce, healthcare, social sciences and so on. However, many record linkage models are not satisfactory in practice as they neglect an important aspect, which is how to repair the errors that are detected later on in the lin...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Value in Health
سال: 2016
ISSN: 1098-3015
DOI: 10.1016/j.jval.2016.03.1777