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

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

2007
Pádraig Cunningham Sarah Jane Delany

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...

Journal: :ACM Computing Surveys 2021

Perhaps the most straightforward classifier in arsenal or Machine Learning techniques is Nearest Neighbour Classifier—classification achieved by identifying nearest neighbours to a query example and using those determine class of query. This approach classification particular importance, because issues poor runtime performance not such problem these days with computational power that available....

Journal: :Journal of the Royal Statistical Society: Series B (Methodological) 1983

Journal: :Advances in Science, Technology and Engineering Systems Journal 2020

Journal: :Jurnal Sistem Komputer dan Informatika (JSON) 2022

Grandemultipara are women who give birth more than four times usually experience complications in pregnancy and childbirth. or better known as mothers 4 can cause various that will be experienced by the mother, one of which is bleeding. pregnancies included high-risk pregnancies, because occur either during The K-NN algorithm applied process diagnosing human diseases, so several references take...

Journal: :Advances in Applied Probability 2005

Journal: :Knowledge and Information Systems 2005

Journal: :CoRR 2013
Eric Christiansen

The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points accumulated by CNN. The bound originates in a bound on the number of times the ...

2008
Thomas Keller Sebastian Kupferschmid

In recent years, researchers started to study the game of Skat. The strength of existing Skat playing programs is definitely the card play phase. The bidding phase, however, has been treated quite poorly so far. This is a severe drawback since bidding abilities influence the overall playing performance drastically. In this paper we present a powerful bidding engine which is based on a k-nearest...

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

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