{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:49:25Z","timestamp":1725544165622},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332060"},{"type":"electronic","value":"9783540332077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11731139_50","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T04:03:44Z","timestamp":1141877024000},"page":"435-439","source":"Crossref","is-referenced-by-count":3,"title":["Mining Top-K Frequent Closed Itemsets Is Not in APX"],"prefix":"10.1007","author":[{"given":"Chienwen","family":"Wu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE T. Knowl. Data En.\u00a017, 652\u2013664 (2005)","journal-title":"IEEE T. Knowl. Data En."},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Min. Knowl. Disc.\u00a08, 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"50_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.: Discovering All Most Specific Sentences. ACM T. on Database Syst.\u00a028, 140\u2013174 (2003)","journal-title":"ACM T. on Database Syst."},{"key":"50_CR4","unstructured":"Zaki, M., Ogihara, M.: Theoretical foundations of association rules. In: Proceedings of Third SIGMOD 1998 Workshop on Research Issues in Data Mining and Knowledge Discovery, Seattle, USA, pp. 71\u201378 (1998)"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2003.12.017","volume":"314","author":"F. Angiulli","year":"2004","unstructured":"Angiulli, F., Ianni, G., Palopoli, L.: On the Complexity of Inducing Categorical and Quantitative Association Rules. Theor. Comput. Sci.\u00a0314, 217\u2013249 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.is.2003.08.004","volume":"30","author":"C. Jermaine","year":"2005","unstructured":"Jermaine, C.: Finding the Most Interesting Correlations in a Database: How Hard Can it Be? Inform. Syst.\u00a030, 21\u201346 (2005)","journal-title":"Inform. Syst."},{"key":"50_CR7","doi-asserted-by":"publisher","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., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"}],"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\/11731139_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:51Z","timestamp":1619506311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11731139_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332060","9783540332077"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11731139_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}