BibSLEIGH — nearest neighbour tag

nearest neighbour

nearest neighbour

Tag #nearest neighbour

201 papers:

CIKM-2019-ZhangH #multi #named: GRIP: Multi-Store Capacity-Optimized High-Performance Nearest Neighbor Search for Vector Search Engine (MZ, YH), pp. 1673–1682.
ECIR-p2-2019-PritsosRS #distance #identification #using #web: Open-Set Web Genre Identification Using Distributional Features and Nearest Neighbors Distance Ratio (DAP, AR0, ES), pp. 3–11.
ICML-2019-Chen #analysis #bound #consistency #fault #kernel: Nearest Neighbor and Kernel Survival Analysis: Nonasymptotic Error Bounds and Strong Consistency Rates (GHC), pp. 1001–1010.
ICML-2019-FrosstPH: Analyzing and Improving Representations with the Soft Nearest Neighbor Loss (NF, NP, GEH), pp. 2012–2020.
ICML-2019-LeiHKT #sublinear: Sublinear Time Nearest Neighbor Search over Generalized Weighted Space (YL, QH, MSK, AKHT), pp. 3773–3781.
KDD-2019-RamS: Revisiting kd-tree for Nearest Neighbor Search (PR, KS), pp. 1378–1388.
ECIR-2018-ChehreghaniC #performance: Efficient Context-Aware K-Nearest Neighbor Search (MHC, MHC), pp. 466–478.
ICML-2018-KeivaniS #using: Improved nearest neighbor search using auxiliary information and priority functions (OK, KS), pp. 2578–2586.
ICML-2018-WangJC #robust: Analyzing the Robustness of Nearest Neighbors to Adversarial Examples (YW, SJ, KC), pp. 5120–5129.
ICPR-2018-QiuLL #clustering #named: D-NND: A Hierarchical Density Clustering Method via Nearest Neighbor Descent (TQ, CL, YL), pp. 1414–1419.
CIKM-2017-LiuCC #approximate #named: PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization (YL, HC, JC), pp. 667–676.
ECIR-2017-BhattacharjeeA #algorithm #clustering #dataset #incremental: Batch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets (PB, AA), pp. 568–574.
ICML-2017-LiM #performance: Fast k-Nearest Neighbour Search via Prioritized DCI (KL, JM), pp. 2081–2090.
KDD-2017-Tagami #approximate #classification #multi #named: AnnexML: Approximate Nearest Neighbor Search for Extreme Multi-label Classification (YT), pp. 455–464.
ICML-2016-LiM #performance: Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing (KL, JM), pp. 671–679.
ICPR-2016-BarddalGGBE #learning: Overcoming feature drifts via dynamic feature weighted k-nearest neighbor learning (JPB, HMG, JG, AdSBJ, FE), pp. 2186–2191.
ICPR-2016-BicegoL #revisited: Weighted K-Nearest Neighbor revisited (MB, ML), pp. 1642–1647.
ICPR-2016-OzanKG #approximate: Joint K-Means quantization for Approximate Nearest Neighbor Search (ECO, SK, MG), pp. 3645–3649.
PODS-2015-Kapralov #complexity #query #trade-off: Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search (MK), pp. 329–342.
SIGMOD-2015-WangZZLC #effectiveness: Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates (XW, YZ, WZ, XL, MAC), pp. 923–938.
VLDB-2015-YangCLW #analysis #query: Reverse k Nearest Neighbors Query Processing: Experiments and Analysis (SY, MAC, XL, WW), pp. 605–616.
CIKM-2015-AnastasiuK #graph #named #performance: L2Knng: Fast Exact K-Nearest Neighbor Graph Construction with L2-Norm Pruning (DCA, GK), pp. 791–800.
CIKM-2015-ParkHL #performance #using: A Fast k-Nearest Neighbor Search Using Query-Specific Signature Selection (YP, HH, SgL), pp. 1883–1886.
ECIR-2015-ChappellGZ #approximate #slicing: Approximate Nearest-Neighbour Search with Inverted Signature Slice Lists (TC, SG, GZ), pp. 147–158.
ICML-2015-BerlindU: Active Nearest Neighbors in Changing Environments (CB, RU), pp. 1870–1879.
SEKE-2015-CostaSRSAP #collaboration: A Collaborative Method to Reduce the Running Time and Accelerate the k-Nearest Neighbors Search (AAMC, RRdS, FBAR, GS, HOdA, AP), pp. 105–109.
DAC-2015-SonghoriHSK #logic #privacy #synthesis #using: Compacting privacy-preserving k-nearest neighbor search using logic synthesis (EMS, SUH, ARS, FK), p. 6.
PDP-2015-SongRHM #pipes and filters: Solutions for Processing K Nearest Neighbor Joins for Massive Data on MapReduce (GS, JR, FH, FM), pp. 279–287.
STOC-2015-MulzerNSS #approximate: Approximate k-flat Nearest Neighbor Search (WM, HLN, PS, YS), pp. 783–792.
SIGMOD-2014-WuJZ #graph #performance #query #random #scalability: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
VLDB-2014-LiuCHLS #approximate #named #performance: SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search (YL, JC, ZH, HL, HTS), pp. 745–756.
VLDB-2015-DallachiesaPI14 #nondeterminism: Top-k Nearest Neighbor Search In Uncertain Data Series (MD, TP, IFI), pp. 13–24.
VLDB-2015-SunWQZL14 #approximate #named #query: SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.
CIG-2014-YamamotoMCT #algorithm #deduction #game studies #using: Deduction of fighting-game countermeasures using the k-nearest neighbor algorithm and a game simulator (KY, SM, CYC, RT), pp. 1–5.
ICML-c1-2014-GiesekeHOI #query: Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs (FG, JH, CEO, CI), pp. 172–180.
ICML-c2-2014-Cherian #using: Nearest Neighbors Using Compact Sparse Codes (AC), pp. 1053–1061.
ICML-c2-2014-KontorovichW #multi: Maximum Margin Multiclass Nearest Neighbors (AK, RW), pp. 892–900.
ICML-c2-2014-ZhangDW #approximate: Composite Quantization for Approximate Nearest Neighbor Search (TZ, CD, JW), pp. 838–846.
ICPR-2014-RenYZH #classification #image #learning: Learning Convolutional Nonlinear Features for K Nearest Neighbor Image Classification (WR, YY, JZ, KH), pp. 4358–4363.
RecSys-2014-VerstrepenG #collaboration: Unifying nearest neighbors collaborative filtering (KV, BG), pp. 177–184.
HPDC-2014-PrisacariRHCMH #network #performance: Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks (BP, GR, PH, DC, CM, TH), pp. 129–140.
PODS-2013-AgarwalAHPYZ #nondeterminism: Nearest neighbor searching under uncertainty II (PKA, BA, SHP, JMP, KY, WZ), pp. 115–126.
VLDB-2014-NiedermayerZERM0K13 #nondeterminism #probability #query: Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories (JN, AZ, TE, MR, NM, LC, HPK), pp. 205–216.
CIKM-2013-BogdanovS #effectiveness #network #scalability: Accurate and scalable nearest neighbors in large networks based on effective importance (PB, AKS), pp. 1009–1018.
SIGIR-2013-CuiMLWR #automation #image: Ranking-oriented nearest-neighbor based method for automatic image annotation (CC, JM, TL, XW, ZR), pp. 957–960.
DAC-2013-ShafaeiSP #architecture #distance #interactive #linear #optimisation #quantum: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures (AS, MS, MP), p. 6.
PODS-2012-AgarwalESZ #nondeterminism: Nearest-neighbor searching under uncertainty (PKA, AE, SS, WZ), pp. 225–236.
VLDB-2012-LuSCO #performance #pipes and filters #using: Efficient Processing of k Nearest Neighbor Joins using MapReduce (WL, YS, SC, BCO), pp. 1016–1027.
WCRE-2012-LavoieKMZ #clone detection #detection #repository #using: Inferring Repository File Structure Modifications Using Nearest-Neighbor Clone Detection (TL, FK, EM, YZ), pp. 325–334.
WCRE-2012-TianLS #classification #debugging #fine-grained #information retrieval #predict: Information Retrieval Based Nearest Neighbor Classification for Fine-Grained Bug Severity Prediction (YT, DL, CS), pp. 215–224.
CIKM-2012-CreceliusS #graph #maintenance #scalability: Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs (TC, RS), pp. 952–961.
CIKM-2012-LiXF #database #keyword: Keyword-based k-nearest neighbor search in spatial databases (GL, JX, JF), pp. 2144–2148.
CIKM-2012-YanZN12a #query: Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces (DY, ZZ, WN), pp. 942–951.
ICML-2012-AlamgirL #distance #graph #random: Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.
ICML-2012-HeKC #on the: On the Difficulty of Nearest Neighbor Search (JH, SK, SFC), p. 9.
ICPR-2012-BougesCBL #classification #using: Using k-nearest neighbors to handle missing weak classifiers in a boosted cascade (PB, TC, CB, GL), pp. 1763–1766.
ICPR-2012-ChengYLL #categorisation #kernel: A Pyramid Nearest Neighbor Search Kernel for object categorization (HC, RY, ZL, YL), pp. 2809–2812.
ICPR-2012-Noh #analysis #classification #learning #metric: χ2 Metric learning for nearest neighbor classification and its analysis (SN), pp. 991–995.
KDIR-2012-ChueaphunKMC #random #recognition #using: Lanna Dharma Printed Character Recognition using k-Nearest Neighbor and Conditional Random Fields (CC, AK, SM, JC), pp. 169–174.
SIGMOD-2011-LuLC: Reverse spatial and textual k nearest neighbor search (JL, YL, GC), pp. 349–360.
VLDB-2011-BerneckerEKRZZ #nondeterminism #performance #probability #query: Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data (TB, TE, HPK, MR, SZ, AZ), pp. 669–680.
CIKM-2011-CachedaCFF #algorithm #analysis #dataset: Improving k-nearest neighbors algorithms: practical application of dataset analysis (FC, VC, DF, VF), pp. 2253–2256.
CIKM-2011-ParkSBY #distance #query: k-Nearest neighbor query processing method based on distance relation pattern (YP, DS, KB, JY), pp. 2413–2416.
CIKM-2011-TomasevRMI #approach #classification #probability: A probabilistic approach to nearest-neighbor classification: naive hubness bayesian kNN (NT, MR, DM, MI), pp. 2173–2176.
ICML-2011-KpotufeL #clustering: Pruning nearest neighbor cluster trees (SK, UvL), pp. 225–232.
KDD-2011-DalviKMR #using: Sampling hidden objects using nearest-neighbor oracles (NND, RK, AM, VR), pp. 1325–1333.
MLDM-2011-LungaE #classification: Spherical Nearest Neighbor Classification: Application to Hyperspectral Data (DL, OKE), pp. 170–184.
MLDM-2011-TomasevRMI #classification #fuzzy #metric: Hubness-Based Fuzzy Measures for High-Dimensional k-Nearest Neighbor Classification (NT, MR, DM, MI), pp. 16–30.
SIGMOD-2010-ZhengFZ #fuzzy: K-nearest neighbor search for fuzzy objects (KZ, GPCF, XZ), pp. 699–710.
VLDB-2010-PapadopoulosBP #privacy: Nearest Neighbor Search with Strong Location Privacy (SP, SB, DP), pp. 619–629.
VLDB-2010-PotamiasBGK #graph #nondeterminism: k-Nearest Neighbors in Uncertain Graphs (MP, FB, AG, GK), pp. 997–1008.
VLDB-2010-SharifzadehS #diagrams #named #performance #query: VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries (MS, CS), pp. 1231–1242.
ICPR-2010-ChenS #classification #scalability: Hierarchical Large Margin Nearest Neighbor Classification (QC, SS), pp. 906–909.
ICPR-2010-ChernoffN: Weighting of the k-Nearest-Neighbors (KC, MN), pp. 666–669.
ICPR-2010-MicoO #algorithm #constant #performance: A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index (LM, JO), pp. 3911–3914.
ICPR-2010-ShibataKI #classification #performance #scalability: Large Margin Discriminant Hashing for Fast k-Nearest Neighbor Classification (TS, SK, SI), pp. 1015–1018.
KDD-2010-SarkarM #graph #performance: Fast nearest-neighbor search in disk-resident graphs (PS, AWM), pp. 513–522.
KDIR-2010-ViswanathBK #classification #performance #set: A Method to Generate a Reduced Training Set for Faster and Better Nearest Neighbor Classification (PV, VSB, TNK), pp. 232–236.
SAC-2010-ShinLKLI #database #network #performance: Efficient shortest path finding of k-nearest neighbor objects in road network databases (SHS, SCL, SWK, JL, EGI), pp. 1661–1665.
SIGMOD-2009-ChenSZY #monitoring #network: Monitoring path nearest neighbor in road networks (ZC, HTS, XZ, JXY), pp. 591–602.
SIGMOD-2009-GaoZ #database #query: Continuous obstructed nearest neighbor queries in spatial databases (YG, BZ), pp. 577–590.
SIGMOD-2009-TaoYSK #performance #quality: Quality and efficiency in high dimensional nearest neighbor search (YT, KY, CS, PK), pp. 563–576.
VLDB-2009-WongOYFL #performance: Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor (RCWW, MTÖ, PSY, AWCF, LL), pp. 1126–1137.
VLDB-2009-XingSP #monitoring: Continuous Monitoring of Nearest Neighbors on Land Surface (SX, CS, BP), pp. 1114–1125.
ICML-2009-RadovanovicNI: Nearest neighbors in high-dimensional data: the emergence and influence of hubs (MR, AN, MI), pp. 865–872.
VLDB-2008-BeskalesSI #database #nondeterminism #performance: Efficient search for the top-k probable nearest neighbors in uncertain databases (GB, MAS, IFI), pp. 326–339.
VLDB-2008-WuYCT #named #query: FINCH: evaluating reverse k-Nearest-Neighbor queries on location data (WW, FY, CYC, KLT), pp. 1056–1067.
ECIR-2008-NaKL08b #evaluation: Revisit of Nearest Neighbor Test for Direct Evaluation of Inter-document Similarities (SHN, ISK, JHL), pp. 674–678.
ICML-2008-Cayton #performance #retrieval: Fast nearest neighbor retrieval for bregman divergences (LC), pp. 112–119.
KDD-2008-Christen #automation #classification #using: Automatic record linkage using seeded nearest neighbour and support vector machine classification (PC), pp. 151–159.
SIGIR-2008-GengLQALS #query #ranking #using: Query dependent ranking using K-nearest neighbor (XG, TYL, TQ, AA, HL, HYS), pp. 115–122.
SAC-2008-FonsecaCC #algorithm #named: k-RNN: k-relational nearest neighbour algorithm (NAF, VSC, RC), pp. 944–948.
DRR-2006-AndraZ #classification #consistency: Style consistent nearest neighbor classifier (SA, XZ).
SIGMOD-2006-AchtertBKKPR #metric #performance: Efficient reverse k-nearest neighbor search in arbitrary metric spaces (EA, CB, PK, PK, AP, MR), pp. 515–526.
VLDB-2006-MouratidisYPM #monitoring #network: Continuous Nearest Neighbor Monitoring in Road Networks (KM, MLY, DP, NM), pp. 43–54.
ICEIS-J-2006-BerkovskyEM06a #collaboration #retrieval: Retrieval of Collaborative Filtering Nearest Neighbors in a Content-Addressable Space (SB, YE, LMM), pp. 159–178.
CIKM-2006-AchtertBKKPR #approximate #metric #query: Approximate reverse k-nearest neighbor queries in general metric spaces (EA, CB, PK, PK, AP, MR), pp. 788–789.
CIKM-2006-XiongCL #classification #database #multi: k nearest neighbor classification across multiple private databases (LX, SC, LL), pp. 840–841.
ICML-2006-BeygelzimerKL: Cover trees for nearest neighbor (AB, SK, JL), pp. 97–104.
ICPR-v1-2006-MollerR #approach #clustering: A Cluster Validity Approach based on Nearest-Neighbor Resampling (UM, DR), pp. 892–895.
ICPR-v2-2006-ChouKC #reduction: The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method (CHC, BHK, FC), pp. 556–559.
ICPR-v2-2006-DelannayAV #adaptation #automation: Automatic Adjustment of Discriminant Adaptive Nearest Neighbor (ND, CA, MV), pp. 552–535.
ICPR-v2-2006-LuB #image #performance #retrieval: Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search (ZML, HB), p. 853–?.
ICPR-v2-2006-Mainar-RuizP #approximate #multi #using: Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points (GMR, JCPC), pp. 502–505.
ICPR-v3-2006-GinnekenM #image: Image Denoising with k-nearest Neighbor and Support Vector Regression (BvG, AM), pp. 603–606.
ICPR-v3-2006-LiC #classification #probability #using: Classification Using the Local Probabilistic Centers of k-Nearest Neighbors (BYL, YWC), pp. 1220–1223.
ICPR-v3-2006-LouJ #adaptation #classification #novel: Novel Adaptive Nearest Neighbor Classifiers Based On Hit-Distance (ZL, ZJ), pp. 87–90.
ICPR-v3-2006-YangZ #recognition: Regression Nearest Neighbor in Face Recognition (SY, CZ), pp. 515–518.
ICPR-v4-2006-LiC06a #classification #probability #using: Classification Using the Local Probabilistic Centers of k-Nearest Neighbors (BYL, YWC), p. 954.
SAC-2006-AbidinP #classification #data mining #mining #named #performance #scalability: SMART-TV: a fast and scalable nearest neighbor based classifier for data mining (TA, WP), pp. 536–540.
SAC-2006-AlmeidaG #algorithm #database #incremental #network #using: Using Dijkstra’s algorithm to incrementally find the k-Nearest Neighbors in spatial network databases (VTdA, RHG), pp. 58–62.
STOC-2006-AilonC #approximate #performance: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (NA, BC), pp. 557–563.
SIGMOD-2005-PapadiasMH #clustering #concept #monitoring #performance: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring (KM, MH, DP), pp. 634–645.
CIG-2005-BouzyC #generative #integration: Bayesian Generation and Integration of K-nearest-neighbor Patterns for 19x19 Go (BB, GC).
CIKM-2005-XiaHL #estimation #named #performance #retrieval: ERkNN: efficient reverse k-nearest neighbors retrieval with local kNN-distance estimation (CX, WH, MLL), pp. 533–540.
ICML-2005-Angiulli #performance: Fast condensed nearest neighbor rule (FA), pp. 25–32.
VLDB-2004-KolahdouzanS #database #network: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases (MRK, CS), pp. 840–851.
ICALP-2004-KrauthgamerL #black box #complexity: The Black-Box Complexity of Nearest Neighbor Search (RK, JRL), pp. 858–869.
ICEIS-v2-2004-Martinez-OtzetaS #algorithm #analysis #probability: Analysis of the Iterated Probabilistic Weighted K Nearest Neighbor Method, a new Distance-Based Algorithm (JMMO, BS), pp. 233–240.
ICPR-v1-2004-DomeniconiY: Nearest Neighbor Ensemble (CD, BY), pp. 228–231.
ICPR-v1-2004-TremblaySM #algorithm #multi #optimisation #random #search-based #using: Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm (GT, RS, PM), p. 208.
ICPR-v3-2004-HautamakiKF #detection #graph #using: Outlier Detection Using k-Nearest Neighbour Graph (VH, IK, PF), pp. 430–433.
ICPR-v3-2004-KatoW #algorithm #classification #performance: Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers (TK, TW), pp. 474–477.
ICPR-v3-2004-ParedesV #fault #learning #prototype #reduction: Learning Prototypes and Distances (LPD). A Prototype Reduction Technique based on Nearest Neighbor Error Minimization (RP, EV), pp. 442–445.
ICPR-v4-2004-HottaKM #category theory #pattern matching #pattern recognition #recognition #using: Pattern Recognition Using Average Patterns of Categorical k-Nearest Neighbors (SH, SK, SM), pp. 412–415.
ICPR-v4-2004-Moreno-SecoMO #classification #rule-based: A New Classification Rule based on Nearest Neighbour Search (FMS, LM, JO), pp. 408–411.
ICPR-v4-2004-ViswanathMB #classification #pattern matching #pattern recognition #performance #recognition #synthesis: A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition (PV, MNM, SB), pp. 416–419.
SAC-2004-DingH #clustering #consistency #information management #optimisation: K-nearest-neighbor consistency in data clustering: incorporating local information into global optimization (CHQD, XH), pp. 584–589.
SAC-2004-QianSGP #distance #query #similarity: Similarity between Euclidean and cosine angle distance for nearest neighbor queries (GQ, SS, YG, SP), pp. 1232–1237.
ICDAR-2003-LuT03a #approach #documentation #estimation: Improved Nearest Neighbor Based Approach to Accurate Document Skew Estimation (YL, CLT), pp. 503–507.
PODS-2003-AggarwalA #on the: On nearest neighbor indexing of nonlinear trajectories (CCA, DA), pp. 252–259.
VLDB-2003-IwerksSS #query: Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates (GSI, HS, KPS), pp. 512–523.
CIKM-2003-SinghFT #query: High dimensional reverse nearest neighbor queries (AS, HF, AST), pp. 91–98.
KDD-2003-AlonsoBLB #adaptation: An adaptive nearest neighbor search for a parts acquisition ePortal (RA, JAB, HL, CB), pp. 693–698.
ASE-2003-RenierisR #fault #locality #query: Fault Localization With Nearest Neighbor Queries (MR, SPR), pp. 30–39.
SIGMOD-2002-Aggarwal #estimation #framework #reduction: Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neighbor search (CCA), pp. 452–463.
VLDB-2002-KornMS #data type: Reverse Nearest Neighbor Aggregates Over Data Streams (FK, SM, DS), pp. 814–825.
VLDB-2002-TaoPS: Continuous Nearest Neighbor Search (YT, DP, QS), pp. 287–298.
CIKM-2002-GaoYW #query #streaming: Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching (LG, ZY, XSW), pp. 485–492.
ICPR-v3-2002-PengHD #adaptation #classification #kernel #metric: Adaptive Kernel Metric Nearest Neighbor Classification (JP, DRH, HKD), pp. 33–36.
STOC-2002-BeameV #communication #complexity #multi #problem #trade-off: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (PB, EV), pp. 688–697.
STOC-2002-KargerR #metric #strict: Finding nearest neighbors in growth-restricted metrics (DRK, MR), pp. 741–750.
JCDL-2001-YuSMQ #database #distributed #query: Database selection for processing k nearest neighbors queries in distributed environments (CTY, PS, WM, YQ), pp. 215–222.
CIAA-2001-Savary #finite: Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction (AS), pp. 251–260.
CIKM-2001-KimAY #effectiveness #metric: Effective Nearest Neighbor Indexing with the Euclidean Metric (SWK, CCA, PSY), pp. 9–16.
ICML-2001-DomeniconiG #approach #approximate #classification #dataset #multi #performance #query #scalability: An Efficient Approach for Approximating Multi-dimensional Range Queries and Nearest Neighbor Classification in Large Datasets (CD, DG), pp. 98–105.
ICML-2001-RozsypalK #algorithm #classification #search-based #using: Using the Genetic Algorithm to Reduce the Size of a Nearest-Neighbor Classifier and to Select Relevant Attributes (AR, MK), pp. 449–456.
SIGMOD-2000-KornM #query #set: Influence Sets Based on Reverse Nearest Neighbor Queries (FK, SM), pp. 201–212.
VLDB-2000-GoldsteinR: Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches (JG, RR), pp. 429–440.
VLDB-2000-HinneburgAK #question #what: What Is the Nearest Neighbor in High Dimensional Spaces? (AH, CCA, DAK), pp. 506–515.
CIKM-2000-WangW #approximate: Supporting Subseries Nearest Neighbor Search via Approximation (CW, XSW), pp. 314–321.
ICML-2000-KubatC #classification #subclass: Voting Nearest-Neighbor Subclassifiers (MK, MCJ), pp. 503–510.
ICML-2000-MullinS #classification: Complete Cross-Validation for Nearest Neighbor Classifiers (MDM, RS), pp. 639–646.
ICML-2000-OkamotoY #algorithm #analysis: Generalized Average-Case Analyses of the Nearest Neighbor Algorithm (SO, NY), pp. 695–702.
ICPR-v2-2000-ChenHF #algorithm: Winner-Update Algorithm for Nearest Neighbor Search (YSC, YPH, CSF), pp. 2704–2707.
ICPR-v2-2000-DasarathyS #algorithm #editing: Tandem Fusion of Nearest Neighbor Editing and Condensing Algorithms — Data Dimensionality Effects (BVD, JSS), pp. 2692–2695.
ICPR-v2-2000-HuangCSG #classification #prototype: Constructing Optimized Prototypes for Nearest Neighbor Classifiers (YSH, CCC, JWS, WELG), pp. 2017–2020.
ICPR-v2-2000-Kangas #classification #comparison #prototype #representation: Comparison between Two Prototype Representation Schemes for a Nearest Neighbor Classifier (JK), pp. 2773–2776.
ICPR-v2-2000-MitaniH #classification #design #using: Classifier Design Based on the Use of Nearest Neighbor Samples (YM, YH), pp. 2769–2772.
ICPR-v3-2000-TongW #approximate #image: Approximate Nearest Neighbor Search for Fractal Image Compression Based on a New Affine Transform Parametrization (CT, MW), pp. 3223–3227.
STOC-2000-BarkolR #bound #problem: Tighter bounds for nearest neighbor search and related problems in the cell probe model (OB, YR), pp. 388–396.
STOC-2000-MuthukrishnanS #approximate #comparison #sequence: Approximate nearest neighbors and sequence comparison with block operations (SM, SCS), pp. 416–424.
ICDAR-1999-JiangBW #clustering #detection #documentation #image: Skew Detection of Document Images by Focused Nearest-Neighbor Clustering (XJ, HB, DWK), pp. 629–632.
ICDAR-1999-LiuN99a #algorithm #classification #learning #prototype #recognition: Prototype Learning Algorithms for Nearest Neighbor Classifier with Application to Handwritten Character Recognition (CLL, MN), pp. 378–381.
ICML-1999-BlanzieriR #classification #metric: A Minimum Risk Metric for Nearest Neighbor Classification (EB, FR), pp. 22–31.
KDD-1999-BennettFG #approximate #query: Density-Based Indexing for Approximate Nearest-Neighbor Queries (KPB, UMF, DG), pp. 233–243.
PDP-1999-CortesRSPL #algorithm #on the #parallel #performance: On the performance of nearest-neighbors load balancing algorithms in parallel systems (AC, AR, MÀS, PP, EL), pp. 170–177.
STOC-1999-BorodinOR #bound #problem: Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
STOC-1999-ChakrabartiCGL #approximate #bound #complexity: A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.
SIGMOD-1998-SeidlK #multi: Optimal Multi-Step k-Nearest Neighbor Search (TS, HPK), pp. 154–165.
ICML-1998-Bay #classification #multi #set: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets (SDB), pp. 37–45.
ICPR-1998-BhattacharyaK #set: Reference set thinning for the k-nearest neighbor decision rule (BKB, DK), pp. 238–242.
ICPR-1998-JuanVA #algorithm #approximate #performance: Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA) (AJ, EV, PA), pp. 828–830.
ICPR-1998-PalauS #approximate #classification #performance: The labelled cell classifier: a fast approximation to k nearest neighbors (AMP, RRS), pp. 823–827.
STOC-1998-IndykM #approximate #towards: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality (PI, RM), pp. 604–613.
STOC-1998-KushilevitzOR #approximate #performance: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (EK, RO, YR), pp. 614–623.
PODS-1997-BerchtoldBKK #cost analysis: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space (SB, CB, DAK, HPK), pp. 78–86.
SIGMOD-1997-KatayamaS #query: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries (NK, SS), pp. 369–380.
STOC-1997-Clarkson #metric #query: Nearest Neighbor Queries in Metric Spaces (KLC), pp. 609–617.
STOC-1997-Kleinberg #algorithm: Two Algorithms for Nearest-Neighbor Search in High Dimensions (JMK), pp. 599–608.
VLDB-1996-KornSFSP #database #image #performance: Fast Nearest Neighbor Search in Medical Image Databases (FK, NS, CF, ELS, ZP), pp. 215–226.
ICML-1996-AkkusG #classification: K Nearest Neighbor Classification on Feature Projections (AA, HAG), pp. 12–19.
ICML-1996-GrolimundG #memory management: Speeding-up Nearest Neighbour Memories: The Template Tree Case Memory Organisation (SG, JGG), pp. 225–233.
ICML-1996-OkamotoY #analysis #classification: Theoretical Analysis of the Nearest Neighbor Classifier in Noisy Domains (SO, NY), pp. 355–363.
ICPR-1996-HuangLSSSLTH #approach #classification #prototype: A simulated annealing approach to construct optimized prototypes for nearest-neighbor classification (YSH, KL, CYS, AJS, IIS, MCL, RYT, PKH), pp. 483–487.
ICDAR-v1-1995-HongLHS #classification #design #recognition: The design of a nearest-neighbor classifier and its use for Japanese character recognition (TH, SWKL, JJH, SNS), pp. 270–273.
ICDAR-v2-1995-DrouhardSG #case study #classification #comparative #network #using #verification: Comparative study of the k nearest neighbour, threshold and neural network classifiers for handwritten signature verification using an enhanced directional PDF (JPD, RS, MG), pp. 807–810.
SIGMOD-1995-RoussopoulosKV #query: Nearest Neighbor Queries (NR, SK, FV), pp. 71–79.
ICML-1995-Drakopoulos #bound #classification #fault: Bounds on the Classification Error of the Nearest Neighbor Rule (JAD), pp. 203–208.
KDD-1995-HastieT #adaptation #classification: Discriminant Adaptive Nearest Neighbor Classification (TH, RT), pp. 142–149.
ICDAR-1993-Bunke #algorithm #performance #taxonomy #word: A fast algorithm for finding the nearest neighbor of a word in a dictionary (HB), pp. 632–637.
ICDAR-1993-Yan #classification #design #implementation #recognition: Design and implementation of optimized nearest neighbor classifiers for handwritten digit recognition (HY), pp. 10–13.
ICDAR-1993-Yan93a #classification #image #segmentation #using: Color map image segmentation using optimized nearest neighbor classifiers (HY), pp. 111–114.
ICALP-1992-PatersonY #graph #on the: On Nearest-Neighbor Graphs (MP, FFY), pp. 416–426.
STOC-1992-CallahanK #composition #multi: A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (PBC, SRK), pp. 546–556.
ICALP-1985-KarlssonMR #bound #problem: The Nearest Neighbor Problem on Bounded Domains (RGK, JIM, ELR), pp. 318–327.
ICALP-1983-Dehne #algorithm #diagrams #on the: On O(N^4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching (FKHAD), pp. 160–172.
SIGIR-1981-SmeatonR #algorithm #bound #information retrieval #problem #using: The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds (AFS, CJvR), pp. 83–87.
ICALP-1980-PapadimitriouB #analysis #worst-case: A Worst-Case Analysis of Nearest Neighbor Searching by Projection (CHP, JLB), pp. 470–482.
SIGIR-1980-Weiss #algorithm #probability: A Probabilistic Algorithm for Nearest Neighbour Searching (SFW), pp. 325–333.
SIGIR-1978-EastmanW #algorithm #documentation #retrieval: A Tree Algorithm For Nearest Neighbor Searching In Document Retrieval Systems (CME, SFW), pp. 131–149.