https://github.com/qedsoftware/sparsehc

Online hierarchical clustering, "forked" from BitBucket. Modifying it so that it compiles.
https://github.com/qedsoftware/sparsehc

Last synced: about 1 year ago
JSON representation

Online hierarchical clustering, "forked" from BitBucket. Modifying it so that it compiles.

• Host: GitHub
• URL: https://github.com/qedsoftware/sparsehc
• Owner: qedsoftware
• Created: 2015-05-21T22:30:48.000Z (about 11 years ago)
• Default Branch: master
• Last Pushed: 2015-05-21T22:31:56.000Z (about 11 years ago)
• Last Synced: 2025-03-29T03:51:16.598Z (about 1 year ago)
• Language: C++
• Size: 117 KB
• Stars: 7
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

          
sparsehc: Memory-efficient hierarchical clustering

Compile:

	From Eclipse: Add the whole downloaded project to workspace and build

	From Linux terminal: Go to the Release folder and type "make"

	The executable file is Release/sparsehc

Command:

		

	./sparsehc --matrix= --tree= --size=

	--threshold= --linkage=

Parameters:

	

	--matrix=%s	Path to the input matrix file 

	--tree=%s 	Path to the output tree file 

	--size=%u	Number of data points 

	--dim=%u	Dimension of each point 

	--threshold=%f	The maximum distance value in the input distance matrix 

	--linkage=%s	The linkage type: average, complete or single 	

		

Example: 

	./sparsehc --matrix=/Data/sparse_matrix.dat --tree=/Data/average_tree.txt --size=100 --threshold=0.5 --linkage=average

	

Data: 

	To randomly generate pairwise Euclidean distance matrices of different sizes and dimensions:

	https://bitbucket.org/ngthuydiem/simmat