实现算法k -最近邻pagada网站推荐笔记本电脑

Chandra Arief Rahardja, Try Juardi, Halim Agung
{"title":"实现算法k -最近邻pagada网站推荐笔记本电脑","authors":"Chandra Arief Rahardja, Try Juardi, Halim Agung","doi":"10.24002/JBI.V10I1.1847","DOIUrl":null,"url":null,"abstract":"There are various types of laptops that make consumers or prospective buyers have difficulty in making choices accurately and precisely. The K-Nearest Neighbor (K-NN) algorithm was chosen because the K-NN algorithm is a form of model that can help classify data based on the closest distance. This system is designed to help prospective buyers in choosing a laptop based on purchase objectives such as gaming, design, and office, price, also specifications regarding the desired laptop. This system helps provide a shadow or reference to users or prospective buyers in determining the selection of laptops as needed. Based on user satisfaction test, from testing carried out to 10 users. As a result, 8 out of 10 people answered with the answers agreeing with the results of the recommendations given, with the results of the percentage of satisfaction with the recommendations of 80%, therefore the recommendations of laptops made were declared successful","PeriodicalId":381749,"journal":{"name":"Jurnal Buana Informatika","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"IMPLEMENTASI ALGORITMA K-NEAREST NEIGHBOR PADA WEBSITE REKOMENDASI LAPTOP\",\"authors\":\"Chandra Arief Rahardja, Try Juardi, Halim Agung\",\"doi\":\"10.24002/JBI.V10I1.1847\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are various types of laptops that make consumers or prospective buyers have difficulty in making choices accurately and precisely. The K-Nearest Neighbor (K-NN) algorithm was chosen because the K-NN algorithm is a form of model that can help classify data based on the closest distance. This system is designed to help prospective buyers in choosing a laptop based on purchase objectives such as gaming, design, and office, price, also specifications regarding the desired laptop. This system helps provide a shadow or reference to users or prospective buyers in determining the selection of laptops as needed. Based on user satisfaction test, from testing carried out to 10 users. As a result, 8 out of 10 people answered with the answers agreeing with the results of the recommendations given, with the results of the percentage of satisfaction with the recommendations of 80%, therefore the recommendations of laptops made were declared successful\",\"PeriodicalId\":381749,\"journal\":{\"name\":\"Jurnal Buana Informatika\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Buana Informatika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24002/JBI.V10I1.1847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Buana Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24002/JBI.V10I1.1847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

各式各样的笔记本电脑让消费者或潜在买家很难准确、准确地做出选择。选择k -最近邻(K-NN)算法是因为K-NN算法是一种模型形式,可以帮助根据最近距离对数据进行分类。该系统旨在帮助潜在买家根据购买目标(如游戏、设计和办公)、价格以及所需笔记本电脑的规格来选择笔记本电脑。该系统有助于为用户或潜在买家在决定笔记本电脑的选择时提供一个影子或参考。基于用户满意度测试,从测试进行到10个用户。结果,10个人中有8个人回答的答案同意所给出的建议的结果,结果对建议的满意率为80%,因此笔记本电脑的推荐被宣布为成功
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IMPLEMENTASI ALGORITMA K-NEAREST NEIGHBOR PADA WEBSITE REKOMENDASI LAPTOP
There are various types of laptops that make consumers or prospective buyers have difficulty in making choices accurately and precisely. The K-Nearest Neighbor (K-NN) algorithm was chosen because the K-NN algorithm is a form of model that can help classify data based on the closest distance. This system is designed to help prospective buyers in choosing a laptop based on purchase objectives such as gaming, design, and office, price, also specifications regarding the desired laptop. This system helps provide a shadow or reference to users or prospective buyers in determining the selection of laptops as needed. Based on user satisfaction test, from testing carried out to 10 users. As a result, 8 out of 10 people answered with the answers agreeing with the results of the recommendations given, with the results of the percentage of satisfaction with the recommendations of 80%, therefore the recommendations of laptops made were declared successful
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Blackbox Testing on Virtual Reality Gamelan Saron Using Equivalence Partition Method Implementasi Perbaikan Kualitas Citra Tanaman terhadap Perbedaan Kamera untuk Prediksi Pigmen Fotosintesis berbasis Machine Learning Comparative Analysis of Sound Response from Simple and Fuzzy Algorithm in Saron Virtual Reality Klasterisasi Puskesmas dengan K-Means Berdasarkan Data Kualitas Kesehatan Keluarga dan Gizi Masyarakat Analisis Sentimen Ulasan Aplikasi Jamsostek Mobile Menggunakan Metode Support Vector Machine
×
引用
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