N. Vlajic, Dimitrios Makrakis, Charalambos Charalambous
{"title":"Near optimal wireless data broadcasting based on an unsupervised neural network learning algorithm","authors":"N. Vlajic, Dimitrios Makrakis, Charalambos Charalambous","doi":"10.1109/IJCNN.2001.939112","DOIUrl":null,"url":null,"abstract":"Wireless data broadcasting (WDB) is proven to be an efficient information delivery mechanism of nearly unlimited scalability. However, successful performance of a WDB based system is not always guaranteed-it strongly depends on the system's ability to identify the most popular information (documents) among users and accurately estimate their actual request probabilities. In this paper, we argue that a recently proposed unsupervised neural network algorithm possesses the key properties of an ideal estimator of document request probabilities. Obtained simulation results support the theoretical assumptions and suggest a near optimal performance of a WDB based system employing the given algorithm.","PeriodicalId":346955,"journal":{"name":"IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2001.939112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Wireless data broadcasting (WDB) is proven to be an efficient information delivery mechanism of nearly unlimited scalability. However, successful performance of a WDB based system is not always guaranteed-it strongly depends on the system's ability to identify the most popular information (documents) among users and accurately estimate their actual request probabilities. In this paper, we argue that a recently proposed unsupervised neural network algorithm possesses the key properties of an ideal estimator of document request probabilities. Obtained simulation results support the theoretical assumptions and suggest a near optimal performance of a WDB based system employing the given algorithm.