A novel region based neighbors searching classification algorithm for big data

• The proposed Region Based Neighbors Searching Classification Algorithm (RNSCA) dynamically segments datasets into regions, enabling precise relationship analysis between test samples and existing points. • Point-wise dynamic searching reduces computational overhead by focusing on region-specific data patterns for efficient exploration. • Integration with ensemble learning enhances classification accuracy by synthesizing diverse regional insights from the dataset. • Rigorous comparisons with state-of-the-art models validate the algorithm’s superiority in handling complex datasets. The K-Nearest Neighbors (KNN) algorithm remains a cornerstone of machine learning due to its intuitive design and effectiveness in classification tasks. However, its performance often suffers from critical limitations, such as sensitivity to the choice of the parameter K and an inability to effectively capture complex relationships among neighboring instances. To overcome these challenges, we propose the Region-Based Neighbors Searching Classification Algorithm (RNSCA) —a novel, adaptive framework that significantly enhances the scalability, flexibility, and accuracy of traditional KNN, especially in high-dimensional and large-scale datasets. RNSCA leverages dynamic, region-based partitioning for more focused and efficient neighbor searches and incorporates a weighted activation function to prioritize the most relevant data points during classification. Additionally, ensemble learning techniques are integrated to strengthen model robustness and improve generalization. The proposed algorithm is extensively validated on benchmark datasets including Iris, Crop Recommendation, Breast Cancer, Diabetes, and Chronic Kidney Disease (CKD). Experimental results consistently demonstrate RNSCA’s superior performance in modeling nuanced local structures and mitigating the core limitations of conventional KNN. This research presents a compelling advancement in classification algorithms, with practical implications across domains such as healthcare, agriculture, and environmental intelligence.

Authors

Institutions

Publication Details

Journal
International Journal of Cognitive Computing in Engineering
Published
2025-05-05
DOI
https://doi.org/10.1016/j.ijcce.2025.05.002
Citations
2
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A novel region based neighbors searching classification algorithm for big data

Rajib Kumar Halder, Mohammed Nasir Uddin, Md. Ashraf Uddin
2 citations
International Journal of Cognitive Computing in Engineering
Machine Learning and Data Classification
4.96
article

A novel region based neighbors searching classification algorithm for big data

Rajib Kumar Halder, Mohammed Nasir Uddin, Md. Ashraf Uddin
article en
2 citations

Abstract

• The proposed Region Based Neighbors Searching Classification Algorithm (RNSCA) dynamically segments datasets into regions, enabling precise relationship analysis between test samples and existing points. • Point-wise dynamic searching reduces computational overhead by focusing on region-specific data patterns for efficient exploration. • Integration with ensemble learning enhances classification accuracy by synthesizing diverse regional insights from the dataset. • Rigorous comparisons with state-of-the-art models validate the algorithm’s superiority in handling complex datasets. The K-Nearest Neighbors (KNN) algorithm remains a cornerstone of machine learning due to its intuitive design and effectiveness in classification tasks. However, its performance often suffers from critical limitations, such as sensitivity to the choice of the parameter K and an inability to effectively capture complex relationships among neighboring instances. To overcome these challenges, we propose the Region-Based Neighbors Searching Classification Algorithm (RNSCA) —a novel, adaptive framework that significantly enhances the scalability, flexibility, and accuracy of traditional KNN, especially in high-dimensional and large-scale datasets. RNSCA leverages dynamic, region-based partitioning for more focused and efficient neighbor searches and incorporates a weighted activation function to prioritize the most relevant data points during classification. Additionally, ensemble learning techniques are integrated to strengthen model robustness and improve generalization. The proposed algorithm is extensively validated on benchmark datasets including Iris, Crop Recommendation, Breast Cancer, Diabetes, and Chronic Kidney Disease (CKD). Experimental results consistently demonstrate RNSCA’s superior performance in modeling nuanced local structures and mitigating the core limitations of conventional KNN. This research presents a compelling advancement in classification algorithms, with practical implications across domains such as healthcare, agriculture, and environmental intelligence.

International Journal of Cognitive Computing in EngineeringVol. 6
Jagannath University (BD)
Jagannath University
Openalex Percentile: Top 5%
Machine Learning and Data Classification
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.