Result for 280F58648DF2D5C198E7D9A7F5668D4AAC0CB1EC

Query result

Key Value
FileName./usr/share/doc/libghc-hierarchical-clustering-doc/html/hierarchical-clustering.txt
FileSize14101
MD5AD4C94BF9D20DB65D3E21B529415CDC5
SHA-1280F58648DF2D5C198E7D9A7F5668D4AAC0CB1EC
SHA-256905089502BA048B8DD839C526F89323A7C46C6CE6CEB3B3129032F5240901BE4
SSDEEP384:J369VXtoTDkiCFAqM+4GRY980X/P/VkhzoTDkiCfr:JOVuTDkiCFAqM+4iY980PPaqTDkiCfr
TLSHT10E52973157455371EBDAB3B2795B2FE3DB8780C7A3616E00653D008A5707E2AE1E7B88
hashlookup:parent-total3
hashlookup:trust65

Network graph view

Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
FileSize53864
MD5EF56464B953650604EABF2FE9E5A2FA1
PackageDescriptionfast algorithms for single, average/UPGMA and complete linkage clustering; documentation This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-hierarchical-clustering-doc
PackageSectiondoc
PackageVersion0.4.7-1build1
SHA-17134E384C1A67D2FDF4C69F7699B7E138AB9B89D
SHA-2562B89E3ED24AED76620E7F7F40DC45078B3879D63D45362575E2F6E49FCCA510E
Key Value
FileSize53848
MD586152CA91F0CEA79F054DB16C15478A6
PackageDescriptionfast algorithms for single, average/UPGMA and complete linkage clustering; documentation This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-hierarchical-clustering-doc
PackageSectiondoc
PackageVersion0.4.7-1build2
SHA-1FA11E6B52E59020FE0D33FA86BE803D4E9F7DD81
SHA-25676F7307E4EBA6E9007181817C45084BE973E62AA9B50E19B009588BD9C2CD8C6
Key Value
FileSize64868
MD5899E374D07D996EF0CDAE25D5DB0C93D
PackageDescriptionfast algorithms for single, average/UPGMA and complete linkage clustering; documentation This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-hierarchical-clustering-doc
PackageSectiondoc
PackageVersion0.4.7-1
SHA-10366C0861ADB9BABF030CE13CB9D8D1EC0E27447
SHA-25629EAA3DB62B81B528673A2AB8685C76ED2DFE26398C21DD00C74C13D2E829FE6