{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:08Z","timestamp":1725518828293},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540881919"},{"type":"electronic","value":"9783540881926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88192-6_16","type":"book-chapter","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T08:05:59Z","timestamp":1222675559000},"page":"158-169","source":"Crossref","is-referenced-by-count":0,"title":["Mining Supplemental Frequent Patterns"],"prefix":"10.1007","author":[{"given":"Yintian","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yingming","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Kaikuo","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"16_CR2","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proc. 1995 Int. Conf. Very Large Data Bases (VLDB 1995), Zurich, Switzerland, pp. 432\u2013443 (1995)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc.of the 3rd Int\u2019l Conf. on KDD and Data Mining(KDD 1997), NewportBeach,California (August 1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: Proceedings of ACM SIGMOD International Conference on Management of Data, San Jose, CA, pp. 175\u2013186 (May 1995)","DOI":"10.1145\/223784.223813"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. 2000 ACMSIGMOD Int. Conf. Management of Data (SIGMOD 2000), Dallas, TX, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"16_CR6","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. 2001 Int. Conf. Data Engineering (ICDE 2001), Heidelberg, Germany, pp. 332\u2013433 (2001)"},{"key":"16_CR7","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-structure mining of frequent patterns in large databases. In: Proc. 2001 Int. Conf. Data Mining (ICDM 2001), San Jose, CA, pp. 441\u2013448 (2001)"},{"key":"16_CR8","unstructured":"Grahne, G., Zhu, J.: Efficiently Using. Prefix-trees in Mining Frequent Itemsets. In: Proc. IEEE ICDM 2003 Workshop FIMI 2003 (Prefix(fpgrowth)) (2003)"},{"key":"16_CR9","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Proc. 2001 Int. Conf. Data Engineering (ICDE 2001), Heidelberg, Germany, pp. 215\u2013224 (2001)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S.-C., Liu, C.: Efficient mining of iterative patterns for software specification discovery. In: Proc. KDD 2007, San Jose, California, USA, August, pp. 460\u2013469 (2007)","DOI":"10.1145\/1281192.1281243"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: KDD 2007, pp. 330\u2013339 (2007)","DOI":"10.1145\/1281192.1281230"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"CloseZaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithm for closed itemset mining. In: Proc. 2002 SIAM Int. Conf. Data Mining, Arlington, VA, pp. 457\u2013473 (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. ClosePasquier","year":"1998","unstructured":"ClosePasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"16_CR14","unstructured":"ClosePei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD 2000), Dallas, TX, pp. 11\u201320 (2000)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceeding of the 7th International Conference on Database Theory, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"maxJ. Roberto, J.B.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"key":"16_CR17","first-page":"105","volume-title":"Proceedings of the 6th European Conference on Extending Database Technology","author":"D.I. maxLin","year":"1998","unstructured":"maxLin, D.I., Kedem, Z.M.: Pincer-Search: A new algorithm for discovering the maximum frequent set. In: Schek, H.J. (ed.) Proceedings of the 6th European Conference on Extending Database Technology, pp. 105\u2013119. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88192-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:57:38Z","timestamp":1619524658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88192-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540881919","9783540881926"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88192-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}