نتایج جستجو برای: topological nearest better neighborhood

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

Journal: :CoRR 2001
Masaki Murata Kiyotaka Uchimoto Qing Ma Hitoshi Isahara

This paper describes experiments carried out using a variety of machine-learning methods, including the k-nearest neighborhood method that was used in a previous study, for the translation of tense, aspect, and modality. It was found that the support-vector machine method was the most precise of all the methods tested.

Journal: :Mathematical biosciences and engineering : MBE 2006
Rongsong Liu Jiangping Shuai Jianhong Wu Huaiping Zhu

A patchy model for the spatial spread of West Nile virus is formulated and analyzed. The basic reproduction number is calculated and com- pared for different long-range dispersal patterns of birds, and simulations are carried out to demonstrate discontinuous or jump spatial spread of the virus when the birds' long-range dispersal dominates the nearest neighborhood interaction and diffusion of m...

Journal: :Mathematical Problems in Engineering 2021

The idea of neighborhood systems is induced from the geometric “near,” and it primitive in topological structures. Now, has been extensively applied rough set theory. master contribution this manuscript to generate various topologies by means concepts j -adhesion neighborhoods ideals. Then, we define a new model derived ...

Journal: :Array 2022

Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers clusters finding peaks. The accuracy DPC depends on cutoff distance (dc), cluster number (k) selection clusters. Moreover, final allocation strategy is sensitive poor fault tolerance. shortcomings above make algorithm parameters onl...

Journal: :IEICE Transactions 2014
Nasir Ahmed Abdul Jalil

Manifold learning based image clustering models are usually employed at local level to deal with images sampled from nonlinear manifold. Multimode patterns in image data matrices can vary from nominal to significant due to images with different expressions, pose, illumination, or occlusion variations. We show that manifold learning based image clustering models are unable to achieve well separa...

Journal: :Jurnal Kejuruteraan 2021

Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in graph. This study seeks to solve this using Artificial Bee Colony (ABC) Algorithm along with proposed Discrete Nearest Neighborhood (DNNA). DNNA finds path among points by starting from an arbitrary point. In next steps links will be a guide make tour. other words par...

2009
Alexander Klippel Rui Li

Movement patterns of individual entities at the geographic scale are becoming a prominent research focus in spatial sciences. One pertinent question is how cognitive and formal characterizations of movement patterns relate. In other words, are (mostly qualitative) formal characterizations cognitively adequate? This article experimentally evaluates movement patterns that can be characterized as ...

Journal: :IJAGR 2014
Yelena Ogneva-Himmelberger Fei Meng

A growing number of studies have shown that adequate spatial access to healthy foods leads to increased fresh produce consumption and reduced risk of chronic diseases. Annual dynamics of spatial access to 1,539 vendors of fresh produce (including farmers markets and roadside farm stands) are analyzed in Massachusetts. Travel distance to the nearest fresh produce vendor was calculated for each c...

Journal: :iranian journal of mathematical chemistry 2012
t. doslic

zagreb indices belong to better known and better researched topological indices. weinvestigate here their ability to discriminate among benzenoid graphs and arrive at some quiteunexpected conclusions. along the way we establish tight (and sometimes sharp) lower andupper bounds on various classes of benzenoids.

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

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