The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Higher-Order Web Link Analysis Using Multilinear Algebra
Abstract
Linear algebra is a powerful and proven tool in Web search. Techniques, such as the PageRank algorithm of Brin and Page and the HITS algorithm of Kleinberg, score Web pages based on the principal eigenvector (or singular vector) of a particular non-negative matrix that captures the hyperlink structure of the Web graph. We propose and test a new methodology that uses multilinear algebra to elicit more information from a higher-order representation of the hyperlink graph. We start by labeling the edges in our graph with the anchor text of the hyperlinks so that the associated linear algebra representation is a sparse, three-way tensor. The first two dimensions of the tensor represent the Web pages while the third dimension adds the anchor text. We then use the rank-1 factors of a multilinear PARAFAC tensor decomposition, which are akin to singular vectors of the SVD, to automatically identify topics in the collection along with the associated authoritative Web pages.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Ranking in interconnected multilayer networks reveals versatile nodes
De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., & Arenas, A. (2015) · Nature Communications · doi:10.1038/ncomms7868 · Cited by 459
Incremental tensor analysis: Theory and applications
Sun, J., Tao, D., Papadimitriou, S., Yu, P. S., & Faloutsos, C. (2008) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1409620.1409621 · Cited by 254
Data fusion in cyber-physical-social systems: State-of-the-art and perspectives
Wang, P., Yang, L. T., Li, J., Chen, J., & Hu, S. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.002 · Cited by 127
Metadata
- Authors
- Kolda, T. G., Bader, B. W., & Kenny, J. P.
- Venue
- Fifth IEEE International Conference on Data Mining (ICDM'05)
- Publisher
- IEEE
- Published
- 2006-01-05
- Pages
- 242-249
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2148507357
- Cited by
- 252
- References
- 3
- FWCI
- 5.40
- 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: Higher-Order Web Link Analysis Using Multilinear Algebra. https://app.cochat.ai/papers/10.1109/icdm.2005.77
- The paper
- Kolda, T. G., Bader, B. W., & Kenny, J. P. (2006). Higher-Order Web Link Analysis Using Multilinear Algebra. Fifth IEEE International Conference on Data Mining (ICDM'05). https://doi.org/10.1109/icdm.2005.77
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.
