Real - time download prediction based on the k - nearest neighbor method

Akshata Patil, Sanchita Jha
{"title":"Real - time download prediction based on the k - nearest neighbor method","authors":"Akshata Patil, Sanchita Jha","doi":"10.1109/AHICI.2011.6113929","DOIUrl":null,"url":null,"abstract":"The amount of download prediction or forecast is a statement about the way things will happen in the future, often but not always based on experience or knowledge. While there is much overlap between prediction and forecast, a prediction may be a statement that some outcome is expected, while a forecast may cover a range of possible outcomes. Although guaranteed information about the information is in many cases impossible, prediction is necessary to allow plans to be made about possible developments; Howard H. Stevenson writes that prediction in business “… is at least two things: Important and hard”. In this paper a method is proposed to predict the amount of download in real-time using the k - Nearest neighbor algorithm., the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning where the function is only approximated locally and all computation is deferred until classification.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AHICI.2011.6113929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The amount of download prediction or forecast is a statement about the way things will happen in the future, often but not always based on experience or knowledge. While there is much overlap between prediction and forecast, a prediction may be a statement that some outcome is expected, while a forecast may cover a range of possible outcomes. Although guaranteed information about the information is in many cases impossible, prediction is necessary to allow plans to be made about possible developments; Howard H. Stevenson writes that prediction in business “… is at least two things: Important and hard”. In this paper a method is proposed to predict the amount of download in real-time using the k - Nearest neighbor algorithm., the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning where the function is only approximated locally and all computation is deferred until classification.
基于k近邻法的实时下载预测
下载量预测或预测是关于未来事情发生方式的陈述,通常但并不总是基于经验或知识。虽然预测和预测之间有很多重叠之处,但预测可能是对预期结果的陈述,而预测可能涵盖一系列可能的结果。虽然在许多情况下,关于信息的有保证的信息是不可能的,但预测是必要的,以便对可能的发展作出计划;霍华德·h·史蒂文森(Howard H. Stevenson)写道,商业预测“……至少有两件事:重要和困难”。本文提出了一种利用k近邻算法实时预测下载量的方法。k近邻算法(k-nearest neighbor algorithm, k-NN)是一种基于特征空间中最接近的训练样例对对象进行分类的方法。k-NN是一种基于实例的学习,或懒惰学习,其中函数仅在局部近似,所有计算都延迟到分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信