{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:20:46Z","timestamp":1774941646117,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"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":[[2007,6,20]]},"DOI":"10.1145\/1273496.1273545","type":"proceedings-article","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T13:06:52Z","timestamp":1223384812000},"page":"385-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Constructing basis functions from directed graphs for value function approximation"],"prefix":"10.1145","author":[{"given":"Jeff","family":"Johns","sequence":"first","affiliation":[{"name":"Univ. of Massachusetts Amherst, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sridhar","family":"Mahadevan","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2004.09.003"},{"key":"e_1_3_2_1_2_1","volume-title":"Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics","author":"Chung F.","year":"1997","unstructured":"Chung , F. ( 1997 ). Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics . Providence, RI : American Mathematical Society . Chung, F. (1997). Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics. Providence, RI: American Mathematical Society."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-005-0237-z"},{"key":"e_1_3_2_1_4_1","volume-title":"Matrix Computations","author":"Golub G.","year":"1996","unstructured":"Golub , G. , & Van Loan , C. ( 1996 ). Matrix Computations . Baltimore, MD : Johns Hopkins Univ. Press . 3 rd edition. Golub, G., & Van Loan, C. (1996). Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press. 3rd edition.","edition":"3"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 22nd National Conference on Artificial Intelligence.","author":"Johns J.","year":"2007","unstructured":"Johns , J. , Mahadevan , S. , & Wang , C. ( 2007 ). Compact spectral bases for value function approximation using Kronecker factorization . Proceedings of the 22nd National Conference on Artificial Intelligence. Johns, J., Mahadevan, S., & Wang, C. (2007). Compact spectral bases for value function approximation using Kronecker factorization. Proceedings of the 22nd National Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143901"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964290"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (pp. 372--379)","author":"Mahadevan S.","year":"2005","unstructured":"Mahadevan , S. ( 2005 ). Representation policy iteration . Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (pp. 372--379) . Mahadevan, S. (2005). Representation policy iteration. Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (pp. 372--379)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1597348.1597378"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-5732-z"},{"key":"e_1_3_2_1_11_1","volume-title":"echnical Report)","author":"Page L.","year":"1998","unstructured":"Page , L. , Brin , S. , Motwani , R. , & Winograd , T. ( 1998 ). The PageRank citation ranking: Bringing order to the web ( T echnical Report) . Stanford Digital Library Technologies Project . Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranking: Bringing order to the web (Technical Report). Stanford Digital Library Technologies Project."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp. 2574--2579)","author":"Petrik M.","year":"2007","unstructured":"Petrik , M. ( 2007 ). An analysis of Laplacian methods for value function approximation in MDPs . Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp. 2574--2579) . Petrik, M. (2007). An analysis of Laplacian methods for value function approximation in MDPs. Proceedings of the 20th International Joint Conference on Artificial Intelligence (pp. 2574--2579)."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 8th International Symposium on AI and Mathematics.","author":"Smart W.","year":"2004","unstructured":"Smart , W. ( 2004 ). Explicit manifold representations for value-function approximation in reinforcement learning . Proceedings of the 8th International Symposium on AI and Mathematics. Smart, W. (2004). Explicit manifold representations for value-function approximation in reinforcement learning. Proceedings of the 8th International Symposium on AI and Mathematics."},{"key":"e_1_3_2_1_14_1","volume-title":"Reinforcement learning","author":"Sutton R.","year":"1998","unstructured":"Sutton , R. , & Barto , A. ( 1998 ). Reinforcement learning . Cambridge, MA : MIT Press . Sutton, R., & Barto, A. (1998). Reinforcement learning. Cambridge, MA: MIT Press."},{"key":"e_1_3_2_1_15_1","volume-title":"Using the Nyströ\u00f6m method to speed up kernel machines. Advances in Neural Information Processing Systems 13 (pp. 682--688)","author":"Williams C.","year":"2001","unstructured":"Williams , C. , & Seeger , M. ( 2001 ). Using the Nyströ\u00f6m method to speed up kernel machines. Advances in Neural Information Processing Systems 13 (pp. 682--688) . Williams, C., & Seeger, M. (2001). Using the Nyströ\u00f6m method to speed up kernel machines. Advances in Neural Information Processing Systems 13 (pp. 682--688)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102482"}],"event":{"name":"ICML '07 & ILP '07: The 24th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Corvalis Oregon USA","acronym":"ICML '07 & ILP '07","sponsor":["Machine Learning Journal"]},"container-title":["Proceedings of the 24th international conference on Machine learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273496.1273545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:01Z","timestamp":1750258681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273496.1273545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":16,"alternative-id":["10.1145\/1273496.1273545","10.1145\/1273496"],"URL":"https:\/\/doi.org\/10.1145\/1273496.1273545","relation":{},"subject":[],"published":{"date-parts":[[2007,6,20]]},"assertion":[{"value":"2007-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}