Iterative subgraph mining for principal component analysis

Hiroto Saigo, Koji Tsuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Graph mining methods enumerate frequent subgraphs efficiently, but, it is often problematic to summarize the large number of obtained patterns. Thus it makes sense to combine frequent graph mining with principal component analysis to reduce dimensionality and collect a smaller number of characteristic patterns. We present a novel iterative mining algorithm that captures informative patterns corresponding to major entries of top principal components. It repeatedly calls weighted substructure mining where example weights are updated in each iteration. The Lanczos algorithm, a standard algorithm of eigendecomposition, is employed to update the weights. In experiments, our patterns are shown to approximate the principal components obtained by frequent mining.

Original languageEnglish
Title of host publicationProceedings - 8th IEEE International Conference on Data Mining, ICDM 2008
Pages1007-1012
Number of pages6
DOIs
Publication statusPublished - Dec 1 2008
Event8th IEEE International Conference on Data Mining, ICDM 2008 - Pisa, Italy
Duration: Dec 15 2008Dec 19 2008

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Other

Other8th IEEE International Conference on Data Mining, ICDM 2008
CountryItaly
CityPisa
Period12/15/0812/19/08

Fingerprint

Principal component analysis
Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Saigo, H., & Tsuda, K. (2008). Iterative subgraph mining for principal component analysis. In Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008 (pp. 1007-1012). [4781216] (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDM.2008.62

Iterative subgraph mining for principal component analysis. / Saigo, Hiroto; Tsuda, Koji.

Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008. 2008. p. 1007-1012 4781216 (Proceedings - IEEE International Conference on Data Mining, ICDM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saigo, H & Tsuda, K 2008, Iterative subgraph mining for principal component analysis. in Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008., 4781216, Proceedings - IEEE International Conference on Data Mining, ICDM, pp. 1007-1012, 8th IEEE International Conference on Data Mining, ICDM 2008, Pisa, Italy, 12/15/08. https://doi.org/10.1109/ICDM.2008.62
Saigo H, Tsuda K. Iterative subgraph mining for principal component analysis. In Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008. 2008. p. 1007-1012. 4781216. (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDM.2008.62
Saigo, Hiroto ; Tsuda, Koji. / Iterative subgraph mining for principal component analysis. Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008. 2008. pp. 1007-1012 (Proceedings - IEEE International Conference on Data Mining, ICDM).
@inproceedings{7f245f84ba4444ef9f07b5425f2341e1,
title = "Iterative subgraph mining for principal component analysis",
abstract = "Graph mining methods enumerate frequent subgraphs efficiently, but, it is often problematic to summarize the large number of obtained patterns. Thus it makes sense to combine frequent graph mining with principal component analysis to reduce dimensionality and collect a smaller number of characteristic patterns. We present a novel iterative mining algorithm that captures informative patterns corresponding to major entries of top principal components. It repeatedly calls weighted substructure mining where example weights are updated in each iteration. The Lanczos algorithm, a standard algorithm of eigendecomposition, is employed to update the weights. In experiments, our patterns are shown to approximate the principal components obtained by frequent mining.",
author = "Hiroto Saigo and Koji Tsuda",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ICDM.2008.62",
language = "English",
isbn = "9780769535029",
series = "Proceedings - IEEE International Conference on Data Mining, ICDM",
pages = "1007--1012",
booktitle = "Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008",

}

TY - GEN

T1 - Iterative subgraph mining for principal component analysis

AU - Saigo, Hiroto

AU - Tsuda, Koji

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Graph mining methods enumerate frequent subgraphs efficiently, but, it is often problematic to summarize the large number of obtained patterns. Thus it makes sense to combine frequent graph mining with principal component analysis to reduce dimensionality and collect a smaller number of characteristic patterns. We present a novel iterative mining algorithm that captures informative patterns corresponding to major entries of top principal components. It repeatedly calls weighted substructure mining where example weights are updated in each iteration. The Lanczos algorithm, a standard algorithm of eigendecomposition, is employed to update the weights. In experiments, our patterns are shown to approximate the principal components obtained by frequent mining.

AB - Graph mining methods enumerate frequent subgraphs efficiently, but, it is often problematic to summarize the large number of obtained patterns. Thus it makes sense to combine frequent graph mining with principal component analysis to reduce dimensionality and collect a smaller number of characteristic patterns. We present a novel iterative mining algorithm that captures informative patterns corresponding to major entries of top principal components. It repeatedly calls weighted substructure mining where example weights are updated in each iteration. The Lanczos algorithm, a standard algorithm of eigendecomposition, is employed to update the weights. In experiments, our patterns are shown to approximate the principal components obtained by frequent mining.

UR - http://www.scopus.com/inward/record.url?scp=67049096644&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67049096644&partnerID=8YFLogxK

U2 - 10.1109/ICDM.2008.62

DO - 10.1109/ICDM.2008.62

M3 - Conference contribution

AN - SCOPUS:67049096644

SN - 9780769535029

T3 - Proceedings - IEEE International Conference on Data Mining, ICDM

SP - 1007

EP - 1012

BT - Proceedings - 8th IEEE International Conference on Data Mining, ICDM 2008

ER -