Dense neighborhoods on affinity graph

DOI10.1007/s11263-011-0496-1zbMath1254.68212OpenAlexW2107196083MaRDI QIDQ1931579

Xingwei Yang, Longin Jan Latecki, Shuicheng Yan, Hai-Rong Liu

Publication date: 15 January 2013

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11263-011-0496-1

zbMATH Keywords

clusteringnearest neighborsemi-supervised learningaffinity graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Uses Software

• UCI-ml
• LIBSVM
• apcluster
• APCluster

Cites Work

• Clustering by Passing Messages Between Data Points
• Approximate nearest neighbor queries revisited
• Complexity of finding dense subgraphs
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Multidimensional binary search trees used for associative searching
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Nearest neighbor pattern classification
• <tex>k_n</tex>-nearest neighbor classification
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dense neighborhoods on affinity graph