{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:10:22Z","timestamp":1739920222955,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540250821"},{"type":"electronic","value":"9783540318415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31841-5_9","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:01:31Z","timestamp":1267459291000},"page":"150-172","source":"Crossref","is-referenced-by-count":2,"title":["Implicit Enumeration of Patterns"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proceedings of the 1993 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: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C, May 26-28, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"9_CR2","unstructured":"Goethals, B., Zaki, M.J. (eds.): Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI 2003), Melbourne Florida, USA, November 19. CEUR Workshop Proceedings, vol.\u00a090 (2003), http:\/\/CEUR-WS.org\/Vol-90\/"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning\u00a050, 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Kurakochi, M., Karypis, G.: Discovering frequent geometric subgraphs. In: [32], pp. 258\u2013265","DOI":"10.1109\/ICDM.2002.1183911"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TKDE.2002.1019211","volume":"14","author":"X. Wang","year":"2002","unstructured":"Wang, X., Wang, J.T., Shasha, D., Shapiro, B.A., Rigoutsos, I., Zhang, K.: Finding patterns in three-dimensional graphs: Algorithms and applications to scientific data mining. IEEE Transactions on Knowledge and Data Engineering\u00a014, 731\u2013749 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, pp. 286\u2013295. ACM, New York (2003)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TKDE.2002.1000341","volume":"14","author":"M. Garofalakis","year":"2002","unstructured":"Garofalakis, M., Rastogi, R., Shim, K.: Mining sequential patterns with regular expression constraints. IEEE Transactions on Knowledge and Data Engineering\u00a014, 530\u2013552 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01, 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An efficient algoritm for mining frequent sequences. Machine Learning\u00a042, 31\u201360 (2001)","journal-title":"Machine Learning"},{"key":"9_CR10","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"P.N. Tan","year":"2002","unstructured":"Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: Hand, D., Keim, D., Ng, R. (eds.) Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26. ACM, New York (2002)"},{"key":"9_CR11","first-page":"189","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996)","author":"H. Mannila","year":"1996","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), pp. 189\u2013194. AAAI Press, Menlo Park (1996)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/772862.772871","volume":"4","author":"L. De Raedt","year":"2003","unstructured":"De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations\u00a04, 69\u201377 (2003)","journal-title":"SIGKDD Explorations"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of The ACM\u00a039, 58\u201364 (1996)","journal-title":"Communications of The ACM"},{"key":"9_CR14","first-page":"21","volume-title":"Logic Programming, Proceedngs of the 1997 International Symposium","author":"H. Mannila","year":"1997","unstructured":"Mannila, H.: Inductive databases and condensed representations for data mining. In: Maluszynski, J. (ed.) Logic Programming, Proceedngs of the 1997 International Symposium, Port Jefferson, Long Island, N.Y., October 13-16, pp. 21\u201330. MIT Press, Cambridge (1997)"},{"key":"9_CR15","doi-asserted-by":"publisher","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, R.S.: Discovering all most specific sentences. ACM Transactions on Database Systems\u00a028, 140\u2013174 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"9_CR16","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 1999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, 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":"9_CR17","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":"9_CR18","volume-title":"Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"A. Bykowski","year":"2001","unstructured":"Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, California, USA, May 21-23. ACM, New York (2001)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/ICDM.2001.989533","volume-title":"Proceedings of the 2001 IEEE International Conference on Data Mining","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunction-free generators. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) Proceedings of the 2001 IEEE International Conference on Data Mining, San Jose, California, USA, November 29 - December 2, pp. 305\u2013312. IEEE Computer Society, Los Alamitos (2001)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Minimal k-free representations of frequent sets. In: [33], pp. 71\u201382","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"9_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"9_CR22","unstructured":"Pei, J., Dong, G., Zou, W., Han, J.: On computing condensed pattern bases. In: [33], pp. 378\u2013385"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Mielik\u00e4inen, T., Mannila, H.: The pattern ordering problem. In: [33], pp. 327\u2013338","DOI":"10.1007\/978-3-540-39804-2_30"},{"key":"9_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-39644-4_20","volume-title":"Discovery Science","author":"T. Mielik\u00e4inen","year":"2003","unstructured":"Mielik\u00e4inen, T.: Chaining patterns. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 233\u2013244. Springer, Heidelberg (2003)"},{"key":"9_CR25","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI\/MIT Press (1996)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-48298-9_20","volume-title":"Data Warehousing and Knowledge Discovery","author":"A. Hafez","year":"1999","unstructured":"Hafez, A., Deogun, J., Raghavan, V.V.: The item-set tree: A data structure for data mining. In: Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol.\u00a01676, pp. 183\u2013192. Springer, Heidelberg (1999)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-31841-5_8","volume-title":"Knowledge Discovery in Inductive Databases","author":"T. Mielik\u00e4inen","year":"2005","unstructured":"Mielik\u00e4inen, T.: An automata approach to pattern collections. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 130\u2013149. Springer, Heidelberg (2005)"},{"key":"9_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-24775-3_58","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Mielik\u00e4inen","year":"2004","unstructured":"Mielik\u00e4inen, T.: Separating structure from interestingness. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 476\u2013485. Springer, Heidelberg (2004)"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhai, L.: Mining frequent patterns with counting inference. SIGKDD Explorations\u00a02, 66\u201375 (2000)","journal-title":"SIGKDD Explorations"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/290159.290162","volume":"16","author":"A. Moffat","year":"1998","unstructured":"Moffat, A., Neal, R.M., Witten, I.H.: Arithmetic coding revisited. ACM Transactions on Information Systems\u00a016, 256\u2013294 (1998)","journal-title":"ACM Transactions on Information Systems"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/TKDE.2003.1245281","volume":"15","author":"D. Pavlov","year":"2003","unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: probabilistic methods for query approximation on binary transaction data. IEEE Transactions on Data and Knowledge Engineering\u00a015, 1409\u20131421 (2003)","journal-title":"IEEE Transactions on Data and Knowledge Engineering"},{"volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002)","year":"2002","key":"9_CR32","unstructured":"Kumar, V., Tsumoto, S. (eds.): Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, December 9-12. IEEE Computer Society, Los Alamitos (2002)"},{"key":"9_CR33","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Knowledge Discovery in Databases: PKDD 2003","year":"2003","unstructured":"Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.): PKDD 2003. LNCS (LNAI), vol.\u00a02838. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Inductive Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31841-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:38:58Z","timestamp":1739918338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31841-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250821","9783540318415"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31841-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}