Sparse data classifier based on the first-past-the-post voting system

M. Cudak, Mateusz Piech, R. Marcjan
{"title":"Sparse data classifier based on the first-past-the-post voting system","authors":"M. Cudak, Mateusz Piech, R. Marcjan","doi":"10.7494/csci.2022.23.2.4086","DOIUrl":null,"url":null,"abstract":"Point of Interest (POI) is a general term for objects describing places from the real world. The concept of POIs matching, i.e. determining whether two sets of attributes represent the same location, is not a trivial challenge due to the large variety of data sources. The representation of POIs may vary depending on the base in which they are stored. Manual comparison of objects with each other is not achievable in real-time, therefore there are multiple solutions to automatic merging. However there is no efficient solution that includes the deficiencies in the existence of attributes, has been proposed so far. In this paper, we propose the Multilayered Hybrid Classifier which is composed of machine learning and deep learning techniques, supported by the first-past-the-post voting system. We examined different weights for constituencies which were taken into consideration during the majority (or supermajority) decision. As a result, we achieved slightly higher accuracy than the current best model - Random Forest, which in its working also base on voting.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"75 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7494/csci.2022.23.2.4086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Point of Interest (POI) is a general term for objects describing places from the real world. The concept of POIs matching, i.e. determining whether two sets of attributes represent the same location, is not a trivial challenge due to the large variety of data sources. The representation of POIs may vary depending on the base in which they are stored. Manual comparison of objects with each other is not achievable in real-time, therefore there are multiple solutions to automatic merging. However there is no efficient solution that includes the deficiencies in the existence of attributes, has been proposed so far. In this paper, we propose the Multilayered Hybrid Classifier which is composed of machine learning and deep learning techniques, supported by the first-past-the-post voting system. We examined different weights for constituencies which were taken into consideration during the majority (or supermajority) decision. As a result, we achieved slightly higher accuracy than the current best model - Random Forest, which in its working also base on voting.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于得票最多投票系统的稀疏数据分类器
兴趣点(POI)是描述来自现实世界的地点的对象的通用术语。poi匹配的概念,即确定两组属性是否表示相同的位置,由于数据源种类繁多,这不是一个简单的挑战。poi的表示可能因存储它们的基而异。手动比较对象之间的实时性是无法实现的,因此存在多种自动合并的解决方案。然而,目前还没有一种有效的解决方案能够包含属性存在的不足。在本文中,我们提出了多层混合分类器,该分类器由机器学习和深度学习技术组成,由得票最多的投票系统支持。我们研究了在多数(或绝对多数)决定时所考虑的选区的不同权重。因此,我们获得了比目前最好的模型——随机森林(Random Forest)略高的准确性,随机森林的工作也基于投票。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the Parameterized Complexity of s-club Cluster Deletion Problems Spiking neural P systems with weights and delays on synapses Iterated Uniform Finite-State Transducers on Unary Languages Lazy Regular Sensing State Complexity of Finite Partial Languages
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1