triCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data
Summary: triCluster mines 3D gene-expression triclusters in microarrays with a graph-based approach, supporting positions, overlaps, and patterns. It uses time-slice range multigraphs to extract biclusters via constrained cliques, then links slices to form triclusters. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lizhuang Zhao (Rensselaer Polytechnic Institute)
- 2. Mohammed J. Zaki (Rensselaer Polytechnic Institute)
BibTeX Citation
@inproceedings{zhao_sigmod05,
title = {{triCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data}},
author = {Zhao, Lizhuang and Zaki, Mohammed J.},
series = {{SIGMOD} '05},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1066157.1066236},
url = {https://dl.acm.org/doi/10.1145/1066157.1066236},
year = {2005}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,203 | A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks | 2009 | VLDB | 6.3192921e-05 |
| 11,341 | TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges | 2024 | VLDB | 5.093636e-05 |
| 12,715 | Mining Frequent Closed Cubes in 3D Datasets | 2006 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 304 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD | 0.00021917388 |
| 1,646 | Fast Algorithms for Projected Clustering | 1999 | SIGMOD | 0.00010128564 |
| 1,833 | Finding Generalized Projected Clusters in High Dimensional Spaces | 2000 | SIGMOD | 9.6566846e-05 |
| 3,550 | A Monte Carlo Algorithm for Fast Projective Clustering | 2002 | SIGMOD | 7.3200789e-05 |
| 4,812 | Clustering by Pattern Similarity in Large Data Sets | 2002 | SIGMOD | 6.4980201e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,219 | Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time | 2015 | SIGMOD |
| 2 | 10,877 | Efficient and Adaptive Estimation of Local Triadic Coefficients | 2025 | VLDB |
| 3 | 9,402 | Approximation Algorithms for Co-Clustering | 2008 | PODS |
| 4 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 5 | 12,238 | Interactive Data Mining with 3D-Parallel-Coordinate-Trees | 2013 | SIGMOD |
| 6 | 12,729 | Mining Top-k Covering Rule Groups for Gene Expression Data | 2005 | SIGMOD |
| 7 | 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB |
| 8 | 13,898 | GPX: Interactive Mining of Gene Expression Data | 2004 | VLDB |
| 9 | 304 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD |
| 10 | 4,812 | Clustering by Pattern Similarity in Large Data Sets | 2002 | SIGMOD |