A4 Article in conference proceedings
Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time (2015)
Cochez, M., & Mou, H. (2015). Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time. In T. Sellis, S. B. Davidson, & Z. Ives (Eds.), SIGMOD '15 : Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (pp. 505-517). Association for Computing Machinery. https://doi.org/10.1145/2723372.2751521
JYU authors or editors
Publication details
All authors or editors: Cochez, Michael; Mou, Hao
Parent publication: SIGMOD '15 : Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data
Parent publication editors: Sellis, Timos; Davidson, Susan B.; Ives, Zack
Conference:
- ACM-SIGMOD International Conference on Management of Data
ISBN: 978-1-4503-2758-9
Publication year: 2015
Pages range: 505-517
Number of pages in the book: 2084
Publisher: Association for Computing Machinery
Place of Publication: New York
Publication country: United States
Publication language: English
DOI: https://doi.org/10.1145/2723372.2751521
Publication open access: Not open
Publication channel open access:
Publication is parallel published (JYX): https://jyx.jyu.fi/handle/123456789/46537
Additional information: SIGMOD/PODS'15 International Conference on Management of Data. Melbourne, VIC, Australia — May 31 - June 04, 2015.
Free keywords: hierarchical clustering; locality-sensitive hashing; average linkage; linear complexity
Contributing organizations
Ministry reporting: Yes
Reporting Year: 2015
JUFO rating: 2
