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

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

2015
Asha B. Chelani

Air quality forecasting using nearest neighbour technique provides an alternative to statistical and neural network models, which needs the information on predictor variables and understanding of underlying patterns in the data. k-nearest neighbour method of forecasting that does not assume any linear or nonlinear form of the data is used in this study to obtain the next step forecast of PM10 c...

2005
Eva Gómez-Ballester Luisa Micó José Oncina

Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration. This paper tests two new types of improvements in a real data enviro...

Journal: :Journal of Mathematical Biology 2021

Abstract Many popular algorithms for searching the space of leaf-labelled (phylogenetic) trees are based on tree rearrangement operations. Under any such operation, problem is reduced to a graph where vertices and (undirected) edges given by pairs connected one operation (sometimes called move). Most classical nearest neighbour interchange, subtree prune regraft, bisection reconnection moves. T...

Journal: :International Journal of Information and Education Technology 2012

Journal: :Monthly Notices of the Royal Astronomical Society 1989

Journal: :Random Struct. Algorithms 2008
Mathew D. Penrose Andrew R. Wade

In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic behaviour of the total power-weighted length of the ONG on uniform random points in (0, 1)d. In particular, for d = 1 and weight exponent α > 1/2, the limitin...

1989
SULIMAN AL-HAWAMDEH PETER WILLETT

This paper discusses the searching of full-text documents to identify paragraphs that are relevant to a user request. Given a natural language query statement, a nearest neighbour search involves ranking the paragraphs comprising a full-text document in order of descending similarity with the query, where the similarity for each paragraph is determined by the number of keyword stems that it has...

Journal: :Engineering Letters 2008
Mozammel H. A. Khan

computer algorithms require an 'oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and the functional outputs are realized along ancillary input constants (0 or 1). Recently, a nearest neighbour template based synthesis method of quantum Boolean circuits has been proposed to overcome the adjacency requirement of the...

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

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