نتایج جستجو برای: k nearest neighbour

تعداد نتایج: 400172  

2014
Marcin Pietrzykowski

The paper presents use of the mini-models method in a classification task. The article briefly describes the method and compares it to the k-nearest neighbor algorithm. The algorithm concentrates only on local query data and uses a data samples only from local neighborhood of the query. The paper presents the results of experiment that compare the effectiveness of mini-models with selected meth...

Journal: :Expert Syst. Appl. 2005
Songbo Tan

Text categorization or classification is the automated assigning of text documents to pre-defined classes based on their contents. Many of classification algorithms usually assume that the training examples are evenly distributed among different classes. However, unbalanced data sets often appear in many practical applications. In order to deal with uneven text sets, we propose the neighbor-wei...

2009
Mark Eastwood Bogdan Gabrys

We investigate the length of event sequence giving best predictions when using a continuous HMM approach to churn prediction from sequential data. Motivated by observations that predictions based on only the few most recent events seem to be the most accurate, a non-sequential dataset is constructed from customer event histories by averaging features of the last few events. A simple K-nearest n...

2012
Kevin Sim Emma Hart Ben Paechter

A hyper-heuristic for the one dimensional bin packing problem is presented that uses an Evolutionary Algorithm (EA) to evolve a set of attributes that characterise a problem instance. The EA evolves divisions of variable quantity and dimension that represent ranges of a bin’s capacity and are used to train a k-nearest neighbour algorithm. Once trained the classifier selects a single determinist...

2001
Rawesak Tanawongsuwan Aaron F. Bobick

This paper demonstrates gait recognition using only the trajectories of lower body joint angles projected into the walking plane. For this work, we begin with the position of 3D markers as projected into the sagittal or walking plane. We show a simple method for estimating the planar offsets between the markers and the underlying skeleton and joints; given these offsets we compute the joint ang...

Journal: :JSW 2014
Xiangyan Meng Zhongxue Zhang Xinying Xu

This paper proposes a novel k-nearest neighbor algorithm to predict soil moisture in maize field. In order to estimate soil moisture in maize field accurately without any destruction to root and soil, this paper uses biological characteristics of maize to estimate soil moisture, including plant height, leaf area, stem diameter, dry weight and fresh weight, all the values of which are non-negati...

2011
Isaac Triguero Francisco Herrera

Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. A great number of methods tackling the prototype generation problem have been proposed in the literature. This technical report provides a survey of the most representative algorithms developed so far. A previously proposed categorization has been used to...

2008
Mark Oliver Güld Thomas Martin Deserno

This work reports baseline results for the CLEF 2008 Medical Automatic Annotation Task (MAAT) by applying a classifier with a fixed parameter set to all tasks 2005 – 2008. The classifier performs a weighted combination of three distance and similarity measures operating on global image features: Scaled-down representations of the images are compared via metrics that model the typical variabilit...

2014
Stephen Gould Jiecheng Zhao Xuming He Yuhang Zhang

We present a fast approximate nearest neighbor algorithm for semantic segmentation. Our algorithm builds a graph over superpixels from an annotated set of training images. Edges in the graph represent approximate nearest neighbors in feature space. At test time we match superpixels from a novel image to the training images by adding the novel image to the graph. A move-making search algorithm a...

1997
Joel Ratsaby

We consider the general problem of learning multi-category classification from labeled examples. We present experimental results for a nearest neighbor algorithm which actively selects samples from different pattern classes according to a querying rule instead of the a priori class probabilities. The amount of improvement of this query-based approach over the passive batch approach depends on t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید