{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:34:27Z","timestamp":1743111267953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592701"},{"type":"electronic","value":"9783319592718"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-59271-8_5","type":"book-chapter","created":{"date-parts":[[2017,5,18]],"date-time":"2017-05-18T15:59:07Z","timestamp":1495123147000},"page":"72-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Usability of Probably Approximately Correct Implication Bases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0083-5986","authenticated-orcid":false,"given":"Daniel","family":"Borchmann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-6374","authenticated-orcid":false,"given":"Tom","family":"Hanika","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1497-4001","authenticated-orcid":false,"given":"Sergei","family":"Obiedkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2015.11.031","volume":"658","author":"K Adaricheva","year":"2017","unstructured":"Adaricheva, K., Nation, J.B.: Discovery of the D-basis in binary tables based on hypergraph dualization. Theoret. Comput. Sci. 658, 307\u2013315 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"issue":"4","key":"5_CR3","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"5_CR4","first-page":"147","volume":"9","author":"D Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Mach. Learn. 9(2\u20133), 147\u2013164 (1992)","journal-title":"Mach. Learn."},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10994-011-5248-5","volume":"85","author":"M Arias","year":"2011","unstructured":"Arias, M., Balc\u00e1zar, J.L.: Construction and learnability of canonical Horn formulas. Mach. Learn. 85(3), 273\u2013297 (2011)","journal-title":"Mach. Learn."},{"key":"5_CR6","unstructured":"Babin, M.A.: Models, methods, and programs for generating relationships from a lattice of closed sets. Ph.D. thesis. Higher School of Economics, Moscow (2012)"},{"key":"5_CR7","unstructured":"Borchmann, D.: Learning terminological knowledge with high confidence from erroneous data. Ph.D. thesis, Technische Universit\u00e4t Dresden, Dresden (2014)"},{"key":"5_CR8","unstructured":"Borchmann, D., Hanika, T.: Some experimental results on randomly generating formal contexts. In: Huchard, M., Kuznetsov, S. (eds.) Proceedings of 13th International Conference on Concept Lattices and Their Applications (CLA 2016), CEUR Workshop Proceedings, vol. 1624, pp. 57\u201369. CEUR-WS.org (2016)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11928-6_22","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"2010","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 312\u2013340. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-11928-6_22"},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49291-8","volume-title":"Conceptual Exploration","author":"B Ganter","year":"2016","unstructured":"Ganter, B., Obiedkov, S.: Conceptual Exploration. Springer, Heidelberg (2016)"},{"issue":"95","key":"5_CR11","first-page":"5","volume":"24","author":"J-L Guigues","year":"1986","unstructured":"Guigues, J.-L., Duquenne, V.: Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines 24(95), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H Kautz","year":"1995","unstructured":"Kautz, H., Kearns, M., Selman, B.: Horn approximations of empirical data. Artif. Intell. 74(1), 129\u2013145 (1995)","journal-title":"Artif. Intell."},{"key":"5_CR13","unstructured":"Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base. In: Yahia, S.B., Konecny, J. (eds.) Proceedings of 12th International Conference on Concept Lattices and Their Applications (CLA 2015), CEUR Workshop Proceedings, vol. 1466, pp. 182\u2013192. CEUR-WS.org, Clermont-Ferrand (2015)"},{"issue":"8","key":"5_CR14","first-page":"927","volume":"10","author":"SO Kuznetsov","year":"2004","unstructured":"Kuznetsov, S.O.: On the intractability of computing the Duquenne-Guigues base. J. Univers. Comput. Sci. 10(8), 927\u2013933 (2004)","journal-title":"J. Univers. Comput. Sci."},{"issue":"1\u20134","key":"5_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10472-007-9057-2","volume":"49","author":"S Obiedkov","year":"2007","unstructured":"Obiedkov, S., Duquenne, V.: Attribute-incremental construction of the canonical implication basis. Ann. Math. Artif. Intell. 49(1\u20134), 77\u201399 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR16","first-page":"1","volume":"65","author":"U Ryssel","year":"2013","unstructured":"Ryssel, U., Distel, F., Borchmann, D.: Fast algorithms for implication bases and attribute exploration using proper premises. Ann. Math. Artif. Intell. Special Issue 65, 1\u201329 (2013)","journal-title":"Ann. Math. Artif. Intell. Special Issue"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S1071-5819(03)00044-2","volume":"59","author":"G Stumme","year":"2003","unstructured":"Stumme, G.: Off to new shores - conceptual knowledge discovery and processing. Int. J. Hum.-Comput. Stud. (IJHCS) 59(3), 287\u2013325 (2003)","journal-title":"Int. J. Hum.-Comput. Stud. (IJHCS)"},{"issue":"11","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"}],"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-319-59271-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:23:58Z","timestamp":1710343438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59271-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592701","9783319592718"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59271-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 May 2017","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":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2017.irisa.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}