{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:49Z","timestamp":1725565189746},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_58","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"476-485","source":"Crossref","is-referenced-by-count":7,"title":["Separating Structure from Interestingness"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45728-3_1","volume-title":"Pattern Detection and Discovery","author":"D.J. Hand","year":"2002","unstructured":"Hand, D.J.: Pattern detection and discovery. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol.\u00a02447, pp. 1\u201312. Springer, Heidelberg (2002)"},{"key":"58_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45465-9_6","volume-title":"Automata, Languages and Programming","author":"H. Mannila","year":"2002","unstructured":"Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 57\u201368. Springer, Heidelberg (2002)"},{"key":"58_CR3","unstructured":": In: 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), \n                    \n                      http:\/\/CEUR-WS.org\/Vol-90\/"},{"key":"58_CR4","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":"58_CR5","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":"58_CR6","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":"58_CR7","first-page":"21","volume-title":"Logic Programming","author":"H. Mannila","year":"1997","unstructured":"Mannila, H.: Inductive databases and condensed representations for data mining. In: Maluszynski, J. (ed.) Logic Programming, pp. 21\u201330. MIT Press, Cambridge (1997)"},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/846183.846191","volume":"1","author":"H. Mannila","year":"2000","unstructured":"Mannila, H.: Theoretical frameworks for data mining. SIGKDD Explorations\u00a01, 30\u201332 (2000)","journal-title":"SIGKDD Explorations"},{"key":"58_CR9","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":"58_CR10","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. 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":"58_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":"58_CR12","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, ACM, New York (2001)"},{"key":"58_CR13","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 disjunctionfree generators. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 305\u2013312. IEEE Computer Society, Los Alamitos (2001)"},{"key":"58_CR14","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\u2013865. Springer, Heidelberg (2002)"},{"key":"58_CR15","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: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 378\u2013385. IEEE Computer Society, Los Alamitos (2002)"},{"key":"58_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-39804-2_30","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"T. Mielik\u00e4inen","year":"2003","unstructured":"Mielik\u00e4inen, T., Mannila, H.: The pattern ordering problem. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 327\u2013338. Springer, Heidelberg (2003)"},{"key":"58_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"232","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. 232\u2013243. Springer, Heidelberg (2003)"},{"key":"58_CR18","first-page":"134","volume-title":"VLDB 1996, Proceedings of 22nd International Conference on Very Large Data Bases","author":"H. Toivonen","year":"1996","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Vijayaraman, T., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) VLDB 1996, Proceedings of 22nd International Conference on Very Large Data Bases, pp. 134\u2013145. Morgan Kaufmann, San Francisco (1996)"},{"key":"58_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45841-7_10","volume-title":"STACS 2002","author":"E. Boros","year":"2002","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 133\u2013141. Springer, Heidelberg (2002)"},{"key":"58_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"58_CR21","first-page":"100","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing","author":"N. Alon","year":"2003","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The online set cover problem. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 100\u2013105. ACM, New York (2003)"},{"key":"58_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-36285-1_2","volume-title":"Database Theory - ICDT 2003","author":"Y. Ioannidis","year":"2002","unstructured":"Ioannidis, Y.: Approximations in database systems. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 16\u201330. Springer, Heidelberg (2002)"},{"key":"58_CR23","unstructured":"Mielik\u00e4inen, T.: Finding all occurring sets of interest. In: Boulicaut, J.F., D\u017eeroski, S. (eds.) 2nd International Workshop on Knowledge Discovery in Inductive Databases, pp. 97\u2013106 (2003)"},{"key":"58_CR24","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An Illustrated Guide","author":"J. Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy: An Illustrated Guide. Algorithms and Combinatorics, vol.\u00a018. Springer, Heidelberg (1999)"},{"key":"58_CR25","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2001","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Paperback edn. Cambridge University Press, Cambridge (2001)"},{"key":"58_CR26","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovksi, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization, vol.\u00a02. SIAM, Philadelphia (2001)"},{"key":"58_CR27","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"I.R. Farias de Jr.","year":"2003","unstructured":"de Farias Jr., I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack problem. Mathematical Programming\u00a096, 439\u2013467 (2003)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:52Z","timestamp":1620011392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}