a hierachical clustering algorithm based on information theory
Project description
info-clustering
Usage
After installing info_cluster
package, you can use it as follows:
from info_cluster import InfoCluster
import networkx as nx
g = nx.Graph() # undirected graph
g.add_edge(0, 1, weight=1)
g.add_edge(1, 2, weight=1)
g.add_edge(0, 2, weight=5)
ic = InfoCluster(affinity='precomputed') # use precomputed graph structure
ic.fit(g)
ic.print_hierarchical_tree()
The output is like
/-0
/-|
--| \-2
|
\-1
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
info_cluster-0.7.tar.gz
(5.5 kB
view hashes)
Built Distribution
Close
Hashes for info_cluster-0.7-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | b790b43539a4407a4cb16ff15748095d1a51ed7662bbe19bc27171f09138c9d8 |
|
MD5 | 15718871b008f832491e232f18ba223f |
|
BLAKE2b-256 | 4cd5274d48536dd5f03923557aca3809d58cae8bc9203aeb10a8e4dd8cd3a149 |