{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:01:22Z","timestamp":1710349282609},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T00:00:00Z","timestamp":1242691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10115-009-0212-4","type":"journal-article","created":{"date-parts":[[2009,5,18]],"date-time":"2009-05-18T17:56:56Z","timestamp":1242669416000},"page":"65-89","source":"Crossref","is-referenced-by-count":18,"title":["Approximating the number of frequent sets in dense data"],"prefix":"10.1007","volume":"21","author":[{"given":"Mario","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henrik","family":"Grosskreutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"212_CR1","doi-asserted-by":"crossref","unstructured":"Bayardo R, Goethals B, Zaki MJ (eds) (2004) Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations, vol 126. CEUR Workshop Proceedings. http:\/\/CEUR-WS.org","DOI":"10.1145\/1007730.1007744"},{"issue":"4","key":"212_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TKDE.2005.67","volume":"17","author":"A Bernstein","year":"2005","unstructured":"Bernstein A, Provost F, Hill S (2005) Toward intelligent assistance for a data mining process: an ontology-based approach for cost-sensitive classification. IEEE Trans Knowl Data Eng 17(4): 503\u2013518","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"212_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10115-006-0046-2","volume":"13","author":"J Blanchard","year":"2007","unstructured":"Blanchard J, Guillet F, Briand H (2007) Interactive visual exploration of association rules with rule-focusing methodology. Knowl Inf Syst 13(1): 43\u201375","journal-title":"Knowl Inf Syst"},{"key":"212_CR4","unstructured":"Bodon F (2003) A fast apriori implementation, In: Goethals B, Zaki MJ (eds) Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI\u201903), vol 90. CEUR Workshop Proceedings, Melbourne"},{"key":"212_CR5","doi-asserted-by":"crossref","unstructured":"Boley M (2007) On approximating minimum infrequent and maximum frequent sets. Discov Sci 68\u201377","DOI":"10.1007\/978-3-540-75488-6_8"},{"key":"212_CR6","doi-asserted-by":"crossref","unstructured":"Boley M, Horv\u00e1th T, Wrobel S (2009) Efficient discovery of interesting patterns based on strong closedness. In: Proceedings of the SIAM international conference for data mining (SDM)","DOI":"10.1137\/1.9781611972795.86"},{"issue":"2","key":"212_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/1071610.1071611","volume":"30","author":"F Geerts","year":"2005","unstructured":"Geerts F, Goethals B, Bussche JVD (2005) Tight upper bounds on the number of candidate patterns. ACM Trans Database Syst 30(2): 333\u2013363","journal-title":"ACM Trans Database Syst"},{"key":"212_CR8","unstructured":"Grahne G, Zhu J (2003) Efficiently using prefix-trees in mining frequent itemsets. In: FIMI\u201903 workshop on frequent itemset mining implementations"},{"issue":"2","key":"212_CR9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos D, Khardon R, Mannila H, Saluja S, Toivonen H, Sharma RS (2003) Discovering all most specific sentences. ACM Trans Database Syst 28(2): 140\u2013174","journal-title":"ACM Trans Database Syst"},{"key":"212_CR10","doi-asserted-by":"crossref","unstructured":"H\u00e4m\u00e4l\u00e4inen W, Nyk\u00e4nen M (2008) Efficient discovery of statistically significant association rules. ICDM","DOI":"10.1109\/ICDM.2008.144"},{"key":"212_CR11","unstructured":"Han J, Kamber M (2000) Data mining: concepts and techniques. Morgan-Kaufmann, Menlo Park"},{"issue":"2\u20133","key":"212_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"MR Jerrum","year":"1986","unstructured":"Jerrum MR, Valiant LG, Vazirani VV (1986) Random generation of combinatorial structures from a uniform distribution. Theor Comput Sci 43(2\u20133): 169\u2013188","journal-title":"Theor Comput Sci"},{"key":"212_CR13","unstructured":"Jerrum M, Sinclair A (1997) The markov chain monte carlo method: an approach to approximate counting and integration. In: Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, pp 482\u2013520"},{"key":"212_CR14","doi-asserted-by":"crossref","unstructured":"Jin R, McCallen S, Breitbart Y, Fuhry D, Wang D (2009) Estimating the number of frequent itemsets in a large database. In: Proceedings of 12th international conference on extending database technology (EDBT)","DOI":"10.1145\/1516360.1516420"},{"issue":"3","key":"212_CR15","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0196-6774(89)90038-2","volume":"10","author":"RM Karp","year":"1989","unstructured":"Karp RM, Luby M, Madras N (1989) Monte-Carlo approximation algorithms for enumeration problems. J Algorithms 10(3): 429\u2013448","journal-title":"J Algorithms"},{"key":"212_CR16","doi-asserted-by":"crossref","unstructured":"Khot S (2004) Ruling out ptas for graph min-bisection, densest subgraph and bipartite clique. In: Foundations of computer science. IEEE Computer Society, Washington, DC, pp 136\u2013145","DOI":"10.1109\/FOCS.2004.59"},{"key":"212_CR17","doi-asserted-by":"crossref","unstructured":"Li W, Mozes A (2004) Computing frequent itemsets inside oracle 10g. In: VLDB \u201904: Proceedings of the Thirtieth international conference on very large data bases, VLDB Endowment, pp 1253\u20131256","DOI":"10.1016\/B978-012088469-8.50120-0"},{"key":"212_CR18","unstructured":"Morik K, Scholz M (2002) The miningmart approach. In: GI Jahrestagung, pp 811\u2013818"},{"key":"212_CR19","doi-asserted-by":"crossref","unstructured":"Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: KDD, pp 350\u2013354","DOI":"10.1145\/347090.347166"},{"issue":"2","key":"212_CR20","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MCSE.2006.30","volume":"8","author":"D Randall","year":"2006","unstructured":"Randall D (2006) Rapidly mixing Markov chains with applications in computer science and physics. Comput Sci Eng 8(2): 30\u201341","journal-title":"Comput Sci Eng"},{"key":"212_CR21","first-page":"833","volume":"3","author":"T Scheffer","year":"2002","unstructured":"Scheffer T, Wrobel S (2002) Finding the most interesting patterns in a database quickly by using sequential sampling. J Mach Learn Res 3: 833\u2013862","journal-title":"J Mach Learn Res"},{"issue":"1\u20134","key":"212_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1018905417023","volume":"24","author":"RH Sloan","year":"1998","unstructured":"Sloan RH, Takata K, Tur\u00e1n G (1998) On frequent sets of boolean matrices. Ann Math Artif Intell 24(1\u20134): 193\u2013209","journal-title":"Ann Math Artif Intell"},{"issue":"1","key":"212_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N Tatti","year":"2008","unstructured":"Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1): 57\u201377","journal-title":"Knowl Inf Syst"},{"key":"212_CR24","unstructured":"Utley C (2005) Introduction to sql server 2005 data mining. Technical report"},{"key":"212_CR25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of computing the permanent. Theor Comput Sci 8: 189\u2013201","journal-title":"Theor Comput Sci"},{"issue":"5","key":"212_CR26","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5): 652\u2013664","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"212_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu X, Kumar V, Quinlan JR, Ghosh J, Yang Q, Motoda H, McLachlan GJ, Ng AFM, Liu B, Yu PS, Zhou Z-H, Steinbach M, Hand DJ, Steinberg D (2008) Top 10 algorithms in data mining. Knowl Inf Syst 14(1): 1\u201337","journal-title":"Knowl Inf Syst"},{"key":"212_CR28","doi-asserted-by":"crossref","unstructured":"Yoshizawa T, Pramudiono I, Kitsuregawa M (2000) Sql based association rule mining using commercial rdbms (ibm db2 udb eee), Data Warehousing and Knowledge Discovery, pp 301\u2013306","DOI":"10.1007\/3-540-44466-1_30"},{"issue":"2","key":"212_CR29","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10115-007-0081-7","volume":"15","author":"S Zhang","year":"2008","unstructured":"Zhang S, Wu X, Zhang C, Lu J (2008) Computing the minimum-support for mining frequent patterns. Knowl Inf Syst 15(2): 233\u2013257","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"212_CR30","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"25","author":"D Zuckerman","year":"1996","unstructured":"Zuckerman D (1996) On unapproximable versions of np-complete problems. SIAM J Comput 25(6): 1293\u20131304","journal-title":"SIAM J Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0212-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0212-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0212-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:19Z","timestamp":1559124619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0212-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,19]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0212-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,19]]}}}