{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:23:40Z","timestamp":1743125020744,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214616"},{"type":"electronic","value":"9783030214623"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-21462-3_12","type":"book-chapter","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:05:15Z","timestamp":1560452715000},"page":"173-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Formal Concepts Using Implications Between Items"],"prefix":"10.1007","author":[{"given":"Aimene","family":"Belfodil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adnene","family":"Belfodil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Kaytoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-319-71246-8_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"A Belfodil","year":"2017","unstructured":"Belfodil, A., Cazalens, S., Lamarre, P., Plantevit, M.: Flash points: discovering exceptional pairwise behaviors in vote or rating data. In: Ceci, M., Hollm\u00e9n, J., Todorovski, L., Vens, C., D\u017eeroski, S. (eds.) ECML PKDD 2017. LNCS (LNAI), vol. 10535, pp. 442\u2013458. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71246-8_27"},{"key":"12_CR3","unstructured":"Belfodil, A., Kuznetsov, S.O., Kaytoue, M.: Pattern setups and their completions. In: CLA, pp. 243\u2013253 (2018)"},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M Boley","year":"2010","unstructured":"Boley, M., Horv\u00e1th, T., Poign\u00e9, A., Wrobel, S.: Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411(3), 691\u2013700 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","first-page":"31","volume":"96","author":"JP Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de galois d\u2019une correspondance. Math\u00e9matiques et Sciences humaines 96, 31\u201347 (1986)","journal-title":"Math\u00e9matiques et Sciences humaines"},{"key":"12_CR6","first-page":"226","volume-title":"Lecture Notes in Computer Science","author":"Peggy Cellier","year":"2008","unstructured":"Cellier, P., Ferr\u00e9, S., Ridoux, O., Ducass\u00e9, M.: An algorithm to find frequent concepts of a formal context with taxonomy. In: CLA, pp. 226\u2013231 (2006)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(89)90180-5","volume":"78","author":"BL Dietrich","year":"1989","unstructured":"Dietrich, B.L.: Matroids and antimatroids-a survey. Discrete Math. 78(3), 223\u2013237 (1989)","journal-title":"Discrete Math."},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"12_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technische Hoschule Darmstadt (1984)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44583-8_10","volume-title":"Conceptual Structures: Broadening the Base","author":"B Ganter","year":"2001","unstructured":"Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS-ConceptStruct 2001. LNCS (LNAI), vol. 2120, pp. 129\u2013142. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44583-8_10"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-1-4684-6381-1_6","volume-title":"Applications of Combinatorics and Graph Theory to the Biological and Social Sciences","author":"B Ganter","year":"1989","unstructured":"Ganter, B., Wille, R.: Conceptual scaling. In: Roberts, F. (ed.) Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, pp. 139\u2013167. Springer, New York (1989). https:\/\/doi.org\/10.1007\/978-1-4684-6381-1_6"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-32262-7_15","volume-title":"Formal Concept Analysis","author":"A G\u00e9ly","year":"2005","unstructured":"G\u00e9ly, A.: A generic algorithm for generating closed sets of a binary relation. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 223\u2013234. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32262-7_15"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. In: IJCAI, pp. 1342\u20131347 (2011)","DOI":"10.1007\/978-3-642-20514-9_12"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-10854-8_22","volume-title":"Fundamentals of Computation Theory","author":"B Korte","year":"1981","unstructured":"Korte, B., Lov\u00e1sz, L.: Mathematical structures underlying greedy algorithms. In: G\u00e9cseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 205\u2013209. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10854-8_22"},{"key":"12_CR16","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Advances in algorithms based on CbO. In: CLA, pp. 325\u2013337 (2010)"},{"issue":"1","key":"12_CR17","first-page":"17","volume":"2","author":"SO Kuznetsov","year":"1993","unstructured":"Kuznetsov, S.O.: A fast algorithm for computing all intersections of objects in a finite semi-lattice. Nauchno-Tekhnicheskaya Informatsiya ser. 2(1), 17\u201320 (1993)","journal-title":"Nauchno-Tekhnicheskaya Informatsiya ser."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"SO Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.O.: Learning of simple conceptual graphs from positive and negative examples. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 384\u2013391. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48247-5_47"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-10646-0_4","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"SO Kuznetsov","year":"2009","unstructured":"Kuznetsov, S.O.: Pattern structures for analyzing complex data. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., \u015al\u0119zak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS (LNAI), vol. 5908, pp. 33\u201344. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10646-0_4"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303. ACM (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"12_CR21","unstructured":"Lumpe, L., Schmidt, S.E.: Pattern structures and their morphisms. In: CLA, vol. 1466, pp. 171\u2013179 (2015)"},{"key":"12_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78901-9","volume-title":"Lattices and Ordered Sets","author":"S Roman","year":"2008","unstructured":"Roman, S.: Lattices and Ordered Sets. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-78901-9"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-06608-0_3","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Soulet","year":"2014","unstructured":"Soulet, A., Rioult, F.: Efficiently depth-first minimal pattern mining. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 28\u201339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06608-0_3"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, vol. 83, pp. 445\u2013470. Springer, Dordrecht (1982). https:\/\/doi.org\/10.1007\/978-94-009-7798-3_15"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21462-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:51Z","timestamp":1710233811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21462-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214616","9783030214623"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21462-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.informatik.fb2.frankfurt-university.de\/~icfca2019\/","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":"36","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":"5","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":"42% - 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","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)"}},{"value":"plus 4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}