No article text was recorded for this version.
k-nearest neighbor graph sparsification
Version 1 of 177 papers91 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Batching and Matching for Food Delivery in Dynamic Road Networks
- Blog: Deep Group-Shuffling Random Walk for Person Re-Identification
- Blog: Unsupervised Detection of Cover Song Sets: Accuracy Improvement and Original Identification
- Blog: A Method for Synthesizing Ultra-Large-Scale Clock Trees
- Blog: Face Clustering: Representation and Pairwise Constraints
- Blog: Unsupervised Classification in Hyperspectral Imagery With Nonlocal Total Variation and Primal-Dual Hybrid Gradient Algorithm
- Blog: Adversarial Generative Flow Network for Solving Vehicle Routing Problems
- Blog: NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem
- Blog: Efficient Parameter-Free Clustering Using First Neighbor Relations
- Blog: Automatic Image Segmentation by Dynamic Region Merging
- Blog: Large Scale Graph Learning From Smooth Signals
- Blog: EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems
- Blog: Unsupervised Deep Graph Structure and Embedding Learning
- Blog: Learning 3-opt heuristics for traveling salesman problem via deep reinforcement learning
- Blog: Node Feature Kernels Increase Graph Convolutional Network Robustness
- Blog: UP2ME: Univariate Pre-training to Multivariate Fine-tuning as a General-purpose Framework for Multivariate Time Series Analysis
- Blog: Structure-preserving visualization for single-cell RNA-Seq profiles using deep manifold transformation with batch-correction
- Blog: GRAND+: Scalable Graph Random Neural Networks
- Blog: Fine-Grained Named Entity Typing over Distantly Supervised Data Based on Refined Representations
- Blog: GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension
- Blog: Machine Learning in Airline Crew Pairing to Construct Initial Clusters for Dynamic Constraint Aggregation
- Blog: DAG-Structured Clustering by Nearest Neighbors
- Blog: Enhanced Remote Sensing Image Compression Method Using Large Network with Sparse Extracting Strategy
- Blog: Geodesic Sinkhorn For Fast and Accurate Optimal Transport on Manifolds
- Blog: Fast Spectral Clustering Using Autoencoders and Landmarks
- Blog: MSCRS: Multi-modal Semantic Graph Prompt Learning Framework for Conversational Recommender Systems
- Blog: Batching and Matching for Food Delivery in Dynamic Road Networks
- Blog: Fast Training of Nonlinear Embedding Algorithms
- Blog: Community detection with manifold learning on speaker i-vector space for Chinese
- Blog: Label-informed Graph Structure Learning for Node Classification
- Blog: Scalable Spectral Clustering Using Random Binning Features
- Blog: Leveraging Sparsity for Efficient Submodular Data Summarization
- Blog: Mixture Modeling by Affinity Propagation
- Blog: ClusterFuG: Clustering Fully connected Graphs by Multicut
- Blog: Graph Neural Networks for Modelling Traffic Participant Interaction
- Blog: Graph-Revised Convolutional Network
- Blog: Making Fast Graph-based Algorithms with Graph Metric Embeddings
- Blog: DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction
- Blog: Learning to Propagate for Graph Meta-Learning
- Blog: Simplicial SMOTE: Oversampling Solution to the Imbalanced Learning Problem
- Blog: Sparse Decomposition of Graph Neural Networks
- Blog: A versatile framework for attributed network clustering via K-nearest neighbor augmentation
- Blog: Cascade Image Matting with Deformable Graph Refinement
- Blog: Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion
- Blog: Efficient Low-Rank GNN Defense Against Structural Attacks
- Blog: Missing data imputation with adversarially-trained graph convolutional networks
- Blog: HiCoS-Net: hierarchical cross-modal graph learning with dynamic attention for hard negative-aware image-text matching
- Blog: Structure Aware L1 Graph for Data Clustering
- Blog: Multi-Stain Self-Attention Graph Multiple Instance Learning Pipeline for Histopathology Whole Slide Images
- Blog: Social content matching in MapReduce
- Blog: Learning Latent Relations for Temporal Knowledge Graph Reasoning
- Blog: An Empirical Study of Graph-Based Approaches for Semi-supervised Time Series Classification
- Blog: Fast Network Embedding Enhancement via High Order Proximity Approximation
- Blog: Large Graph Construction for Scalable Semi-Supervised Learning
- Blog: Identifying The Most Informative Features Using A Structurally Interacting Elastic Net
- Blog: Set2Graph: Learning Graphs From Sets
- Blog: GLAN: A Graph-based Linear Assignment Network
- Blog: Making Fast Graph-based Algorithms with Graph Metric Embeddings
- Blog: Adversarial Generative Flow Network for Solving Vehicle Routing Problems
- Blog: Large Scale Graph Learning from Smooth Signals
Showing 60 of 77 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_k_nearest_neighbor_graph_sparsification_556c7fee,
title = {k-nearest neighbor graph sparsification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/k-nearest-neighbor-graph-sparsification/rdr_556c7fee0a894c14ac5a023ee919234b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_k_nearest_neighbor_graph_sparsification_556c7fee_v1,
title = {k-nearest neighbor graph sparsification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/k-nearest-neighbor-graph-sparsification/rdr_556c7fee0a894c14ac5a023ee919234b/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}