Geospatial knowledge discovery framework for crime domain
Transactions on computational science XIII
Voting based extreme learning machine
Information Sciences: an International Journal
Comparing image classification methods: K-nearest-neighbor and support-vector-machines
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Combining color and haar wavelet responses for aerial image classification
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
Recognition of driving postures by multiwavelet transform and multilayer perceptron classifier
Engineering Applications of Artificial Intelligence
Robust emotional speech classification in the presence of babble noise
International Journal of Speech Technology
A hybrid approach for extracting informative content from web pages
Information Processing and Management: an International Journal
Ensemble Classifier for Benign-Malignant Mass Classification
International Journal of Computer Vision and Image Processing
A new bio-inspired unsupervised learning method
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Hi-index | 0.01 |
Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R ⋃ B comes from R (respectively, B). This rule implicitly partitions space into a red set and a blue set that are separated by a red-blue decision boundary. In this paper we develop output-sensitive algorithms for computing this decision boundary for point sets on the line and in ℝ2. Both algorithms run in time O(n log k), where k is the number of points that contribute to the decision boundary. This running time is the best possible when parameterizing with respect to n and k.