Biclustering and Boolean Matrix Factorization in Data Streams

Summary: Streaming bipartite clustering and BMF in data streams: one-pass, sublinear-space recovery of right-side clusters; second pass recovers left clusters. Empirical results: speedups over static baselines; quality within 2x; linear-time scaling; theory under planted models. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12074
Venue: VLDB
Year: 2020
Pagerank: 4.4937074e-05
Overall Rank: 8,535 | 40.63%
DOI: 10.14778/3401960.3401968

Incoming Non-self Citations Over Time

Authors

1. Stefan Neumann
2. Pauli Miettinen

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,331	The Gibbs–Rand Model	2022	PODS	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
402	Mergeable Summaries	2012	PODS	0.00024196343

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,959	Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee	2024	SIGMOD	4.1945683e-05
4,459	Efficient Bi-triangle Counting for Large Bipartite Networks	2021	VLDB	6.1651553e-05
10,300	Scalable Approximate Biclique Counting over Large Bipartite Graphs	2026	VLDB	4.1945683e-05
662	A Framework for Clustering Evolving Data Streams	2003	VLDB	0.00018475968
6,183	Efficient Core Maintenance in Large Bipartite Graphs	2023	SIGMOD	5.1667703e-05
3,492	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs	2022	VLDB	7.044442e-05
10,945	Efficient High-Quality Clustering for Large Bipartite Graphs	2024	SIGMOD	4.1945683e-05
10,189	Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs	2026	SIGMOD	4.1945683e-05
10,522	SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering	2025	SIGMOD	4.1945683e-05
10,373	Density Decomposition of Bipartite Graphs	2025	SIGMOD	4.1945683e-05