MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "a1cd2028-dacc-43b4-a3d6-3ab410665ea0"}, "_deposit": {"id": "4783", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4783"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4783", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Efficient Data Partitioning for Entity Resolution Systems", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Entity Resolution is the task of identifying duplicated records that refer to the same real-world entity. It is costly process that can take up to days for large datasets. Various Blocking Methods have been applied in Entity Resolution Systems to reduce the number of record pairs for comparison. It is still a big issue because a good blocking key is critical to the success of a blocking method and will ideally result in lots of small blocks. The efficiency of a blocking method is hindered by these large blocks since the resulting number of record pairs is dominated by the sizes of these large blocks. So, the researchers are still doing researches on handling the problems of large blocks. To overcome these problems, we would like to propose an efficient data partitioning system by introducing “Dynamic Block Based Structure” to enhance the blocking efficiency."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "entity resolution"}, {"interim": "data matching"}, {"interim": "data linkage"}, {"interim": "indexing"}, {"interim": "pre-processing"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value": []}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eleventh International Conference On Computer Applications (ICCA 2013)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Mon, Aye Chan"}, {"subitem_authors_fullname": "Thwin, Mie Mie Su"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2013-02-26"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/672"}, "item_title": "Efficient Data Partitioning for Entity Resolution Systems", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004783", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-11"}, "publish_date": "2019-07-11", "publish_status": "0", "recid": "4783", "relation": {}, "relation_version_is_last": true, "title": ["Efficient Data Partitioning for Entity Resolution Systems"], "weko_shared_id": -1}
Efficient Data Partitioning for Entity Resolution Systems
http://hdl.handle.net/20.500.12678/0000004783
http://hdl.handle.net/20.500.12678/0000004783603cad24-1cf2-4713-80f4-4044f77048b9
a1cd2028-dacc-43b4-a3d6-3ab410665ea0
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Efficient Data Partitioning for Entity Resolution Systems | |||||
Language | en | |||||
Publication date | 2013-02-26 | |||||
Authors | ||||||
Mon, Aye Chan | ||||||
Thwin, Mie Mie Su | ||||||
Description | ||||||
Entity Resolution is the task of identifying duplicated records that refer to the same real-world entity. It is costly process that can take up to days for large datasets. Various Blocking Methods have been applied in Entity Resolution Systems to reduce the number of record pairs for comparison. It is still a big issue because a good blocking key is critical to the success of a blocking method and will ideally result in lots of small blocks. The efficiency of a blocking method is hindered by these large blocks since the resulting number of record pairs is dominated by the sizes of these large blocks. So, the researchers are still doing researches on handling the problems of large blocks. To overcome these problems, we would like to propose an efficient data partitioning system by introducing “Dynamic Block Based Structure” to enhance the blocking efficiency. | ||||||
Keywords | ||||||
entity resolution, data matching, data linkage, indexing, pre-processing | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/672 | |||||
Journal articles | ||||||
Eleventh International Conference On Computer Applications (ICCA 2013) | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |