Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Technique for fast and efficient hierarchical clustering

Patent ·
OSTI ID:1108968
A fast and efficient technique for hierarchical clustering of samples in a dataset includes compressing the dataset to reduce a number of variables within each of the samples of the dataset. A nearest neighbor matrix is generated to identify nearest neighbor pairs between the samples based on differences between the variables of the samples. The samples are arranged into a hierarchy that groups the samples based on the nearest neighbor matrix. The hierarchy is rendered to a display to graphically illustrate similarities or differences between the samples.
Research Organization:
SNL-A (Sandia National Laboratories, Albuquerque, NM (United States))
Sponsoring Organization:
USDOE
DOE Contract Number:
AC04-94AL85000
Assignee:
Sandia Corporation (Albuquerque, NM)
Patent Number(s):
8,554,771
Application Number:
12/636,898
OSTI ID:
1108968
Country of Publication:
United States
Language:
English

References (3)

A fast encoding algorithm for vector quantization journal December 1997
Fast hierarchical clustering and other applications of dynamic closest pairs journal December 2000
Efficient algorithms for agglomerative hierarchical clustering methods journal December 1984

Similar Records

Technique for fast and efficient hierarchical clustering
Patent · 2013 · OSTI ID:1096771

A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression
Journal Article · 2018 · Proceedings - IEEE International Parallel and Distributed Processing Symposium (IPDPS) · OSTI ID:1563957

Pair-cluster theory for the dielectric constant of composite media
Journal Article · 1980 · Phys. Rev., B: Condens. Matter; (United States) · OSTI ID:7039035