TRIANGULATING A SIMPLE POLYGONGAREY MR; JOHNSON DJ; PREPARATA FP et al.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 175-179; BIBL. 6 REF.Article

THE CONCEPT OF MUTUAL NEAREST NEIGHBOURHOOD AND ITS APPLICATIONS TO CLUSTERINGCHIDANANDA GOWDA K.1981; CLASSIFICATION AUTOMATIQUE ET PERCEPTION PAR ORDINATEUR. SEMINAIRE/1979/ROCQUENCOURT; FRA; ROCQUENCOURT: INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE; DA. 1981; PP. 7-17; BIBL. 7 REF.Conference Paper

EXTENSIONS DE LA METHODE DES PLUS PROCHES VOISINSDILL ANNE MARIE.1978; ; FRA; DA. 1978; 776; 115 F.; 30 CM; BIBL. 55 REF.; TH. 3EME CYCLE: MATH. APPL., INFORMATIQUE/LYON 1/1978Thesis

THE ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONSLEE DT; PREPARATA FP.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 4; PP. 189-192; BIBL. 4 REF.Article

A NEW ALGORITHM FOR NON-LINEAR MAPPING WITH APPLICATIONS TO DIMENSION AND CLUSTER ANALYSESKAKUSHO O; MIZOGUCHI R.1983; PATTERN RECOGNITION; ISSN 0031-3203; USA; DA. 1983; VOL. 16; NO 1; PP. 109-117; BIBL. 10 REF.Article

APPLICATION OF K-NEAREST-NEIGHBOR DECISION RULE IN VOWEL RECOGNITIONPALIWAL KK; RAO PVS.1983; IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE; ISSN 0162-8828; USA; DA. 1983; VOL. 5; NO 2; PP. 229-230; BIBL. 12 REF.Article

FINDING PROTOTYPES FOR NEAREST NEIGHBOR CLASSIFIERS.CHIN LIANG CHANG.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 11; PP. 1179-1184; BIBL. 9 REF.Article

AN ALGORITHM FOR A SELECTIVE NEAREST NEIGHBOR DECISION RULE.RITTER GL; WOODRUFF HB; LOWRY SR et al.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 6; PP. 665-669; BIBL. 10 REF.Article

CONVERGENCE RATES OF NEAREST NEIGHBOUR DENSITY ESTIMATESCHEN XIRU.1982; SCI. SIN., SER. A, MATH. PHYS. ASTRON. TECH. SCI.; ISSN 504289; CHN; DA. 1982; VOL. 25; NO 5; PP. 455-467; BIBL. 7 REF.Article

A NOTE ON NEAREST-NEIGHBOUR GIBBS AND MARKOV PROBABILITIESSPEED TP.1979; SANKHYA, SER. A; ISSN 0581-572X; IND; DA. 1979; VOL. 41; NO 3-4; PP. 184-197; BIBL. 2 P.Article

MARKOV CONFIGURATION PROCESSES ON A LATTICE.SCHURGER K; TAUTU P.1976; REV. ROUMAINE MATH. PURES APPL.; ROUMAN.; DA. 1976; VOL. 21; NO 2; PP. 233-244; BIBL. 13 REF.Article

PLUS PROCHES VOISINS ET CLASSIFICATION AUTOMATIQUE: APPLICATIONS A DES DONNEES INDUSTRIELLES = CLOSEST NEIGHBORS AND AUTOMATIC CLASSIFICATION: APPLICATIONS TO INDUSTRIAL DATAHASHOM ABDUL AMIER.1982; ; FRA; DA. 1982; 163 F.; 30 CM; BIBL. 81 REF.; TH. 3E CYCLE: INFORM. AUTOM./INST. NATL. SCI. APPL. LYON/1982/ITC 1 82 06Thesis

SOME TWO-DIMENSIONAL DESIGNS BALANCED FOR NEAREST NEIGHBOURSFREEMAN GH.1979; J. R. STATIST. SOC., B; GBR; DA. 1979; VOL. 41; NO 1; PP. 88-95; BIBL. 21 REF.Article

HOW NEIGHBORLY ARE YOUR NEIGHBORS.DASARATHY BV.1978; SOUTHEASTCON '78. INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS. REGION 3. CONFERENCE/1978-04-10/ATLANTA GA; USA; NEW YORK: IEEE; DA. 1978; 38-41; BIBL. 8 REF.Conference Paper

HIERARCHICAL CLUSTERING ALGORITHM BASED ON K-NEAREST NEIGHBORSMIZOGUCHI R; KAKUSHO O.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 314-316; BIBL. 6 REF.Conference Paper

ON THE RELATION OF PERFORMANCE TO EDITING IN NEAREST NEIGHBORS RULESKOPLOWITZ J; BROWN TA.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 214-216; BIBL. 7 REF.Conference Paper

NEAREST NEIGHBOUR MODELS IN THE ANALYSIS OF FIELD EXPERIMENTBARTLETT MS.1978; J. R. STATIST. SOC., B; GBR; DA. 1978; VOL. 40; NO 2; PP. 147-174; BIBL. 29 REF.Article

A NOTE ON TIES IN VOTING WITH THE K-NN RULEDEVIJVER PA.1978; PATTERN RECOGNIT.; GBR; DA. 1978; VOL. 10; NO 4; PP. 297-298; BIBL. 1 REF.Article

INSTABILITY OF THE DECISION SURFACES OF THE NEAREST NEIGHBOUR AND POTENTIAL FUNCTION CLASSIFIERSBATCHELOR BG.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 179-186; BIBL. 5 REF.Serial Issue

A COMPARISON OF THE DECISION SURFACES OF THE NEAREST NEIGBOUR AND POTENTIAL FUNCTION CLASSIFIERSBATCHELOR BG.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 171-178; BIBL. 4 REF.Serial Issue

ALTERNATIVE K-NEAREST NEIGHBOUR RULES IN SUPERVISED PATTERN RECOGNITION. III: CONDENSED NEAREST NEIGHBOUR RULESCOOMANS D; MASSART DL.1982; ANAL. CHIM. ACTA; ISSN 0003-2670; NLD; DA. 1982; VOL. 138; NO 1; PP. 167-176; BIBL. 21 REF.Article

RECOGNITION OF SPATIAL POINT PATTERNSLAVINE D; LAMBIRD BA; KANAL LN et al.1981; CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1981/DALLAS TX; USA; NEW YORK: IEEE; DA. 1981; PP. 49-53; BIBL. 6 REF.Conference Paper

A FAST ALGORITHM FOR RECOGNIZING NEAREST NEIGHBORSSETHI IK.1981; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1981; VOL. 11; NO 3; PP. 245-248; BIBL. 8 REF.Article

THE CLOSED PAIR OF N RANDOM POINTS ON THE SURFACE OF A SPHEREMORAN PAP.1979; BIOMETRIKA; GBR; DA. 1979; VOL. 66; NO 1; PP. 158-162; BIBL. 3 REF.Article

ALL YOU NEEDED TO KNOW ABOUT THE NEIGHBORS (BUT NEVER COULD FIGURE OUT HOW!) RECOGNITION UNDER PARTIAL EXPOSURE AND IMPERFECT SUPERVISIONDASARATHY BV.1979; ICCS 79. INTERNATIONAL CONFERENCE ON CYBERNETICS AND SOCIETY/1979/DENVER CO; USA; NEW YORK: IEEE; DA. 1979; PP. 218-221; BIBL. 12 REF.Conference Paper