KRISHI
ICAR RESEARCH DATA REPOSITORY FOR KNOWLEDGE MANAGEMENT
(An Institutional Publication and Data Inventory Repository)
"Not Available": Please do not remove the default option "Not Available" for the fields where metadata information is not available
"1001-01-01": Date not available or not applicable for filling metadata infromation
"1001-01-01": Date not available or not applicable for filling metadata infromation
Please use this identifier to cite or link to this item:
http://krishi.icar.gov.in/jspui/handle/123456789/81532
Title: | Development and Assessment of SPM: A Sigmoid-Based Model for Probability Estimation in Non-Repetitive Unit Selection With Replacement |
Other Titles: | Not Available |
Authors: | SAMARTH GODARA G. AVINASH RAJENDER PARSAD SUDEEP MARWAHA MUKHTAR AHMAD FAIZ RAM SWAROOP BANA |
ICAR Data Use Licennce: | http://krishi.icar.gov.in/PDF/ICAR_Data_Use_Licence.pdf |
Author's Affiliated institute: | ICAR::Indian Agricultural Statistics Research Institute Department of Agronomy, Afghanistan National Agricultural Sciences and Technology University, Kandahar ICAR::Indian Agricultural Research Institute |
Published/ Complete Date: | 2024-01-01 |
Project Code: | Not Available |
Keywords: | Probability estimation, sigmoid function, modeling, non-repetitive units selection, optimization. |
Publisher: | Not Available |
Citation: | Not Available |
Series/Report no.: | Not Available; |
Abstract/Description: | Probability estimation plays a pivotal role across diverse domains, particularly in scenarios where the objective is to select non-repetitive units one at a time, with the option of replacement, from a predefined set of units. Traditional probability calculations in this scenario pose three challenges: the number of floating-point operations to be executed is directly proportional to the chosen set size, susceptibility to floating-point precision errors, and exponential growth in storage needs with increasing number of chosen units. In this scenario, the presented work aims to develop SPM: a sigmoid function-based model that estimates probabilities for such problems with a fixed number of calculations (independent of the input parameter), achieving a constant time complexity algorithm. The research methodology involves generating probability data points, selecting the optimal sigmoid function, augmenting additional data to enhance parameter estimation, identifying parameter estimation equations, and evaluating the model. Moreover, the study’s second objective includes training and comparing six established machine learning-based models (including Decision Tree, Random Forest, Support Vector, Linear Regression, Nearest Neighbour, and Artificial Neural Network) against the proposed SPM. The rigorous assessment of the model’s performance, utilising metrics including RMSE, MAE and r2 across a wide range of scenarios involving varying values of the total units, affirms the model’s accuracy and resilience. The study findings can improve decision- making processes in various domains, including statistics, cryptography, machine learning and optimisation, by offering a faster, more adaptable solution for probability estimation in units’ selection with replacement. |
Description: | Not Available |
ISSN: | Not Available |
Type(s) of content: | Research Paper |
Sponsors: | Not Available |
Language: | English |
Name of Journal: | IEEE Access |
Journal Type: | NAAS Journal list |
NAAS Rating: | Not Available |
Impact Factor: | Not Available |
Volume No.: | 12 |
Page Number: | 16421-16430 |
Name of the Division/Regional Station: | Not Available |
Source, DOI or any other URL: | 10.1109/ACCESS.2024.3359055 |
URI: | http://krishi.icar.gov.in/jspui/handle/123456789/81532 |
Appears in Collections: | AEdu-IASRI-Publication |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Development_and_Assessment_of_SPM_A_Sigmoid-Based_Model_for_Probability_Estimation_in_Non-Repetitive_Unit_Selection_With_Replacement.pdf | 1.26 MB | Adobe PDF | View/Open |
Items in KRISHI are protected by copyright, with all rights reserved, unless otherwise indicated.