{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:12:31Z","timestamp":1725549151765},"publisher-location":"Berlin, Heidelberg","reference-count":31,"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_8","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:01:31Z","timestamp":1267459291000},"page":"130-149","source":"Crossref","is-referenced-by-count":2,"title":["An Automata Approach to Pattern Collections"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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":"8_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":"8_CR3","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":"8_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/772862.772871","volume":"4","author":"L. Raedt De","year":"2003","unstructured":"De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations\u00a04, 69\u201377 (2003)","journal-title":"SIGKDD Explorations"},{"key":"8_CR5","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":"8_CR6","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":"8_CR7","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":"8_CR8","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":"8_CR9","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":"8_CR10","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":"8_CR11","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 Press, Los Alamitos (2001)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Minimal k-free representations of frequent sets. In: [31], pp. 71\u201382","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"8_CR13","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":"8_CR14","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/ICDM.2002.1183928","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002)","author":"J. Pei","year":"2002","unstructured":"Pei, J., Dong, G., Zou, W., Han, J.: On computing condensed pattern bases. In: Kumar, V., Tsumoto, S. (eds.) Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, December 9-12, pp. 378\u2013385. IEEE Computer Society, Los Alamitos (2002)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Mielik\u00e4inen, T., Mannila, H.: The pattern ordering problem. In: [31], pp. 327\u2013338","DOI":"10.1007\/978-3-540-39804-2_30"},{"key":"8_CR16","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":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-31841-5_9","volume-title":"Knowledge Discovery in Inductive Databases","author":"T. Mielik\u00e4inen","year":"2005","unstructured":"Mielik\u00e4inen, T.: Implicit enumeration of patterns. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol.\u00a03377, pp. 150\u2013172. Springer, Heidelberg (2005)"},{"key":"8_CR18","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":"8_CR19","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"J.S. Vitter","year":"1987","unstructured":"Vitter, J.S.: Design and analysis of dynamic huffman codes. Journal of the Association for Computing Machinery\u00a034, 825\u2013845 (1987)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"8_CR20","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":"8_CR21","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., Tjoa, A.M. (eds.) DaWaK 1999. LNCS, vol.\u00a01676, pp. 183\u2013192. Springer, Heidelberg (1999)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering\u00a012, 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8_CR23","volume-title":"Introduction to Auotmata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Auotmata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"key":"8_CR24","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"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers\u00a045, 993\u20131002 (1996)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0129054100000193","volume":"11","author":"H. Zantema","year":"2000","unstructured":"Zantema, H., Bodlaender, H.L.: Finding small equivalent decision trees is hard. International Journal of Foundations of Computer Science\u00a011, 343\u2013354 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"8_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys\u00a024, 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science\u00a092, 181\u2013189 (1992)","journal-title":"Theoretical Computer Science"},{"key":"8_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0167-6423(03)00012-1","volume":"48","author":"B.W. Watson","year":"2003","unstructured":"Watson, B.W.: A new algorithm for the construction of minimal acyclic DFAs. Science of Computer Programming\u00a048, 81\u201397 (2003)","journal-title":"Science of Computer Programming"},{"key":"8_CR30","volume-title":"Proceedings of the IFIP\/SIAM Workshop on Discrete Mathematics and Data Mining, SIAM International Conference on Data Mining (2003)","author":"T. Mielik\u00e4inen","year":"2003","unstructured":"Mielik\u00e4inen, T.: Frequency-based views to pattern collections. In: Hammer, P.L. (ed.) Proceedings of the IFIP\/SIAM Workshop on Discrete Mathematics and Data Mining, SIAM International Conference on Data Mining (2003), San Francisco, CA, USA, May 1-3. SIAM, Philadelphia (2003)"},{"key":"8_CR31","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_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:02Z","timestamp":1605760082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31841-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250821","9783540318415"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31841-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}