Comparative Study of Instance Based Learning and Back Propagation for Classification Problems
원문 초록
The paper presents a comparative study of the performance of Back Propagation and Instance Based Learning Algorithm for classification tasks. The study is carried out by a series of experiments will all possible combinations of parameter values for the algorithms under evaluation. The algorithm's classification accuracy is compared over a range of datasets and measurements like Cross Validation, Kappa Statistics, Root Mean Squared Value and True Positive vs False Positive rate have been used to evaluate their performance. Along with performance comparison, techniques of handling missing values have also been compared that include Mean or Mode replacement and Multiple Imputation. The results showed that parameter adjustment plays vital role in improving an algorithm's accuracy and therefore, Back Propagation has shown better results as compared to Instance Based Learning. Furthermore, the problem of missing values was better handled by Multiple imputation method, however, not suitable for less amount of data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Cross-Domain Conditional Diffusion Models for Time Series Imputation
Integrative Analysis and Imputation of Multiple Data Streams via Deep Gaussian Processes
ImputeINR: Time Series Imputation via Implicit Neural Representations for Disease Diagnosis with Missing Data
Clustering Rooftop PV Systems via Probabilistic Embeddings
Prediction Models That Learn to Avoid Missing Values
OmicsQ: A User-Friendly Platform for Interactive Quantitative Omics Data Analysis
토론
이 논문과 연결된 포럼 글이 아직 없습니다.