{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T16:29:06Z","timestamp":1748276946807},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200857"},{"type":"electronic","value":"9783540398042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39804-2_30","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:06:45Z","timestamp":1277683605000},"page":"327-338","source":"Crossref","is-referenced-by-count":27,"title":["The Pattern Ordering Problem"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","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":"30_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/ICDM.2001.989514","volume-title":"Proceedings of the 2001 IEEE International Conference on Data Mining","author":"K. Gouda","year":"2001","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 163\u2013170. IEEE Computer Society, Los Alamitos (2001)"},{"key":"30_CR3","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., Toivnen, 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":"30_CR4","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":"30_CR5","volume-title":"Proceedings of the Second SIAM International Conference on Data Mining","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: An efficient algorithms for closed itemset mining. In: Grossman, R., Han, J., Kumar, V., Mannila, H., Motwani, R. (eds.) Proceedings of the Second SIAM International Conference on Data Mining, SIAM, Philadelphia (2002)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/312129.312281","volume-title":"Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"H. Mannila","year":"1999","unstructured":"Mannila, H., Pavlov, D., Smyth, P.: Prediction with local patterns using crossentropy. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 357\u2013361. ACM, New York (1999)"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1214\/ECP.v7-1050","volume":"7","author":"D. Kessler","year":"2002","unstructured":"Kessler, D., Schiff, J.: Inclusion-exclusion redux. Electronic Communications in Probability\u00a07, 85\u201396 (2002)","journal-title":"Electronic Communications in Probability"},{"key":"30_CR8","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":"30_CR9","doi-asserted-by":"crossref","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 (2003) (to appear)","DOI":"10.1109\/TKDE.2003.1245281"},{"key":"30_CR10","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":"30_CR11","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":"30_CR12","volume-title":"Proceedings of the Eight International Conference on Knowledge Discovery and Data Mining (KDD 2002)","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 Eight International Conference on Knowledge Discovery and Data Mining (KDD 2002), ACM, New York (2002)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"1","author":"J. Hipp","year":"2000","unstructured":"Hipp, J., G\u00fcntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining \u2013 a general survey and comparison. SIGKDD Explorations\u00a01, 58\u201364 (2000)","journal-title":"SIGKDD Explorations"},{"key":"30_CR14","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. Bouli\u00e7aut","year":"2000","unstructured":"Bouli\u00e7aut, 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":"30_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.F. Bouli\u00e7aut","year":"2003","unstructured":"Bouli\u00e7aut, 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":"30_CR16","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":"30_CR17","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":"30_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-47887-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M., Gajek, M.: Concise representation of frequent patterns based on generalized disjunction-free generators. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"30_CR19","unstructured":"Mielik\u00e4inen, T.: Frequency-based views to pattern collections. In: IFIP\/SIAM Workshop on Discrete Mathematics and Data Mining (2003)"},{"key":"30_CR20","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":"30_CR21","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), Maebashi City, Japan, December 9-12, pp. 378\u2013385. IEEE Computer Society, Los Alamitos (2002)"},{"key":"30_CR22","unstructured":"Pei, J., Han, J., Mao, T.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Gunopulos, D., Rastogi, R. (eds.) ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with Titanic. Data & Knowledge Engineering\u00a042, 189\u2013222 (2002)","journal-title":"Data & Knowledge Engineering"},{"key":"30_CR24","series-title":"The Art of Computer Programming","volume-title":"Sorting and Seaching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Seaching, 2nd edn. The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045, 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"30_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms\u00a031, 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/0406021","volume":"6","author":"P. Helman","year":"1993","unstructured":"Helman, P., Moret, B.M.E., Shapiro, H.D.: An exact characterization of greedy structures. SIAM Journal on Discrete Mathematics\u00a06, 274\u2013283 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR28","volume-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D. Kempe","year":"2003","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York (2003)"},{"key":"30_CR29","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":"30_CR30","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39804-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:01:52Z","timestamp":1552608112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39804-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200857","9783540398042"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39804-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}