Fifth IEEE International Conference on Data Mining (ICDM'05) (2005)
Nov. 27, 2005 to Nov. 30, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.77
Tamara G. Kolda , Sandia National Laboratories
Brett W. Bader , Sandia National Laboratories
Joseph P. Kenny , Sandia National Laboratories
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.
B. W. Bader, J. P. Kenny and T. G. Kolda, "Higher-Order Web Link Analysis Using Multilinear Algebra," Fifth IEEE International Conference on Data Mining (ICDM'05)(ICDM), Houston, Texas, 2005, pp. 242-249.