{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T12:29:46Z","timestamp":1778675386373,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1018905417023","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"193-209","source":"Crossref","is-referenced-by-count":13,"title":["On frequent sets of Boolean matrices"],"prefix":"10.1007","volume":"24","author":[{"given":"Robert H.","family":"Sloan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Takata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325513_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast discovery of association rules, in: Advances in Knowledge Discovery and Data Mining, eds. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy (AAAI Press, Menlo Park, CA, 1996) pp. 307\u2013328."},{"key":"325513_CR2","doi-asserted-by":"crossref","unstructured":"R. Beigel, N. Reingold and D. Spielman, The perceptron strikes back (preliminary report), in: Proceedings of the 6th Annual Structure in Complexity Theory Conference (1991) pp. 286\u2013291.","DOI":"10.1109\/SCT.1991.160270"},{"key":"325513_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J.C. Bioch","year":"1995","unstructured":"J.C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 50\u201363.","journal-title":"Information and Computation"},{"key":"325513_CR4","volume-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability","author":"B. Bollob\u00e1s","year":"1986","unstructured":"B. Bollob\u00e1s, Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability (Cambridge University Press, Cambridge, 1986)."},{"key":"325513_CR5","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput. 24 (1995) 1278\u20131304.","journal-title":"SIAM J. Comput."},{"key":"325513_CR6","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"M.L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618\u2013628.","journal-title":"J. Algorithms"},{"key":"325513_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient Algorithms for Listing Combinatorial Objects","author":"L.A. Goldberg","year":"1993","unstructured":"L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Objects, Distinguished Dissertations in Computer Science (Cambridge University Press, Cambridge, 1993)."},{"key":"325513_CR8","series-title":"Interscience Series in Discrete Mathematics","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1980","unstructured":"R.L. Graham, B.L. Rothschild and J.H. Spencer, Ramsey Theory, Interscience Series in Discrete Mathematics (Wiley, New York, 1980)."},{"key":"325513_CR9","doi-asserted-by":"crossref","unstructured":"D. Gunopulos, R. Khardon, H. Mannila and H. Toivonen, Data mining, hypergraph transversals, and machine learning, in: Proceedings of the 16th ACM SIGACT\u2013SIGMOD\u2013SIGART Symposium on Principles of Database Systems (1997) pp. 12\u201315.","DOI":"10.1145\/263661.263684"},{"key":"325513_CR10","unstructured":"V. Gurvich and L. Khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, RUTCOR Research Report RRR 35-95, Rutgers Center for Operations Research (1997). Also available as LCSR-TR-251, Department of Computer Science, Rutgers University (1995). To appear in Discrete Appl. Math."},{"key":"325513_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0012-365X(96)00090-8","volume":"169","author":"V. Gurvich","year":"1997","unstructured":"V. Gurvich and L. Khachiyan, On the frequency of the most frequently occurring variable in dual monotone DNFs, Discrete Math. 169 (1997) 245\u2013248.","journal-title":"Discrete Math."},{"key":"325513_CR12","doi-asserted-by":"crossref","unstructured":"P. H\u00e1jek and T. Havr\u00e1nek, Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory (Springer, 1978).","DOI":"10.1007\/978-3-642-66943-9"},{"key":"325513_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A. Hajnal","year":"1993","unstructured":"A. Hajnal, W. Maass, P. Pudl\u00e1k, M. Szegedy and G. Tur\u00e1n, Threshold circuits of bounded depth, J. Comput. System Sci. 46 (1993) 129\u2013154.","journal-title":"J. Comput. System Sci."},{"key":"325513_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119\u2013123.","journal-title":"Inform. Process. Lett."},{"key":"325513_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(95)00137-2","volume":"56","author":"S. Jukna","year":"1995","unstructured":"S. Jukna, Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates, Inform. Process. Lett. 56 (1995) 147\u2013150.","journal-title":"Inform. Process. Lett."},{"key":"325513_CR16","first-page":"228","volume":"15","author":"G.O.H. Katona","year":"1964","unstructured":"G.O.H. Katona, T. Nemetz and M. Simonovits, On a problem of Tur\u00e1n in the theory of graphs, Mat. Lapok 15 (1964) 228\u2013238 (in Hungarian).","journal-title":"Mat. Lapok"},{"issue":"3","key":"325513_CR17","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E.L. Lawler","year":"1980","unstructured":"E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput. 9(3) (1980) 558\u2013565.","journal-title":"SIAM J. Comput."},{"key":"325513_CR18","unstructured":"H. Mannila and H. Toivonen, Multiple uses of frequent sets and condensed representations, in: Proc. 2nd International Conference on Knowledge Discovery and Data Mining (1996) pp. 189\u2013194."},{"key":"325513_CR19","unstructured":"H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Series of Publications C C-1997-8, University of Helsinki, Department of Computer Science (1997)."},{"key":"325513_CR20","volume-title":"Perceptrons","author":"M. Minsky","year":"1969","unstructured":"M. Minsky and S. Papert, Perceptrons (MIT Press, Cambridge, MA, 1969)."},{"key":"325513_CR21","first-page":"211","volume-title":"Proc. 10th Annu. Conf. on Comput. Learning Theory","author":"N. Mishra","year":"1997","unstructured":"N. Mishra and L. Pitt, Generating all maximal independent sets of bounded-degree hypergraphs, in: Proc. 10th Annu. Conf. on Comput. Learning Theory (ACM Press, New York, 1997) pp. 211\u2013217."},{"key":"325513_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(79)90045-8","volume":"8","author":"P. Pudl\u00e1k","year":"1979","unstructured":"P. Pudl\u00e1k and F.N. Springsteel, Complexity of mechanized hypothesis formation, Theoret. Comput. Sci. 8 (1979) 203\u2013225.","journal-title":"Theoret. Comput. Sci."},{"key":"325513_CR23","volume-title":"Discrete Neural Computation: A Theoretical Foundation","author":"K.-Y. Siu","year":"1995","unstructured":"K.-Y. Siu, V. Roychowdhury and T. Kailath, Discrete Neural Computation: A Theoretical Foundation (Prentice-Hall, Englewood Cliffs, NJ, 1995)."},{"issue":"3","key":"325513_CR24","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6(3) (1977) 505\u2013517.","journal-title":"SIAM J. Comput."},{"key":"325513_CR25","doi-asserted-by":"crossref","unstructured":"I. Wegener, The Complexity of Boolean Functions (Wiley\u2013Teubner, 1987).","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018905417023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018905417023\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018905417023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:46Z","timestamp":1747546966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018905417023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":25,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["325513"],"URL":"https:\/\/doi.org\/10.1023\/a:1018905417023","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}