{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T06:48:25Z","timestamp":1720507705333},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61379109"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013286","name":"Research Fund for the Doctoral Program of Higher Education of China","doi-asserted-by":"crossref","award":["20120162110077"],"id":[{"id":"10.13039\/501100013286","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Young Scientists Fund of the National Natural Science Foundation of China","award":["61402165"]},{"name":"National Natural Science Foundation of Province Hunan","award":["2015JJ3058"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1016\/j.knosys.2015.07.022","type":"journal-article","created":{"date-parts":[[2015,7,23]],"date-time":"2015-07-23T17:19:20Z","timestamp":1437671960000},"page":"411-419","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["A fast incremental algorithm for deleting objects from a concept lattice"],"prefix":"10.1016","volume":"89","author":[{"given":"Ligeng","family":"Zou","sequence":"first","affiliation":[]},{"given":"Zuping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Long","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2015.07.022_b0005","series-title":"Restructuring lattice theory: an approach based on hierarchies of concepts","author":"Wille","year":"2009"},{"key":"10.1016\/j.knosys.2015.07.022_b0010","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","year":"1999"},{"key":"10.1016\/j.knosys.2015.07.022_b0015","series-title":"Ordered Sets","first-page":"445","article-title":"Restructuring lattice theory: an approach based on hierarchies of concepts","author":"Wille","year":"1982"},{"key":"10.1016\/j.knosys.2015.07.022_b0020","series-title":"Conceptual Structures: From Information to Intelligence","first-page":"139","article-title":"Formal concept analysis in knowledge discovery: a survey","author":"Poelmans","year":"2010"},{"key":"10.1016\/j.knosys.2015.07.022_b0025","doi-asserted-by":"crossref","unstructured":"M. Wermelinger, Y. Yu, M. Strohmaier, Using formal concept analysis to construct and visualise hierarchies of socio-technical relations, in: 31st International Conference on Software Engineering-Companion Volume, 2009 (ICSE-Companion 2009), 2009, pp. 327\u2013330.","DOI":"10.1109\/ICSE-COMPANION.2009.5071013"},{"key":"10.1016\/j.knosys.2015.07.022_b0030","series-title":"Formal Concept Analysis","first-page":"149","article-title":"Linguistic applications of formal concept analysis","author":"Priss","year":"2005"},{"key":"10.1016\/j.knosys.2015.07.022_b0035","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.knosys.2011.09.016","article-title":"Research on domain ontology in different granulations based on concept lattice","volume":"27","author":"Kang","year":"2012","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2015.07.022_b0040","doi-asserted-by":"crossref","unstructured":"I.I. Amin, S.K. Kassim, H.A. Hefny, Using formal concept analysis for mining hyomethylated genes among breast cancer tumors subtypes, in: 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2013, pp. 521\u2013526.","DOI":"10.1109\/ICACCI.2013.6637226"},{"key":"10.1016\/j.knosys.2015.07.022_b0045","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/IDA-2005-9105","article-title":"Constraint-based concept mining and its application to microarray data analysis","volume":"9","author":"Besson","year":"2005","journal-title":"Intell. Data Anal."},{"key":"10.1016\/j.knosys.2015.07.022_b0050","series-title":"Conceptual Structures: Knowledge Visualization and Reasoning","first-page":"255","article-title":"Concept similarity and related categories in SearchSleuth","author":"Dau","year":"2008"},{"key":"10.1016\/j.knosys.2015.07.022_b0055","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.knosys.2011.06.018","article-title":"Semantic Web search based on rough sets and fuzzy formal concept analysis","volume":"26","author":"Formica","year":"2012","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2015.07.022_b0060","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.knosys.2015.07.022_b0065","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":"Inform. Sci."},{"key":"10.1016\/j.knosys.2015.07.022_b0070","unstructured":"S. Andrews, In-close, a fast algorithm for computing formal concepts, in: International Conference on Conceptual Structures (ICCS), 2009."},{"key":"10.1016\/j.knosys.2015.07.022_b0075","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.knosys.2015.07.022_b0080","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.scico.2008.09.015","article-title":"An incremental algorithm to construct a lattice of set intersections","volume":"74","author":"Kourie","year":"2009","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.knosys.2015.07.022_b0085","series-title":"Concept Lattices","first-page":"372","article-title":"AddIntent: a new incremental algorithm for constructing concept lattices","author":"Van Der Merwe","year":"2004"},{"key":"10.1016\/j.knosys.2015.07.022_b0090","series-title":"Concept Data Analysis: Theory and Applications","author":"Carpineto","year":"2004"},{"key":"10.1016\/j.knosys.2015.07.022_b0095","first-page":"3363","article-title":"An incremental algorithm for removing object from concept lattice","volume":"9","author":"Zhang","year":"2013","journal-title":"J. Comput. Inform. Syst."},{"key":"10.1016\/j.knosys.2015.07.022_b0100","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0255(86)90001-0","article-title":"Lattice model of browsable data spaces","volume":"40","author":"Godin","year":"1986","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2015.07.022_b0105","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 (concept) lattices","volume":"11","author":"Godin","year":"1995","journal-title":"Comput. Intell."},{"key":"10.1016\/j.knosys.2015.07.022_b0110","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1016\/j.camwa.2012.03.087","article-title":"Relating attribute reduction in formal, object-oriented and property-oriented concept lattices","volume":"64","author":"Medina","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.knosys.2015.07.022_b0115","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.knosys.2014.08.020","article-title":"Rule-preserved object compression in formal decision contexts using concept lattices","volume":"71","author":"Li","year":"2014","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2015.07.022_b0120","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TSMCC.2008.2012168","article-title":"Formal concept analysis with background knowledge: attribute priorities","volume":"39","author":"Belohlavek","year":"2009","journal-title":"Syst. Man Cybernet. Part C: IEEE Trans. Appl. Rev."},{"key":"10.1016\/j.knosys.2015.07.022_b0125","unstructured":"V. Codocedo, C. Taramasco, H. Astudillo, Cheating to achieve formal concept analysis over a large formal context, in: The Eighth International Conference on Concept Lattices and Their Applications-CLA 2011, 2011, pp. 349\u2013362."},{"key":"10.1016\/j.knosys.2015.07.022_b0130","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.knosys.2014.11.020","article-title":"Approximate concepts acquisition based on formal contexts","volume":"75","author":"Wan","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2015.07.022_b0135","unstructured":"F.J. Van der Merwe, Constructing concept lattices and compressed pseudo-lattices, 2006."},{"key":"10.1016\/j.knosys.2015.07.022_b0140","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.knosys.2015.07.022_b0145","unstructured":"K. Bache, M. Lichman, UCI Machine Learning Repository, 2013. ."},{"key":"10.1016\/j.knosys.2015.07.022_b0150","series-title":"Conceptual Structures: From Information to Intelligence","first-page":"181","article-title":"FcaBedrock, a formal context creator","author":"Andrews","year":"2010"},{"key":"10.1016\/j.knosys.2015.07.022_b0155","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.knosys.2015.07.022_b0160","unstructured":"M.A. Babin, S.O. Kuznetsov, Recognizing Pseudo-intents is coNP-complete, in: CLA, 2010, pp. 294\u2013301."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705115002762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705115002762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T15:11:32Z","timestamp":1589555492000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705115002762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":32,"alternative-id":["S0950705115002762"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2015.07.022","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast incremental algorithm for deleting objects from a concept lattice","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2015.07.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}