检索结果-内蒙古大学图书馆

A machine learning based heuristic to predict the efficacy of online sale

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Singhania, Aditya Vikram Mukherjee, Saronyo Lal Majumdar, Ritajit Mehta, Akash Banerjee, Priyanka Bhoumik, Debasmita Department of Computer Science Bhawanipur Education Society College Advanced Computing & Microelectronics Unit Indian Statistical Institute India

It is difficult to decide upon the efficacy of an online sale simply from the discount offered on commodities. Different features have different influence on the price of a product which must be taken into consideration when determining the significance of a discount. In this paper we have proposed a machine learning based heuristic to quantify the "significance" of the discount offered on any commodity. Our proposed technique can quantify the significance of the discount based on features and the original price, and hence can guide a buyer during a sale season by predicting the efficacy of the sale. We have applied this technique on the Flipkart Summer Sale dataset using Support Vector Machine, which predicts the efficacy of the sale with an accuracy of 91.11%. Our result shows that very few mobile phones have a significant discount during the Flipkart Summer Sale. Copyright © 2020, The Authors. All rights reserved.

关键词： Electronic commerce

Time Series Snapshot of Event Boundary Detection and Area Estimation in Wireless Sensor Networks

学校读者我要写书评

暂无评论

Time Series Snapshot of Event Boundary Detection and Area Es...

International Communication Systems and Networks and Workshops, COMSNETS

作者： Srabani Kundu Nabanita Das Avirup Das Guru Nanak Inst. of Technology Kolkata India Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

To monitor the events like forest fire, flood, earth tremor etc., event boundary detection and area estimation are two challenging tasks for Wireless Sensor Networks (WSN). Researchers, so far, have proposed various innovative solutions assuming the event boundary to be static. To monitor spatiotemporal events by WSN, in this paper, we study some existing techniques to report snapshots of event boundary in successive intervals, and compare their performance in respect of accuracy, latency and message communication overhead. Testbed experiments have been done to evaluate the performance and the results show that the computation intensive techniques perform better, provided they satisfy the application specific real time constraint.

关键词： Wireless sensor networks Estimation Monitoring Forestry Real-time systems Time series analysis

i-QER: An Intelligent Approach towards Quantum Error Reduction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Basu, Saikat Saha, Amit Chakrabarti, Amlan Sur-Kolay, Susmita A. K. Choudhury School of Information Technology University of Calcutta and Atos Pune India A. K. Choudhury School of Information Technology University of Calcutta India Advanced Computing & Microelectronics Unit Indian Statistical Institute India

Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A n-qubit quantum system is capable of providing 2n computational space to a quantum algorithm. However, quantum computers are prone to errors. Quantum circuits that can reliably run on today’s Noisy Intermediate-Scale Quantum (NISQ) devices are not only limited by their qubit counts but also by their noisy gate operations. In this paper, we have introduced i-QER, a scalable machine learning-based approach to evaluate errors in a quantum circuit and helps to reduce these without using any additional quantum resources. The i-QER predicts possible errors in a given quantum circuit using supervised learning models. If the predicted error is above a pre-specified threshold, it cuts the large quantum circuit into two smaller sub-circuits using an error-influenced fragmentation strategy for the first time to the best of our knowledge. The proposed fragmentation process is iterated until the predicted error reaches below the threshold for each sub-circuit. The sub-circuits are then executed on a quantum device. Classical reconstruction of the outputs obtained from the sub-circuits can generate the output of the complete circuit. Thus, i-QER also provides classical control over a scalable hybrid computing approach, which is a combination of quantum and classical computers. The i-QER tool is available at https://***/SaikatBasu90/i-QER. © 2021, CC BY.

关键词： Errors

Strong edge coloring of Cayley graphs and some product graphs

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Dara, Suresh Mishra, Suchismita Narayanan, Narayanan Tuza, Zsolt Department of Mathematics School of Advanced Sciences VIT Bhopal University Kothri Kalan Sehore466114 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India Department of Mathematics Indian Institute of Technology Madras Chennai600036 India Alfréd Rényi Institute of Mathematics Budapest Hungary University of Pannonia Veszprém Hungary

A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper we determine the exact value of the strong chromatic index of all unitary Cayley graphs. Our investigations reveal an underlying product structure from which the unitary Cayley graphs emerge. We then go on to give tight bounds for the strong chromatic index of the Cartesian product of two trees, including an exact formula for the product in the case of stars. Further, we give bounds for the strong chromatic index of the product of a tree with a cycle. For any tree, those bounds may differ from the actual value only by not more than a small additive constant (at most 2 for even cycles and at most 5 for odd cycles), moreover they yield the exact value when the length of the cycle is divisible by 4. Copyright © 2021, The Authors. All rights reserved.

关键词： Forestry

Throughput optimization for multirate multicasting through association control in ieee 802.11 wlan 1

学校读者我要写书评

暂无评论

14th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, Qshine 2018

作者： Bhaumick, Dhrubajyoti Ghosh, Sasthi C. Advanced Computing and Microelectronics Unit Indian Statistical Institute 203 B. T. Road KolkataWest Bengal700108 India

ISBN: (数字)9783030144135

ISBN: (纸本)9783030144128

