Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Fast agglomerative clustering using a k-nearest neighbor graph.

Pasi Fränti1, Olli Virmajoki, Ville Hautamäki

  • 1Speech and Image Processing Unit, Department of Computer Science, University of Joensuu, Finland. franti@cs.joensuu.fi

IEEE Transactions on Pattern Analysis and Machine Intelligence
|October 27, 2006
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Personalized Nutrition Recommendations Using a Bayesian Mixture Model of Concentration Constraints and Intake Preferences.

Statistics in medicine·2026
Same author

Music emotion classification based on random swap algorithm.

Scientific reports·2025
Same author

Designing a clustering algorithm for optimizing health station locations.

International journal of health geographics·2025
Same author

Inferring personal intake recommendations of phosphorous and potassium for end-stage renal failure patients by simulating with Bayesian hierarchical multivariate model.

PloS one·2024
Same author

Can we optimize locations of hospitals by minimizing the number of patients at risk?

BMC health services research·2023
Same author

Representation Learning and Reinforcement Learning for Dynamic Complex Motion Planning System.

IEEE transactions on neural networks and learning systems·2023
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces a faster agglomerative clustering algorithm using approximate nearest neighbor graphs. The method significantly reduces computational complexity while maintaining high clustering quality.

Area of Science:

  • Computer Science
  • Machine Learning
  • Data Mining

Background:

  • Agglomerative clustering is a common hierarchical clustering method.
  • Traditional methods have high computational complexity, limiting scalability.
  • Efficient clustering algorithms are crucial for large datasets.

Purpose of the Study:

  • To develop a computationally efficient agglomerative clustering algorithm.
  • To reduce the number of distance calculations required in clustering.
  • To improve the time complexity of agglomerative clustering.

Main Methods:

  • Proposed a fast agglomerative clustering method.
  • Utilized an approximate nearest neighbor graph.
  • Reduced distance calculations by focusing on neighbor proximity.

Related Experiment Videos

Main Results:

  • Achieved improved time complexity from O(tauN^2) to O(tauNlogN).
  • Demonstrated that a small neighborhood size maintains clustering quality.
  • Showcased a slight, acceptable increase in distortion.

Conclusions:

  • The proposed method offers a significant speedup for agglomerative clustering.
  • Approximate nearest neighbor graphs are effective for efficient clustering.
  • The algorithm is suitable for large-scale data analysis.