{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:08:15Z","timestamp":1725487695372},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540733225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73325-6_68","type":"book-chapter","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T04:05:23Z","timestamp":1184645123000},"page":"685-695","source":"Crossref","is-referenced-by-count":0,"title":["Solving a Committee Formation and Scheduling Problem by Frequent Itemset Mining"],"prefix":"10.1007","author":[{"given":"Chienwen","family":"Wu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. EUR. J. OPER. RES.\u00a0112, 3\u201341 (1999)","journal-title":"EUR. J. OPER. RES."},{"key":"68_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"68_CR3","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":"68_CR4","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D. Burdick","year":"2005","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. IEEE T. KNOWL. DATA EN.\u00a017, 1490\u20131504 (2005)","journal-title":"IEEE T. KNOWL. DATA EN."},{"key":"68_CR5","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":"68_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/276304.276307","volume-title":"Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data","author":"R. Ng","year":"1998","unstructured":"Ng, R., Lakshmanan, L., Han, J.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, USA, pp. 13\u201324. ACM Press, New York (1998)"},{"key":"68_CR7","first-page":"59","volume":"2838","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated Data Reduction in Constrained Pattern Mining. LECT. NOTES ARTIF. INT.\u00a02838, 59\u201370 (2003)","journal-title":"LECT. NOTES ARTIF. INT."}],"container-title":["Lecture Notes in Computer Science","New Trends in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73325-6_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:13:47Z","timestamp":1605762827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73325-6_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733225"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73325-6_68","relation":{},"subject":[]}}