# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Partial Least Squares Regression for Graph Mining

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Saigo, H., Krämer, N., & Tsuda, K. (2008). Partial Least Squares Regression for
Graph Mining.* Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and
Data Mining (KDD2008),* 578-586.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-C7BC-7

##### Abstract

Attributed graphs are increasingly more common in many application
domains such as chemistry, biology and text processing.
A central issue in graph mining is how to collect informative subgraph
patterns for a given learning task.
We propose an iterative mining method based on
partial least squares regression (PLS).
To apply PLS to graph data, a sparse version of PLS is developed first
and then it is combined with a weighted pattern mining algorithm.
The mining algorithm is iteratively called with different weight
vectors, creating one latent component per one mining call.
Our method, graph PLS, is efficient and easy to implement, because the
weight vector is updated with elementary matrix calculations.
In experiments, our graph PLS algorithm showed
competitive prediction accuracies in many chemical datasets and its
efficiency was significantly superior to graph boosting (gboost) and the
naive method based on frequent graph mining.