使用Kotlin对消息应用程序进行分类

{"title":"使用Kotlin对消息应用程序进行分类","authors":"","doi":"10.46632/daai/3/1/22","DOIUrl":null,"url":null,"abstract":"Over the past few years, short message service (SMS) usage has significantly increased. This service is used to deliver text messages by billions of people. Service providers have launched a number of popular applications, including mobile banking, summons checkpoints, SMS chat, and others. This chapter explores the numerous SMS applications that are available to users and provides an outline of how this service is provided. We examine the causes of its success and the problems that need to be solved. We also look at upcoming trends and the difficulties that to improve this service, certain obstacles must be overcome. This chapter should help you understand how SMS applications work and what to expect from them going forwards given the improvements to current SMS and technological advancement. We propose a privacy-preserving Naive Bayes classifier and apply it to the problem of private text classification. In this setting, a party (Alice) holds a text message, while another party (Bob) holds a classifier. At the end of the protocol, Alice will only learn the result of the classifier applied to her text input and Bob learns nothing. Our solution is based on Secure Multiparty Computation (SMC). Our Rust implementation provides a fast and secure solution for the classification of unstructured text. Applying our solution to the case of spam detection (the solution is generic, and can be used in any other scenario in which the Naive Bayes classifier can be employed), we can classify an SMS as spam or ham in less than 340 ms in the case where the dictionary size of Bob’s model includes all words (n 5200) and Alice’s SMS has at most m 160 unigrams. In the case with n 369 and m 8 (the average of a spam SMS in the database), our solution takes only 21 ms.","PeriodicalId":226827,"journal":{"name":"Data Analytics and Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classifying Message Application Using Kotlin\",\"authors\":\"\",\"doi\":\"10.46632/daai/3/1/22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Over the past few years, short message service (SMS) usage has significantly increased. This service is used to deliver text messages by billions of people. Service providers have launched a number of popular applications, including mobile banking, summons checkpoints, SMS chat, and others. This chapter explores the numerous SMS applications that are available to users and provides an outline of how this service is provided. We examine the causes of its success and the problems that need to be solved. We also look at upcoming trends and the difficulties that to improve this service, certain obstacles must be overcome. This chapter should help you understand how SMS applications work and what to expect from them going forwards given the improvements to current SMS and technological advancement. We propose a privacy-preserving Naive Bayes classifier and apply it to the problem of private text classification. In this setting, a party (Alice) holds a text message, while another party (Bob) holds a classifier. At the end of the protocol, Alice will only learn the result of the classifier applied to her text input and Bob learns nothing. Our solution is based on Secure Multiparty Computation (SMC). Our Rust implementation provides a fast and secure solution for the classification of unstructured text. Applying our solution to the case of spam detection (the solution is generic, and can be used in any other scenario in which the Naive Bayes classifier can be employed), we can classify an SMS as spam or ham in less than 340 ms in the case where the dictionary size of Bob’s model includes all words (n 5200) and Alice’s SMS has at most m 160 unigrams. In the case with n 369 and m 8 (the average of a spam SMS in the database), our solution takes only 21 ms.\",\"PeriodicalId\":226827,\"journal\":{\"name\":\"Data Analytics and Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Data Analytics and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46632/daai/3/1/22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Analytics and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46632/daai/3/1/22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在过去几年中,短消息服务(SMS)的使用显著增加。数十亿人使用这项服务发送短信。服务提供商已经推出了许多流行的应用程序,包括手机银行、召唤检查站、短信聊天等。本章探讨了许多可供用户使用的SMS应用程序,并概述了如何提供此服务。我们研究其成功的原因和需要解决的问题。我们也看到了未来的趋势和困难,为了改善这项服务,必须克服某些障碍。本章将帮助您了解SMS应用程序是如何工作的,以及鉴于当前SMS和技术进步的改进,您对SMS应用程序的期望是什么。提出了一种保护隐私的朴素贝叶斯分类器,并将其应用于私密文本分类问题。在此设置中,一方(Alice)持有文本消息,而另一方(Bob)持有分类器。在协议结束时,Alice将只学习应用于她的文本输入的分类器的结果,而Bob什么也没学到。我们的解决方案是基于安全多方计算(SMC)。我们的Rust实现为非结构化文本的分类提供了一个快速、安全的解决方案。将我们的解决方案应用于垃圾邮件检测的情况(该解决方案是通用的,并且可以用于可以使用朴素贝叶斯分类器的任何其他场景),我们可以在不到340毫秒的时间内将短信分类为垃圾邮件或ham,在这种情况下,Bob模型的字典大小包括所有单词(n 5200), Alice的短信最多有m 160个字节。在n369和m8(数据库中垃圾短信的平均值)的情况下,我们的解决方案只需要21毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Classifying Message Application Using Kotlin
Over the past few years, short message service (SMS) usage has significantly increased. This service is used to deliver text messages by billions of people. Service providers have launched a number of popular applications, including mobile banking, summons checkpoints, SMS chat, and others. This chapter explores the numerous SMS applications that are available to users and provides an outline of how this service is provided. We examine the causes of its success and the problems that need to be solved. We also look at upcoming trends and the difficulties that to improve this service, certain obstacles must be overcome. This chapter should help you understand how SMS applications work and what to expect from them going forwards given the improvements to current SMS and technological advancement. We propose a privacy-preserving Naive Bayes classifier and apply it to the problem of private text classification. In this setting, a party (Alice) holds a text message, while another party (Bob) holds a classifier. At the end of the protocol, Alice will only learn the result of the classifier applied to her text input and Bob learns nothing. Our solution is based on Secure Multiparty Computation (SMC). Our Rust implementation provides a fast and secure solution for the classification of unstructured text. Applying our solution to the case of spam detection (the solution is generic, and can be used in any other scenario in which the Naive Bayes classifier can be employed), we can classify an SMS as spam or ham in less than 340 ms in the case where the dictionary size of Bob’s model includes all words (n 5200) and Alice’s SMS has at most m 160 unigrams. In the case with n 369 and m 8 (the average of a spam SMS in the database), our solution takes only 21 ms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Smart Home Automation Digital Assistant for Video KYC Framework in India Enhancing House Price Predictability: A Comprehensive Analysis of Machine Learning Techniques for Real Estate and Policy Decision-Making Analysis of Machine Learning Models for Hate Speech Detection in Online Content Detection of Diabetic Retinopathy Using KNN & SVM Algorithm
×
引用
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