乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:12:57Z","timestamp":1726485177755},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473259","61976089"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of\u00a0Hunan Province","doi-asserted-by":"publisher","award":["2021JJ30451","2021JJ40361"],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019081","name":"Science and Technology Program of Hunan Province","doi-asserted-by":"publisher","award":["2018RS3065","2018TP1018"],"id":[{"id":"10.13039\/501100019081","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1016\/j.ins.2021.12.008","type":"journal-article","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T10:45:53Z","timestamp":1638960353000},"page":"514-524","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["A new parallel algorithm for computing formal concepts based on two parallel stages"],"prefix":"10.1016","volume":"586","author":[{"given":"Ligeng","family":"Zou","sequence":"first","affiliation":[]},{"given":"Tingting","family":"He","sequence":"additional","affiliation":[]},{"given":"Jianhua","family":"Dai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1999","series-title":"Formal Concept Analysis","key":"10.1016\/j.ins.2021.12.008_b0005"},{"key":"10.1016\/j.ins.2021.12.008_b0010","series-title":"Ordered Sets","first-page":"445","article-title":"Restructuring lattice theory: an approach based on hierarchies of concepts","author":"Wille","year":"1982"},{"issue":"16","key":"10.1016\/j.ins.2021.12.008_b0015","doi-asserted-by":"crossref","first-page":"6538","DOI":"10.1016\/j.eswa.2013.05.009","article-title":"Formal concept analysis in knowledge processing: a survey on applications","volume":"40","author":"Poelmans","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2021.12.008_b0020","series-title":"2016 IEEE International Conference on Fuzzy Systems","first-page":"209","article-title":"Unifying fuzzy concept lattice construction methods","author":"Boffa","year":"2016"},{"key":"10.1016\/j.ins.2021.12.008_b0025","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.ijar.2012.07.005","article-title":"Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction","volume":"54","author":"Li","year":"2013","journal-title":"Int. J. Approximate Reason."},{"key":"10.1016\/j.ins.2021.12.008_b0030","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.knosys.2015.10.010","article-title":"Approximate concept construction with three-way decisions and attribute reduction in incomplete contexts","volume":"91","author":"Li","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"10.1016\/j.ins.2021.12.008_b0035","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s13042-016-0576-1","article-title":"Concept acquisition approach of object-oriented concept lattices","volume":"8","author":"Ma","year":"2017","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.ins.2021.12.008_b0040","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.knosys.2016.10.033","article-title":"Constructing three-way concept lattices based on apposition and subposition of formal contexts","volume":"116","author":"Qian","year":"2017","journal-title":"Knowl.-Based Syst."},{"year":"2005","series-title":"Formal Concept Analysis: Foundations and Applications","key":"10.1016\/j.ins.2021.12.008_b0045"},{"key":"10.1016\/j.ins.2021.12.008_b0050","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1013970520933","article-title":"On computing the size of a lattice and related decision problems","volume":"18","author":"Kuznetsov","year":"2001","journal-title":"Order."},{"key":"10.1016\/j.ins.2021.12.008_b0055","first-page":"37","article-title":"Interpretation on graphs and complexity characteristics of a search for specific patterns","volume":"24","author":"Kuznetsov","year":"1989","journal-title":"Autom. Doc. Math. Ling."},{"key":"10.1016\/j.ins.2021.12.008_b0060","series-title":"International Conference on Formal Concept Analysis","first-page":"312","article-title":"Two basic algorithms in concept analysis","author":"Ganter","year":"2010"},{"key":"10.1016\/j.ins.2021.12.008_b0065","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","article-title":"Incremental concept formation algorithms based on Galois lattices","volume":"11","author":"Godin","year":"1995","journal-title":"Comput. Intell."},{"issue":"1","key":"10.1016\/j.ins.2021.12.008_b0070","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s13042-016-0587-y","article-title":"Constructing lattice based on irreducible concepts","volume":"8","author":"Li","year":"2017","journal-title":"Int. J. Mach. Learn. Cybern."},{"issue":"5-6","key":"10.1016\/j.ins.2021.12.008_b0075","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","article-title":"A fast algorithm for building lattices","volume":"71","author":"Nourine","year":"1999","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2021.12.008_b0080","series-title":"Concept Lattices","first-page":"372","article-title":"AddIntent: a new incremental algorithm for constructing concept lattices","author":"Van der Merwe","year":"2004"},{"issue":"9","key":"10.1016\/j.ins.2021.12.008_b0085","doi-asserted-by":"crossref","first-page":"4474","DOI":"10.1016\/j.eswa.2015.01.044","article-title":"A fast incremental algorithm for constructing concept lattices","volume":"42","author":"Zou","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2021.12.008_b0090","series-title":"Learning of Simple Conceptual Graphs from Positive and Negative Examples","first-page":"384","author":"Kuznetsov","year":"1999"},{"key":"10.1016\/j.ins.2021.12.008_b0095","first-page":"11","article-title":"A fast algorithm for computing all intersections of objects in a finite semi-lattice","volume":"27","author":"Kuznetsov","year":"1993","journal-title":"Autom. Document. Mathem. Linguistics"},{"key":"10.1016\/j.ins.2021.12.008_b0100","series-title":"Conceptual Structures for Discovering Knowledge","first-page":"50","article-title":"In-close2, a high performance formal concept miner","author":"Andrews","year":"2011"},{"key":"10.1016\/j.ins.2021.12.008_b0105","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.ins.2014.10.011","article-title":"A \u2018Best-of-Breed\u2019 approach for designing a fast algorithm for computing fixpoints of Galois Connections","volume":"295","author":"Andrews","year":"2015","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2021.12.008_b0110","series-title":"International Conference on Formal Concept Analysis","first-page":"56","article-title":"Making use of empty intersections to improve the performance of CbO-type algorithms","author":"Andrews","year":"2017"},{"issue":"1","key":"10.1016\/j.ins.2021.12.008_b0115","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","article-title":"Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data","volume":"185","author":"Outrata","year":"2012","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2021.12.008_b0120","series-title":"CLA 2018: The 14th International Conference on Concept Lattices and Their Applications, Proceedings","first-page":"255","article-title":"A new method for inheriting canonicity test failures in Close-by-One type algorithms","author":"Andrews","year":"2018"},{"issue":"672","key":"10.1016\/j.ins.2021.12.008_b0125","first-page":"325","article-title":"Advances in algorithms based on CbO","volume":"2010","author":"Krajca","year":"2010","journal-title":"Proc. CLA"},{"issue":"2-3","key":"10.1016\/j.ins.2021.12.008_b0130","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","article-title":"Comparing performance of algorithms for generating concept lattices","volume":"14","author":"Kuznetsov","year":"2002","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"10.1016\/j.ins.2021.12.008_b0135","series-title":"The 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists","first-page":"417","article-title":"Comparing and analyzing the computational complexity of FCA algorithms","author":"Strok","year":"2010"},{"issue":"2","key":"10.1016\/j.ins.2021.12.008_b0140","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1007\/BF02362847","article-title":"Kuznetsov, mathematical aspects of concept analysis","volume":"80","author":"Kuznetsov","year":"1996","journal-title":"J. Mathem. Sci."},{"issue":"1","key":"10.1016\/j.ins.2021.12.008_b0145","first-page":"1","article-title":"Comparision between features of CbO based algorithms for generating formal concepts","volume":"4","author":"Kodagoda","year":"2016","journal-title":"Int. J. Conceptual Struct. Smart Appl."},{"issue":"2","key":"10.1016\/j.ins.2021.12.008_b0150","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","article-title":"Parallel algorithm for computing fixpoints of Galois connections","volume":"59","author":"Krajca","year":"2010","journal-title":"Ann. Mathem. Artificial Intelligence"},{"key":"10.1016\/j.ins.2021.12.008_b0155","series-title":"National Conference on Technology and Management (NCTM)","first-page":"1","article-title":"A parallel version of the in-close algorithm","author":"Kodagoda","year":"2017"},{"key":"10.1016\/j.ins.2021.12.008_b0160","series-title":"Proceedings of the Sixth International Conference on Concept Lattices and Their Applications","first-page":"71","article-title":"Parallel recursive algorithm for FCA, in","author":"Krajca","year":"2008"},{"key":"10.1016\/j.ins.2021.12.008_b0165","series-title":"Advances in Intelligent Data Analysis VIII","first-page":"333","article-title":"Distributed algorithm for computing formal concepts using map-reduce framework","author":"Krajca","year":"2009"},{"key":"10.1016\/j.ins.2021.12.008_b0170","series-title":"Formal Concept Analysis","first-page":"292","article-title":"Distributed formal concept analysis algorithms based on an iterative MapReduce framework","author":"Xu","year":"2012"},{"year":"2017","series-title":"UCI Machine Learning Repository","author":"Dua","key":"10.1016\/j.ins.2021.12.008_b0175"},{"key":"10.1016\/j.ins.2021.12.008_b0180","series-title":"Conceptual Structures: From Information to Intelligence","first-page":"181","article-title":"FcaBedrock, a formal context creator","author":"Andrews","year":"2010"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025521012299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025521012299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T10:47:36Z","timestamp":1671878856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025521012299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":36,"alternative-id":["S0020025521012299"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2021.12.008","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2022,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new parallel algorithm for computing formal concepts based on two parallel stages","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2021.12.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}