{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T02:10:09Z","timestamp":1745979009443,"version":"3.40.4"},"publisher-location":"Heidelberg","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319002927"},{"type":"electronic","value":"9783319002934"}],"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-319-00293-4_28","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T11:27:27Z","timestamp":1363951647000},"page":"367-378","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Algorithm for Mining Frequent Itemsets with Single Constraint"],"prefix":"10.1007","author":[{"given":"Hai","family":"Duong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th International Conference on Very Large Data Bases, pp. 478\u2013499 (1994)","key":"28_CR1"},{"doi-asserted-by":"crossref","unstructured":"Anh, T., Hai, D., Tin, T., Bac, L.: Efficient Algorithms for Mining Frequent Itemsets with Constraint. In: Proc. of the Third International Conference on Knowledge and Systems Engineering, pp. 19\u201325 (2011)","key":"28_CR2","DOI":"10.1109\/KSE.2011.12"},{"key":"28_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-642-32695-0_77","volume-title":"PRICAI 2012: Trends in Artificial Intelligence","author":"A. Tran","year":"2012","unstructured":"Tran, A., Duong, H., Truong, T., Le, B.: Mining Frequent Itemsets with Dualistic Constraints. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS (LNAI), vol.\u00a07458, pp. 807\u2013813. Springer, Heidelberg (2012)"},{"unstructured":"Anh, T., Tin, T., Bac, L., Hai, D.: Mining Association Rules Restricted on Constraint. In: Proc. IEEE-RIVF 2012, pp. 51\u201356 (2012)","key":"28_CR4"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1009895914772","volume":"4","author":"R.J. Bayardo","year":"2000","unstructured":"Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery\u00a04, 217\u2013240 (2000)","journal-title":"Data Mining and Knowledge Discovery"},{"unstructured":"Birkhoff, G.: Lattice theory. American Mathematical Society, New York (1948)","key":"28_CR6"},{"doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: Optimized level-wise frequent pattern mining with monotone constraints. In: Proc. IEEE ICDM 2003, pp. 11\u201318 (2003B)","key":"28_CR7","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"28_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated data reduction in constrained pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proc. IEEE ICDM 2004 (2004) (in Press)","key":"28_CR9","DOI":"10.1007\/11430919_15"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-45571-X_9","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J.F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.F., Bykowski, A.: Frequent closures as a concise representation for binary Data Mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 62\u201373. Springer, Heidelberg (2000)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery\u00a07, 5\u201322 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C. Bucila","year":"2003","unstructured":"Bucila, C., Gehrke, J.E., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery\u00a07, 241\u2013272 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proc. IEEE ICDE 2001, pp. 443\u2013452 (2001)","key":"28_CR13","DOI":"10.1109\/ICDE.2001.914857"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3233\/IDA-2002-6404","volume":"6","author":"B. Jeudy","year":"2002","unstructured":"Jeudy, B., Boulicaut, J.F.: Optimization of association rule mining queries. Intelligent Data Analysis\u00a06, 341\u2013357 (2002)","journal-title":"Intelligent Data Analysis"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"D.I. Lin","year":"2002","unstructured":"Lin, D.I., Kedem, Z.M.: Pincer search: An efficient algorithm for discovering the maximum frequent sets. IEEE Trans. on Knowledge and Data Engineering\u00a014, 553\u2013566 (2002)","journal-title":"IEEE Trans on Knowledge and Data Engineering"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01, 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In: Proc. of the 1998 ACM-SIG-MOD Int\u2019l Conf. on the Management of Data, pp. 13\u201324 (1998)","key":"28_CR17","DOI":"10.1145\/276305.276307"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. Intelligent Information Systems\u00a024, 29\u201360 (2005)","journal-title":"J. Intelligent Information Systems"},{"unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. IEEE ICDE 2001, pp. 433\u2013442 (2001)","key":"28_CR19"},{"doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Constrained Frequent Pattern Mining: A Pattern-Growth View. In: Proc. ACM SIGKDD Explorations (Special Issue on Constraints in Data Mining), vol.\u00a04, pp. 31\u201339 (2002)","key":"28_CR20","DOI":"10.1145\/568574.568580"},{"unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. KDD 1997, pp. 67\u201373 (1997)","key":"28_CR21"},{"key":"28_CR22","series-title":"SCI","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12090-9_19","volume-title":"Advances in Intelligent Information and Database Systems","author":"T.C. Truong","year":"2010","unstructured":"Truong, T.C., Tran, A.N.: Structure of set of association rules based on concept lattice. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol.\u00a0283, pp. 217\u2013227. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery, 223\u2013248 (2004)","key":"28_CR23","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283\u2013296 (1997)","key":"28_CR24","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowledge and Data Engineering\u00a017, 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"28_CR26","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","volume":"23","author":"R. Wille","year":"1992","unstructured":"Wille, R.: Concept lattices and conceptual knowledge systems. Computers and Math. with App.\u00a023, 493\u2013515 (1992)","journal-title":"Computers and Math. with App."},{"unstructured":"Frequent Itemset Mining Dataset Repository (FIMDR), http:\/\/fimi.cs.helsinki.fi\/data\/ (accessed 2009)","key":"28_CR27"},{"unstructured":"http:\/\/www.cs.rpi.edu\/~zaki\/wwwnew\/pmwiki.php\/Software\/Software#patutils (acessed 2010)","key":"28_CR28"}],"container-title":["Studies in Computational Intelligence","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00293-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:29:57Z","timestamp":1745976597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00293-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319002927","9783319002934"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00293-4_28","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}