The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Clustering with Multiple Graphs
Abstract
In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real-world applications, however, entities are often associated with relations of different types and/or from different sources, which can be well captured by multiple undirected graphs over the same set of vertices. How to exploit such multiple sources of information to make better inferences on entities remains an interesting open problem. In this paper, we focus on the problem of clustering the vertices based on multiple graphs in both unsupervised and semi-supervised settings. As one of our contributions, we propose Linked Matrix Factorization (LMF) as a novel way of fusing information from multiple graph sources. In LMF, each graph is approximated by matrix factorization with a graph-specific factor and a factor common to all graphs, where the common factor provides features for all vertices. Experiments on SIAM journal data show that (1) we can improve the clustering accuracy through fusing multiple sources of information with several models, and (2) LMF yields superior or competitive results compared to other graph-based clustering methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Distance Metric Learning with Application to Clustering with Side-Information
Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2002) · Cited by 2,700
Information-theoretic metric learning
Davis, J. V., Kulis, B., Jain, P., Sra, S., & Dhillon, I. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273523 · Cited by 2,006
Self-citationRelational learning via collective matrix factorization
Singh, A. P., & Gordon, G. J. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401969 · Cited by 1,204
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Cited by
Generalized Latent Multi-View Subspace Clustering
Zhang, C., Fu, H., Hu, Q., Cao, X., Xie, Y., Tao, D., & Xu, D. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2877660 · Cited by 739
Biesbroek, G., Tsivtsivadze, E., Sanders, E. A. M., Montijn, R., Veenhoven, R. H., Keijser, B. J. F., & Bogaert, D. (2014) · American Journal of Respiratory and Critical Care Medicine · doi:10.1164/rccm.201407-1240oc · Cited by 572
Low-Rank Tensor Constrained Multiview Subspace Clustering
Zhang, C., Fu, H., Liu, S., Liu, G., & Cao, X. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.185 · Cited by 566
Self-weighted Multiview Clustering with Multiple Graphs
Nie, F., Li, J., & Li, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/357 · Cited by 562
On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization
Xie, Y., Tao, D., Zhang, W., Liu, Y., Zhang, L., & Qu, Y. (2018) · International Journal of Computer Vision · doi:10.1007/s11263-018-1086-2 · Cited by 506
Metadata
- Authors
- Tang, W., Lu, Z., & Dhillon, I. S.
- Venue
- 2009 Ninth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 1016-1021
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2113573459
- Cited by
- 316
- References
- 17
- FWCI
- 8.70
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Clustering with Multiple Graphs. https://app.cochat.ai/papers/10.1109/icdm.2009.125
- The paper
- Tang, W., Lu, Z., & Dhillon, I. S. (2009). Clustering with Multiple Graphs. 2009 Ninth IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2009.125
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.