{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:26:09Z","timestamp":1758705969907,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235240"},{"type":"electronic","value":"9783319235257"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","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":[[2015]]},"DOI":"10.1007\/978-3-319-23525-7_10","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T08:20:13Z","timestamp":1440750013000},"page":"157-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fast Generation of Best Interval Patterns for Nonmonotonic Constraints"],"prefix":"10.1007","author":[{"given":"Aleksey","family":"Buzmakov","sequence":"first","affiliation":[]},{"given":"Sergei O.","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Amedeo","family":"Napoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-319-07821-2_5","volume-title":"Freq. Pattern Min.","author":"J Vreeken","year":"2014","unstructured":"Vreeken, J., Tatti, N.: Interesting patterns. In: Aggarwal, C.C., Han, J. (eds.) Freq. Pattern Min., pp. 105\u2013134. Springer International Publishing, Heildelberg (2014)"},{"key":"10_CR2","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: Knowl. Discov. Data Min., pp. 181\u2013192 (1994)"},{"key":"10_CR3","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, Vol. 1215, pp. 487\u2013499 (1994)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603\u2013626 (2006)","journal-title":"Data Knowl. Eng."},{"issue":"1\u20134","key":"10_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10472-007-9053-6","volume":"49","author":"SO Kuznetsov","year":"2007","unstructured":"Kuznetsov, S.O.: On stability of a formal concept. Ann. Math. Artif. Intell. 49(1\u20134), 101\u2013115 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"02","key":"10_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0129054108005735","volume":"19","author":"C Roth","year":"2008","unstructured":"Roth, C., Obiedkov, S.A., Kourie, D.G.: On succinct representation of knowledge community taxonomies with formal concept analysis. Int. J. Found. Comput. Sci. 19(02), 383\u2013404 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644873.1644876","volume":"4","author":"GI Webb","year":"2010","unstructured":"Webb, G.I.: Self-sufficient itemsets. ACM Trans. Knowl. Discov. Data 4(1), 1\u201320 (2010)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10115-010-0329-5","volume":"29","author":"F Moerchen","year":"2011","unstructured":"Moerchen, F., Thies, M., Ultsch, A.: Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression. Knowl. Inf. Syst. 29(1), 55\u201380 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Spyropoulou, E., De Bie, T., Boley, M.: Interesting pattern mining in multi-relational data. Data Min. Knowl. Discov., 1\u201342 (April 2013)","DOI":"10.1007\/s10618-013-0319-9"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2013.12.062","volume":"266","author":"J Cao","year":"2014","unstructured":"Cao, J., Wu, Z., Wu, J.: Scaling up cosine interesting pattern discovery: A depth-first method. Inf. Sci. (Ny) 266, 31\u201346 (2014)","journal-title":"Inf. Sci. (Ny)"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2656261","volume":"39","author":"N Tatti","year":"2014","unstructured":"Tatti, N., Moerchen, F., Calders, T.: Finding Robust Itemsets under Subsampling. ACM Trans. Database Syst. 39(3), 1\u201327 (2014)","journal-title":"ACM Trans. Database Syst."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: Proc. 2008 ACM SIGMOD Int. Conf. Manag. Data - SIGMOD 2008, pp. 433\u2013444. ACM Press, New York, June 2008","DOI":"10.1145\/1376616.1376662"},{"key":"10_CR13","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings. 2002 IEEE Int. Conf. Data Mining, ICDM 2003, pp. 211\u2013218 (2002)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Xin, D., Cheng, H., Yan, X., Han, J.: Extracting redundancy-aware top-k patterns. In: Proc. 12th ACM SIGKDD Int. Conf. Knowl. Discov. Data Min. - KDD 2006, p. 444. ACM Press, New York, August 2006","DOI":"10.1145\/1150402.1150452"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"GI Webb","year":"2011","unstructured":"Webb, G.I.: Filtered-top-k association discovery. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 1(3), 183\u2013192 (2011)","journal-title":"Data Min. Knowl. Discov."},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations, 1st edn. Springer, Heildelberg (1999)","edition":"1"},{"key":"10_CR17","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 2001. LNCS (LNAI), vol. 2120, pp. 129\u2013142. Springer, Heidelberg (2001)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/11536314_12","volume-title":"Inductive Logic Programming","author":"SO Kuznetsov","year":"2005","unstructured":"Kuznetsov, S.O., Samokhin, M.V.: Learning closed sets of labeled graphs for chemical applications. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 190\u2013208. Springer, Heidelberg (2005)"},{"key":"10_CR20","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. In: Proc. 22nd Int. Jt. Conf. Artif. Intell. Barcelona, IJCAI 2011, Catalonia, Spain, July 16\u201322, 2011, pp. 1342\u20131347 (2011)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large databases. In: Proc. SIAM Int\u2019l Conf. Data Min., pp. 166\u2013177 (2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"SO Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O.: On Computing the Size of a Lattice and Related Decision Problems. Order 18(4), 313\u2013321 (2001)","journal-title":"Order"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-319-07248-7_12","volume-title":"Formal Concept Analysis","author":"A Buzmakov","year":"2014","unstructured":"Buzmakov, A., Kuznetsov, S.O., Napoli, A.: Scalable estimates of concept stability. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds.) ICFCA 2014. LNCS, vol. 8478, pp. 157\u2013172. Springer, Heidelberg (2014)"},{"key":"10_CR24","unstructured":"Buzmakov, A., Egho, E., Jay, N., Kuznetsov, S.O., Napoli, A., Ra\u00efssi, C.: On projections of sequential pattern structures (with an application on care trajectories). In: Proc. 10th Int. Conf. Concept Lattices Their Appl., pp. 199\u2013208 (2013)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23525-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T13:52:00Z","timestamp":1691934720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23525-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235240","9783319235257"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23525-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}