most citedScalable Co-Clustering for Large-Scale Data through Dynamic Partitioning and Hierarchical Merging

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DS2025

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions

Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase +2

Geometric data structures have been extensively studied in the regime where the dimension is much smaller than the number of input points. But in many scenarios in Machine Learning…

cs.DC2024★ 2 cited

Scalable Co-Clustering for Large-Scale Data through Dynamic Partitioning and Hierarchical Merging

Zihan Wu, Zhaoke Huang, Hong Yan

Co-clustering simultaneously clusters rows and columns, revealing more fine-grained groups. However, existing co-clustering methods suffer from poor scalability and cannot handle l…