{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T05:15:00Z","timestamp":1675919700536},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11424-022-0208-7","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T14:03:24Z","timestamp":1655733804000},"page":"1944-1962","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constructing the Basis Path Set by Eliminating the Path Dependency"],"prefix":"10.1007","volume":"35","author":[{"given":"Juanping","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"key":"208_CR1","unstructured":"Wu S, Dimakis A G, and Sanghavi S, Learning distributions generated by one-layer ReLU networks, 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, 2019."},{"key":"208_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2020.01.090","volume":"392","author":"Y Wang","year":"2020","unstructured":"Wang Y, Liu Y T, and Ma Z M, The scale-invariant space for attention layer in neural network, Neurocomputing, 2020, 392: 1\u201310.","journal-title":"Neurocomputing"},{"key":"208_CR3","unstructured":"Neeyshabur B, Salakhutdinov R R, and Srebro N, Path-sgd: Path normalized optimization in deep neural networks, NIPS 15 Proceedings of the 28th International Conference on Neural Information Processing Systems, 2015, 2422\u20132430."},{"key":"208_CR4","doi-asserted-by":"crossref","unstructured":"Zheng S X, Meng Q, Zhang H S, et al., Capacity control of ReLU neural networks by basis-path norm, Thirty-third AAAI Conference on Artificial Intelligence (AAAI2019), 2019.","DOI":"10.1609\/aaai.v33i01.33015925"},{"key":"208_CR5","unstructured":"Meng Q, Zheng S X, Zhang H S, et al., G-SGD: Optimizing ReLU neural networks in its positively scale-invariant space, International Conference of Learning Representations (ICLR2019), 2019."},{"issue":"6088","key":"208_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"D E Rumelhart","year":"1986","unstructured":"Rumelhart D E, Hinton G E, and Williams R J, Learning representations by back-propagating errors, Nature, 1986, 323(6088): 533\u2013536.","journal-title":"Nature"},{"issue":"6","key":"208_CR7","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TRPMS.2021.3066428","volume":"5","author":"F Fan","year":"2021","unstructured":"Fan F, Xiong J, Li M, et al., On interpretability of artificial neural networks: A survey, IEEE Transactions on Radiation and Plasma Medical Sciences, 2021, 5(6): 741\u2013760.","journal-title":"IEEE Transactions on Radiation and Plasma Medical Sciences"},{"key":"208_CR8","unstructured":"Guan C, Wang X, Zhang Q, et al., Towards a deep and unified understanding of deep neural models in NLP, Proceedings of the 36th International Conference on Machine Learning, Long Beach, California, USA, 2019."},{"key":"208_CR9","unstructured":"Hooker S, Erhan D, Kidermans P, et al., A Benchmark for Interpretability Methods in Deep Neural Networks, 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, 2019."},{"key":"208_CR10","doi-asserted-by":"crossref","unstructured":"Inoue K, Expressive numbers of two or more hidden layer ReLU neural networks, 2019 Seventh International Symposium on Computing and Networking workshops (CANDARW 2019), 2019.","DOI":"10.1109\/CANDARW.2019.00031"},{"key":"208_CR11","doi-asserted-by":"crossref","unstructured":"Zhang Q S, Cao R M, Shi F, et al., Interpreting CNN knowledge via an explanatory graph, The Thirty-Second AAAI Conference on Artificial Intelligence, 2018, 4454\u20134463.","DOI":"10.1609\/aaai.v32i1.11819"},{"key":"208_CR12","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2019.05.046","volume":"807","author":"M Wu","year":"2020","unstructured":"Wu M, Wicker M, Ruan W, et al., A game-based approximate verification of deep neural networks with provable guarantees, Theoretical Computer Science, 2020, 807: 298\u2013329.","journal-title":"Theoretical Computer Science"},{"key":"208_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2019.11.012","volume":"808","author":"D Ensign","year":"2020","unstructured":"Ensign D, Neville S, Paul A, et al., The complexity of explaining neural networks through (group) invariants, Theoretical Computer Science, 2020, 808: 74\u201385.","journal-title":"Theoretical Computer Science"},{"key":"208_CR14","doi-asserted-by":"publisher","unstructured":"Xing R T, Xiao M, Zhang Y Z, et al., Stability and Hopf bifurcation analysis of an (n + m)-neuron double-ring neural network model with multiple time delays, Journal of Systems Science & Complexity, 2021, DOI: https:\/\/doi.org\/10.1007\/s11424-021-0108-2.","DOI":"10.1007\/s11424-021-0108-2"},{"issue":"1","key":"208_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11424-020-9009-z","volume":"33","author":"J P Zhu","year":"2020","unstructured":"Zhu J P, Meng Q, Chen W, et al., Interpreting basis path set in neural networks, Journal of Systems Science and Complexity, 2020, 33(1): 1\u201313.","journal-title":"Journal of Systems Science and Complexity"},{"key":"208_CR16","doi-asserted-by":"crossref","unstructured":"Corberan A and Laporte G, Arc Routing Problems, Methods, and Applications, Society for Industrial and Applied Mathematics, 2015.","DOI":"10.1137\/1.9781611973679"},{"key":"208_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J B Jensen","year":"2009","unstructured":"Jensen J B and Gutin G Z, Digraphs: Theory, Algorithms and Applications (Second Edition), Springer, New York, 2009.","edition":"Second Edition"},{"key":"208_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization, Theory and Algorithm","author":"B Korte","year":"2012","unstructured":"Korte B and Vygen J, Combinatorial Optimization, Theory and Algorithm (Fifth Edition), Springer, New York, 2012.","edition":"Fifth Edition"},{"issue":"19","key":"208_CR19","doi-asserted-by":"publisher","first-page":"4479","DOI":"10.1016\/j.disc.2007.08.045","volume":"308","author":"C S Babu","year":"2008","unstructured":"Babu C S and Diwan A A, Subdivisions of graphs: A generalization of paths and cycles, Discrete Mathematics, 2008, 308(19): 4479\u20134486.","journal-title":"Discrete Mathematics"},{"key":"208_CR20","doi-asserted-by":"crossref","unstructured":"Bondy J A and Murty U S R, Graph Theory, Section 10.1, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"5","key":"208_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.7494\/OpMath.2016.36.5.575","volume":"36","author":"M Dettlaff","year":"2016","unstructured":"Dettlaff M, Raczek J, and Yero I G, Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graph, Opuscula Mathematica, 2016, 36(5): 575\u2013588.","journal-title":"Opuscula Mathematica"},{"key":"208_CR22","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.procs.2015.08.169","volume":"60","author":"M Chaieb","year":"2015","unstructured":"Chaieb M, Jemai J, and Mellouli K, A hierarchical decomposition framework for modeling combinatorial optimization problems, Procedia Computer Science, 2015, 60: 478\u2013487.","journal-title":"Procedia Computer Science"},{"issue":"7","key":"208_CR23","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.3390\/s17071665","volume":"17","author":"Y Chang","year":"2017","unstructured":"Chang Y, Tang H, Cheng Y, et al., Dynamic hierarchical energy efficient method based on combinatorial optimization for wireless sensor networks, Sensors, 2017, 17(7): 1665.","journal-title":"Sensors"},{"issue":"18","key":"208_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/ecj.11833","volume":"99","author":"H Ochiai","year":"2016","unstructured":"Ochiai H, Kanazawa T, Tamura K, et al., Combinatorial optimization method based on hierarchical structure in solution space, Electronics and communications in Japan, 2016, 99(18): 25\u201337.","journal-title":"Electronics and communications in Japan"},{"key":"208_CR25","doi-asserted-by":"crossref","unstructured":"Racke H, Optimal hierarchical decompositions for congestion minimization in networks, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008, 255\u2013264.","DOI":"10.1145\/1374376.1374415"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0208-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-022-0208-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-0208-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:04:19Z","timestamp":1675890259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-022-0208-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1007\/s11424-022-0208-7","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"31 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}