{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:08:57Z","timestamp":1742951337346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461393"},{"type":"electronic","value":"9783030461409"}],"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-46140-9_10","type":"book-chapter","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T07:03:10Z","timestamp":1587538990000},"page":"97-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Non-negative Matrix Factorization for Retrieving Genomes Across Metagenomes"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Prost","sequence":"first","affiliation":[]},{"given":"St\u00e9phane","family":"Gazut","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Br\u00fcls","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,23]]},"reference":[{"issue":"11","key":"10_CR1","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006). https:\/\/doi.org\/10.1109\/TSP.2006.881199","journal-title":"IEEE Trans. Signal Process."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1155\/2009\/785152","volume":"2009","author":"AT Cemgil","year":"2009","unstructured":"Cemgil, A.T.: Bayesian inference for non-negative matrix factorisation models. Comput. Intell. Neurosci. 2009, 4:1\u20134:17 (2009). https:\/\/doi.org\/10.1155\/2009\/785152","journal-title":"Comput. Intell. Neurosci."},{"issue":"1","key":"10_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statis. Soc. Ser. B (Methodological) 39(1), 1\u201322 (1977)","journal-title":"J. Roy. Statis. Soc. Ser. B (Methodological)"},{"key":"10_CR4","unstructured":"Duda, R.O.: Pattern recognition for HCI, June 1997. www.cs.princeton.edu\/courses\/archive\/fall08\/cos436\/Duda\/PR_home.htm. Accessed 27 May 2019"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/aris.1440380105","volume":"38","author":"ST Dumais","year":"2004","unstructured":"Dumais, S.T.: Latent semantic analysis. Ann. Rev. Inf. Sci. Technol. 38(1), 188\u2013230 (2004). https:\/\/doi.org\/10.1002\/aris.1440380105. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/aris.1440380105","journal-title":"Ann. Rev. Inf. Sci. Technol."},{"key":"10_CR6","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999, pp. 518\u2013529. Morgan Kaufmann Publishers Inc., San Francisco (1999). http:\/\/dl.acm.org\/citation.cfm?id=645925.671516"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1186\/s12859-016-1186-3","volume":"17","author":"A Gkanogiannis","year":"2016","unstructured":"Gkanogiannis, A., Gazut, S., Salanoubat, M., Kanj, S., Br\u00fcls, T.: A scalable assembly-free variable selection algorithm for biomarker discovery from metagenomes. BMC Bioinform. 17(1), 311 (2016)","journal-title":"BMC Bioinform."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Kyrgyzov, O., Prost, V., Gazut, S., Farcy, B., Br\u00fcls, T.: Binning unassembled short reads based on k-mer abundance covariance using sparse coding. GigaScience 9(4), giaa028 (2020). Accessed https:\/\/doi.org\/10.1093\/gigascience\/giaa028","DOI":"10.1093\/gigascience\/giaa028"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","volume":"2","author":"ES Lander","year":"1988","unstructured":"Lander, E.S., Waterman, M.S.: Genomic mapping by fingerprinting random clones: a mathematical analysis. Genomics 2(3), 231\u2013239 (1988). https:\/\/doi.org\/10.1016\/0888-7543(88)90007-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0888754388900079","journal-title":"Genomics"},{"key":"10_CR10","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Proceedings of the 13th International Conference on Neural Information Processing Systems, NIPS 2000. pp. 535\u2013541. MIT Press, Cambridge (2000). http:\/\/dl.acm.org\/citation.cfm?id=3008751.3008829"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1038\/nbt.3329","volume":"33","author":"B Lowman Cleary","year":"2015","unstructured":"Lowman Cleary, B., et al.: Detection of low-abundance bacterial strains in metagenomic datasets by eigengenome partitioning. Nature Biotechnol. 33, 1053\u20131060 (2015). https:\/\/doi.org\/10.1038\/nbt.3329","journal-title":"Nature Biotechnol."},{"key":"10_CR12","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19\u201360 (2010). http:\/\/dl.acm.org\/citation.cfm?id=1756006.1756008","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.18178\/ijmlc.2016.6.2.583","volume":"6","author":"D Nguyen","year":"2016","unstructured":"Nguyen, D., Ho, T.: Fast parallel randomized algorithm for non-negative matrix factorization with KL divergence for large sparse datasets. Int. J. Mach. Learn. Comput. 6, 111\u2013116 (2016). https:\/\/doi.org\/10.18178\/ijmlc.2016.6.2.583","journal-title":"Int. J. Mach. Learn. Comput."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"DR Zerbino","year":"2008","unstructured":"Zerbino, D.R., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18, 821\u2013829 (2008). https:\/\/doi.org\/10.1101\/gr.074492.107","journal-title":"Genome Res."},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1089\/cmb.2010.0245","volume":"18","author":"YW Wu","year":"2011","unstructured":"Wu, Y.W., Ye, Y.: A novel abundance-based algorithm for binning metagenomic sequences using l-tuples. J. Comput. Biol. 18(3), 523\u201334 (2011)","journal-title":"J. Comput. Biol."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2003, pp. 267\u2013273. ACM, New York (2003). https:\/\/doi.org\/10.1145\/860435.860485. http:\/\/doi.acm.org\/10.1145\/860435.860485","DOI":"10.1145\/860435.860485"}],"container-title":["Communications in Computer and Information Science","Information Management and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46140-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T11:51:54Z","timestamp":1722772314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46140-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461393","9783030461409"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46140-9_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIMBig","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Symposium on Information Management and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","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":"21 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"simbig2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/simbig.org\/SIMBig2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"104","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":"15","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":"16","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":"14% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}