SparseHC : a memory-efficient online hierarchical clustering algorithm
Computing a hierarchical clustering of objects from a pairwise distance matrix is an important algorithmic kernel in computational science. Since the storage of this matrix requires quadratic space with respect to the number of objects, the design of memory-efficient approaches is of high importance...
Saved in:
Main Authors: | Nguyen, Thuy-Diem, Schmidt, Bertil, Kwoh, Chee-Keong |
---|---|
其他作者: | School of Computer Engineering |
格式: | Article |
語言: | English |
出版: |
2014
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/104862 http://hdl.handle.net/10220/20325 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Efficient agglomerative hierarchical clustering for biological sequence analysis
由: Nguyen, Thuy Diem
出版: (2015) -
A sparse kernel algorithm for online time series data prediction
由: Fan, Haijin, et al.
出版: (2013) -
IFACEwat: the interfacial water-implemented re-ranking algorithm to improve the discrimination of near native structures for protein rigid docking
由: Su, Chinh Tran-To, et al.
出版: (2016) -
Dictionary training for sparse representation as generalization of K-means clustering
由: Sahoo, Sujit Kumar, et al.
出版: (2013) -
Accelerating sparse matrix operations on FPGAs with on/off-chip memories
由: Li, Shiqing
出版: (2023)