{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T17:03:31Z","timestamp":1726074211362},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_46","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"543-554","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multifrontal Non-negative Matrix Factorization"],"prefix":"10.1007","author":[{"given":"Piyush","family":"Sao","sequence":"first","affiliation":[]},{"given":"Ramakrishnan","family":"Kannan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley, Chichester (2009)"},{"key":"46_CR2","unstructured":"Davis, T.: Multifrontral multithreaded rank-revealing sparse QR factorization. In: Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"key":"46_CR3","volume-title":"Direct Methods for Sparse Matrices","author":"IS Duff","year":"1986","unstructured":"Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Clarendon Press, Oxford (1986)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.parco.2015.03.002","volume":"47","author":"JP Fairbanks","year":"2015","unstructured":"Fairbanks, J.P., Kannan, R., Park, H., Bader, D.A.: Behavioral clusters in dynamic graphs. Parallel Comput. 47, 38\u201350 (2015)","journal-title":"Parallel Comput."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Flatz, M., Kutil, R., Vajter\u0161ic, M.: Parallelization of the hierarchical alternating least squares algorithm for nonnegative matrix factorization. In: 2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI), pp. 1\u20135. IEEE (2018)","DOI":"10.1109\/RTSI.2018.8548361"},{"key":"46_CR6","unstructured":"Flatz, M., Vajter\u0161ic, M.: A parallel algorithm for nonnegative matrix factorization based on Newton iteration. In: Proceedings of the IASTED International Conference Parallel and Distributed Computing and Networks (PDCN 2013), pp. 600\u2013607. ACTA Press (2013)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Nijkamp, E., Haas, P.J., Sismanis, Y.: Large-scale matrix factorization with distributed stochastic gradient descent. In: Proceedings of the KDD, pp. 69\u201377. ACM (2011)","DOI":"10.1145\/2020408.2020426"},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A George","year":"1973","unstructured":"George, A.: Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 10(2), 345\u2013363 (1973)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"46_CR9","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1137\/080720395","volume":"32","author":"L Grigori","year":"2010","unstructured":"Grigori, L., Boman, E.G., Donfack, S., Davis, T.A.: Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization. SIAM J. Sci. Comput. 32(6), 3426\u20133446 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"46_CR10","doi-asserted-by":"publisher","first-page":"2882","DOI":"10.1109\/TSP.2012.2190406","volume":"60","author":"N Guan","year":"2012","unstructured":"Guan, N., Tao, D., Luo, Z., Yuan, B.: NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans. Signal Process. 60(6), 2882\u20132898 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"46_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"MT Heath","year":"1991","unstructured":"Heath, M.T., Ng, E., Peyton, B.W.: Parallel algorithms for sparse linear systems. SIAM Rev. 33(3), 420\u2013460 (1991)","journal-title":"SIAM Rev."},{"key":"46_CR12","unstructured":"Ho, N.-D., Van Dooren, P., Blondel, V.D.: Descent methods for nonnegative matrix factorization. CoRR, abs\/0801.3199 (2008)"},{"issue":"3","key":"46_CR13","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TKDE.2017.2767592","volume":"30","author":"R Kannan","year":"2018","unstructured":"Kannan, R., Ballard, G., Park, H.: MPI-FAUN: an MPI-based framework for alternating-updating nonnegative matrix factorization. IEEE Trans. Knowl. Data Eng. 30(3), 544\u2013558 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"46_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim, J., He, Y., Park, H.: Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J. Global Optim. 58(2), 285\u2013319 (2014)","journal-title":"J. Global Optim."},{"issue":"6","key":"46_CR15","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J Kim","year":"2011","unstructured":"Kim, J., Park, H.: Fast nonnegative matrix factorization: an active-set-like method and comparisons. SIAM J. Sci. Comput. 33(6), 3261\u20133281 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"10","key":"46_CR16","doi-asserted-by":"publisher","first-page":"13198","DOI":"10.1016\/j.eswa.2011.04.133","volume":"38","author":"W Kim","year":"2011","unstructured":"Kim, W., Chen, B., Kim, J., Pan, Y., Park, H.: Sparse nonnegative matrix factorization for protein sequence motif discovery. Expert Syst. Appl. 38(10), 13198\u201313207 (2011)","journal-title":"Expert Syst. Appl."},{"key":"46_CR17","unstructured":"Lee, D.D., Sebastian Seung, H.: Algorithms for non-negative matrix factorization. In: NIPS, vol. 13, pp. 556\u2013562 (2001)"},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.gpb.2013.06.001","volume":"12","author":"R Liao","year":"2014","unstructured":"Liao, R., Zhang, Y., Guan, J., Zhou, S.: CloudNMF: a MapReduce implementation of nonnegative matrix factorization for large-scale biological datasets. Genomics Proteomics Bioinform. 12(1), 48\u201351 (2014)","journal-title":"Genomics Proteomics Bioinform."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Liu, C., Yang, H.C., Fan, J., He, L.-W., Wang, Y.-M.: Distributed nonnegative matrix factorization for web-scale dyadic data analysis on MapReduce. In: Proceedings of the WWW, pp. 681\u2013690. ACM (2010)","DOI":"10.1145\/1772690.1772760"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Sao, P., Li, X.S., Vuduc, R.: A communication-avoiding 3D LU factorization algorithm for sparse matrices. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, May 2018","DOI":"10.1109\/IPDPS.2018.00100"},{"key":"46_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-09873-9_41","volume-title":"Euro-Par 2014 Parallel Processing","author":"P Sao","year":"2014","unstructured":"Sao, P., Vuduc, R., Li, X.S.: A distributed CPU-GPU sparse direct solver. In: Silva, F., Dutra, I., Santos Costa, V. (eds.) Euro-Par 2014. LNCS, vol. 8632, pp. 487\u2013498. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09873-9_41"},{"key":"46_CR22","doi-asserted-by":"crossref","unstructured":"Sun, D.L., F\u00e9votte, C.: Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence. In: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6201\u20136205, May 2014","DOI":"10.1109\/ICASSP.2014.6854796"},{"key":"46_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-44845-8_22","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"J Yin","year":"2014","unstructured":"Yin, J., Gao, L., Zhang, Z.M.: Scalable nonnegative matrix factorization with block-wise updates. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8726, pp. 337\u2013352. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44845-8_22"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:10:39Z","timestamp":1584576639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}