{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:51:07Z","timestamp":1773273067701,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401961","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"578-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Partial least squares regression for graph mining"],"prefix":"10.1145","author":[{"given":"Hiroto","family":"Saigo","sequence":"first","affiliation":[{"name":"Max Planck Institute for Biological Cybernetics, Tuebingen, Germany"}]},{"given":"Nicole","family":"Kr\u00e4mer","sequence":"additional","affiliation":[{"name":"Technical University Berlin, Berlin, Germany"}]},{"given":"Koji","family":"Tsuda","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Biological Cybernetics, Tuebingen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2089856.2089868"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti683"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012470815092"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(03)00138-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/qsar.200510135"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci034254q"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1180020306"},{"key":"e_1_3_2_1_9_1","first-page":"415","volume-title":"Proceedings of the 4th IEEE Internatinal Conference on Data Mining","author":"Inokuchi A.","year":"2005","unstructured":"A. Inokuchi . Mining generalized substructures from a set of labeled graphs . In Proceedings of the 4th IEEE Internatinal Conference on Data Mining , pages 415 -- 418 . IEEE Computer Society , 2005 . A. Inokuchi. Mining generalized substructures from a set of labeled graphs. In Proceedings of the 4th IEEE Internatinal Conference on Data Mining, pages 415--418. IEEE Computer Society, 2005."},{"key":"e_1_3_2_1_10_1","first-page":"321","volume-title":"Proceedings of the 21st International Conference on Machine Learning","author":"Kashima H.","year":"2003","unstructured":"H. Kashima , K. Tsuda , and A. Inokuchi . Marginalized kernels between labeled graphs . In Proceedings of the 21st International Conference on Machine Learning , pages 321 -- 328 . AAAI Press , 2003 . H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proceedings of the 21st International Conference on Machine Learning, pages 321--328. AAAI Press, 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci0503715"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00043-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273552"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502533"},{"key":"e_1_3_2_1_15_1","first-page":"729","volume-title":"Advances in Neural Information Processing Systems 17","author":"Kudo T.","year":"2005","unstructured":"T. Kudo , E. Maeda , and Y. Matsumoto . An application of boosting to graph classification . In Advances in Neural Information Processing Systems 17 , pages 729 -- 736 . MIT Press , 2005 . T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In Advances in Neural Information Processing Systems 17, pages 729--736. MIT Press, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci060138m"},{"key":"e_1_3_2_1_17_1","volume-title":"Constructing orthogonal latent features for arbitrary loss. Feature Extraction, Foundations and Applications","author":"Momma M.","year":"2006","unstructured":"M. Momma and K. Bennett . Constructing orthogonal latent features for arbitrary loss. Feature Extraction, Foundations and Applications . Springer , 2006 . M. Momma and K. Bennett. Constructing orthogonal latent features for arbitrary loss. Feature Extraction, Foundations and Applications. Springer, 2006."},{"key":"e_1_3_2_1_18_1","first-page":"471","volume-title":"Discovery Science","author":"Morishita S.","year":"2001","unstructured":"S. Morishita . Computing optimal hypotheses efficiently for boosting . In Discovery Science , pages 471 -- 481 . Springer , 2001 . S. Morishita. Computing optimal hypotheses efficiently for boosting. In Discovery Science, pages 471--481. Springer, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335226"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4409049"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383171"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013907905629"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11752790_2"},{"key":"e_1_3_2_1_26_1","first-page":"85","volume-title":"International Workshop on Mining and Learning with Graphs (MLG)","author":"Saigo H.","year":"2006","unstructured":"H. Saigo , T. Kadowaki , and K. Tsuda . A linear programming approach for molecular QSAR analysis . In International Workshop on Mining and Learning with Graphs (MLG) , pages 85 -- 96 , 2006 . H. Saigo, T. Kadowaki, and K. Tsuda. A linear programming approach for molecular QSAR analysis. In International Workshop on Mining and Learning with Graphs (MLG), pages 85--96, 2006."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm353"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273612"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143964"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143970"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-103950-9.50017-4"},{"key":"e_1_3_2_1_34_1","volume-title":"PLS-regression: a basic tool of chemometrics. Chemometrics and intelligent laboratory systems, 58:109--130","author":"Wold S.","year":"2001","unstructured":"S. Wold , M. Sj\u00f6st\u00f6m , and L. Erikkson . PLS-regression: a basic tool of chemometrics. Chemometrics and intelligent laboratory systems, 58:109--130 , 2001 . S. Wold, M. Sj\u00f6st\u00f6m, and L. Erikkson. PLS-regression: a basic tool of chemometrics. Chemometrics and intelligent laboratory systems, 58:109--130, 2001."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_36_1","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gSpan: graph-based substructure pattern mining . In Proceedings of the 2002 IEEE International Conference on Data Mining , pages 721 -- 724 . IEEE Computer Society , 2002 . X. Yan and J. Han. gSpan: graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, pages 721--724. IEEE Computer Society, 2002."}],"event":{"name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Las Vegas Nevada USA","acronym":"KDD08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:41Z","timestamp":1750255001000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":36,"alternative-id":["10.1145\/1401890.1401961","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401961","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}