Multicasting in wireless local area network is an efficient way to deliver message from a source user to a specified group of destination users simultaneously. In unirate multicasting, all users belonging to a particular group receive their services at the same basic rate. This may underutilize network resources as users requirements are generally heterogeneous in nature. To resolve this limitation, multirate multicasting is introduced, where different users belonging to a particular group may receive their services at different rates. Often dense deployment of access points (APs) is required for coverage and capacity improvement. Thus an station (STA) may come under the coverage range of several APs and hence there may exists many possible associations between the STAs and the APs. Hence finding an efficient association is very important as individual throughput of the STAs as well as the overall system throughput depend on it. We have developed an efficient algorithm to find an appropriate association for multirate multicasting. The objective is to maximize overall system throughput while respecting the user fairness. Through simulations, we have evaluated and compared the performance of our proposed algorithm with other well-known metrics such as received signal strength indicator, minimum hop-distance, in-range STA number and normalized cost. Results show that the proposed algorithm significantly improves the overall system throughput in comparison to these metrics. © ICST institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019.

关键词： Multicasting

An empirical study of incremental learning in neural network with noisy training set

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chatterjee, Atrayee Ganguly, Shovik Bhoumik, Debasmita Majumdar, Ritajit Asutosh College University of Calcutta Lexmark International India Pvt. Ltd Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

The notion of incremental learning is to train an ANN algorithm in stages, as and when newer training data arrives. Incremental learning is becoming widespread in recent times with the advent of deep learning. Noise in the training data reduces the accuracy of the algorithm. In this paper, we make an empirical study of the effect of noise in the training phase. We numerically show that the accuracy of the algorithm is dependent more on the location of the error than the percentage of error. Using Perceptron, Feed Forward Neural Network and Radial Basis Function Neural Network, we show that for the same percentage of error, the accuracy of the algorithm significantly varies with the location of error. Furthermore, our results show that the dependence of the accuracy with the location of error is independent of the algorithm. However, the slope of the degradation curve decreases with more sophisticated algorithms. Copyright © 2020, The Authors. All rights reserved.

关键词： Errors

Sparsity of weighted networks: Measures and applications

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Goswami, Swati Das, Asit K. Nandy, Subhas C. Department of Computer Science and Technology Indian Institute of Engineering Science and Technology Shibpur Howrah711103 India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata700108 India

A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index defined on ordered degree sequence of simple networks and derives further properties of this index. The range of possible values of sparsity index of any connected network, with edge-count in specific intervals, is worked out analytically in terms of node-count;a pattern is uncovered in corresponding degree sequences to produce highest sparsities. Given the edge-weight frequency distribution of a network, we have formulated an expression of the sparsity index of edge-weights. Its properties are analyzed under different distributions of edge-weights. For example, the upper and lower bounds of sparsity index of edge-weights of a network, having all distinct edge-weights, is determined in terms of its node-count and edge density. The article highlights that this summary index with low computational cost, computed on different network parameters, is useful to reveal different structural and organizational aspects of networks for performing analysis. An application of this index has been demonstrated through overlapping community detection of networks. The results validated on artificial and real-world networks show its efficacy. Copyright © 2020, The Authors. All rights reserved.

关键词： Population dynamics

Scalable and Fair Resource Sharing Among 5G D2D Users and Legacy 4G Users: A Game Theoretic Approach

学校读者我要写书评

暂无评论

Scalable and Fair Resource Sharing Among 5G D2D Users and Le...

International Communication Systems and Networks and Workshops, COMSNETS

作者： Sreetama Mukherjee Sasthi C. Ghosh Microsoft R&D Pvt. Ltd. Hyderabad India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India

ISBN: (数字)9781728131870

ISBN: (纸本)9781728131887

We propose a game theoretic approach to the problem of resource allocation in 5G device to device (D2D) communications underlaying cellular networks, where modern 5G D2D users (DUs) share channel resources of legacy 4G cellular users (CUs). Though such sharing improves scalability as more and more users can be served, the individual throughput obtained by a CU may get reduced when its channel resource is shared by a DU pair. Thus our aim is to increase the overall system throughput while ensuring effective user fairness among the DUs and CUs served. Our approach provides a tradeoff between the two objectives thereby ensuring no legacy CUs are compromised heavily while encouraging modern DUs. We have addressed this fairness problem by thresholding the reduction of the throughput of a CU with respect to its ideal throughput if not reused. We have proposed a game theoretic model in order to make strategic decision for selecting the preferred action configuration in order to meet this objective. Together with this game model and a validation process, we aim to improve scalability, overall system throughput without compromising on the fairness of the users. We have also compared the user fairness achieved by our approach with an existing approach to demonstrate the effectiveness of our game theoretic approach.

关键词： Copper Throughput Games Resource management Device-to-device communication Interference 5G mobile communication

Prediction of the final rank of Players in PUBG with the optimal number of features

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sen, Diptakshi Roy, Rupam Kumar Majumdar, Ritajit Chatterjee, Kingshuk Ganguly, Debayan Department of Computer Science and Engineering University of Calcutta India Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata India Department of Computer Science and Engineering Government College of Engineering and Ceramic Technology India Department of Computer Science and Engineering Government College of Engineering and Leather Technology India

PUBG is an online video game that has become very popular among the youths in recent years. Final rank, which indicates the performance of a player, is one of the most important feature for this game. This paper focuses on predicting the final rank of the players based on their skills and abilities. In this paper we have used different machine learning algorithms to predict the final rank of the players on a dataset obtained from kaggle which has 29 features. Using the correlation heatmap,we have varied the number of features used for the model. Out of these models GBR and LGBM have given the best result with the accuracy of 91.63% and 91.26% respectively for 14 features and the accuracy of 90.54% and 90.01% for 8 features. Although the accuracy of the models with 14 features is slightly better than 8 features, the empirical time taken by 8 features is 1.4x lesser than 14 features for LGBM and 1.5x lesser for GBR. Furthermore, reducing the number of features any more significantly hampers the performance of all the ML models. Therefore, we conclude that 8 is the optimal number of features that can be used to predict the final rank of a player in PUBG with high accuracy and low run-time. © 2021, CC0.

关键词： Forecasting