{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:37:42Z","timestamp":1762101462677},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40994-3_26","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T13:07:10Z","timestamp":1377695230000},"page":"403-418","source":"Crossref","is-referenced-by-count":20,"title":["The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem"],"prefix":"10.1007","author":[{"given":"Said","family":"Jabbour","sequence":"first","affiliation":[]},{"given":"Lakhdar","family":"Sais","sequence":"additional","affiliation":[]},{"given":"Yakoub","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"207","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216. ACM Press, Baltimore (1993)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.3923\/itj.2010.1278.1293","volume":"9","author":"A. Tiwari","year":"2010","unstructured":"Tiwari, A., Gupta, R., Agrawal, D.: A survey on frequent pattern mining: Current status and challenging issues. Inform. Technol. J\u00a09, 1278\u20131293 (2010)","journal-title":"Inform. Technol. J"},{"key":"26_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-39963-1_7","volume-title":"Foundations of Intelligent Systems","author":"A.W.-C. Fu","year":"2000","unstructured":"Fu, A.W.-C., Kwong, R.W.-W., Tang, J.: Mining N-most Interesting Itemsets. In: Ohsuga, S., Ra\u015b, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol.\u00a01932, pp. 59\u201367. Springer, Heidelberg (2000)"},{"key":"26_CR4","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 211\u2013218. IEEE Computer Society (2002)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Yu, J.X.: Top-k correlative graph mining. In: Proceedings of the SIAM International Conference on Data Mining (SDM 2009), pp. 1038\u20131049 (2009)","DOI":"10.1137\/1.9781611972795.89"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-31235-9_14","volume-title":"Scientific and Statistical Database Management","author":"E. Valari","year":"2012","unstructured":"Valari, E., Kontaki, M., Papadopoulos, A.N.: Discovery of top-k dense subgraphs in dynamic graph collections. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol.\u00a07338, pp. 213\u2013230. Springer, Heidelberg (2012)"},{"key":"26_CR7","unstructured":"Lam, H.T., Calders, T.: Mining top-k frequent items in a data stream with flexible sliding windows. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pp. 283\u2013292 (2010)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Lam, H.T., Calders, T., Pham, N.: Online discovery of top-k similar motifs in time series data. In: Proceedings of the Eleventh SIAM International Conference on Data Mining, SDM 2011, pp. 1004\u20131015 (2011)","DOI":"10.1137\/1.9781611972818.86"},{"key":"26_CR9","volume-title":"Reasoning about change: time and causation from the standpoint of artificial intelligence","author":"Y. Shoham","year":"1988","unstructured":"Shoham, Y.: Reasoning about change: time and causation from the standpoint of artificial intelligence. MIT Press, Cambridge (1988)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Meseguer, P., Rossi, F., Schiex, T.: 9. In: Soft Constraints. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80013-1"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Poole, D.L., Hoos, H.H.: CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research (JAIR)\u00a021, 135\u2013191 (2004)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"4","key":"26_CR12","first-page":"59","volume":"28","author":"T. Walsh","year":"2007","unstructured":"Walsh, T.: Representing and reasoning with preferences. AI Magazine\u00a028(4), 59\u201370 (2007)","journal-title":"AI Magazine"},{"issue":"1","key":"26_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1609\/aimag.v30i1.2114","volume":"30","author":"R.I. Brafman","year":"2009","unstructured":"Brafman, R.I., Domshlak, C.: Preference Handling - An Introductory Tutorial. AI Magazine\u00a030(1), 58\u201386 (2009)","journal-title":"AI Magazine"},{"issue":"7-8","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.artint.2011.03.004","volume":"175","author":"C. Domshlak","year":"2011","unstructured":"Domshlak, C., H\u00fcllermeier, E., Kaci, S., Prade, H.: Preferences in AI: An overview. Artificial Intelligence\u00a0175(7-8), 1037\u20131052 (2011)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10601-010-9095-y","volume":"15","author":"E.D. Rosa","year":"2010","unstructured":"Rosa, E.D., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints\u00a015(4), 485\u2013515 (2010)","journal-title":"Constraints"},{"key":"26_CR16","unstructured":"Castell, T., Cayrol, C., Cayrol, M., Berre, D.L.: Using the davis and putnam procedure for an efficient computation of preferred models. In: ECAI, pp. 350\u2013354 (1996)"},{"issue":"5","key":"26_CR17","doi-asserted-by":"publisher","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.: TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge Data Engineering\u00a017(5), 652\u2013664 (2005)","journal-title":"IEEE Transactions on Knowledge Data Engineering"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of derivations in the propositional calculus. In: Structures in Constructives Mathematics and Mathematical Logic, Part II, pp. 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On Solving the Partial MAX-SAT Problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"26_CR20","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters (1996)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 827\u2013831. Springer, Heidelberg (2005)"},{"key":"26_CR23","unstructured":"Cadoli, M.: On the complexity of model finding for nonmonotonic propositional logics. In: 4th Italian Conference on Theoretical Computer Science, pp. 125\u2013139 (1992)"},{"key":"26_CR24","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: ACM SIGKDD, pp. 204\u2013212 (2008)"},{"issue":"12-13","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T. Guns","year":"2011","unstructured":"Guns, T., Nijssen, S., De Raedt, L.: Itemset mining: A constraint programming perspective. Artificial Intelligence\u00a0175(12-13), 1951\u20131983 (2011)","journal-title":"Artificial Intelligence"},{"issue":"1-4","key":"26_CR26","first-page":"1","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. JSAT\u00a02(1-4), 1\u201326 (2006)","journal-title":"JSAT"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40994-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T23:53:06Z","timestamp":1558050786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40994-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40994-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}