{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:28Z","timestamp":1760707888293},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77018-3_43","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T07:46:39Z","timestamp":1196063199000},"page":"433-444","source":"Crossref","is-referenced-by-count":35,"title":["Two-Phase Algorithms for a Novel Utility-Frequent Mining Model"],"prefix":"10.1007","author":[{"given":"Jieh-Shan","family":"Yeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Chiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R.C. Agarwal","year":"2001","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing\u00a061(3), 350\u2013371 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., USA, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"43_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"issue":"2","key":"43_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1022419032620","volume":"7","author":"B. Barber","year":"2003","unstructured":"Barber, B., Hamilton, H.J.: Extracting share frequent itemsets with infrequent subsets. Data Mining and Knowledge Discovery\u00a07(2), 153\u2013185 (2003)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"43_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0169-023X(00)00055-0","volume":"37","author":"F. Berzal","year":"2001","unstructured":"Berzal, F., Cubero, J.C., Mar\u00edn, N., Serrano, J.M.: Tbar: An efficient method for association rule mining in relational databases. Data and Knowledge Engineering\u00a037(1), 47\u201364 (2001)","journal-title":"Data and Knowledge Engineering"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Peckham, J. (ed.) Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 255\u2013264 (1997)","DOI":"10.1145\/253260.253325"},{"issue":"2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1093\/comjnl\/bxh074","volume":"48","author":"C.C. Chang","year":"2005","unstructured":"Chang, C.C., Lin, C.Y.: Perfect hashing schemes for mining association rules. The Computer Journal\u00a048(2), 168\u2013179 (2005)","journal-title":"The Computer Journal"},{"issue":"10","key":"43_CR8","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G. Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using fp-trees. IEEE Transactions on Knowledge and Data Engineering\u00a017(10), 1347\u20131362 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"43_CR9","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 pattern without candidate generation: A frequent pattern tree approach. Data Mining and Knowledge Discovery\u00a08(1), 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"43_CR10","unstructured":"IBM. Synthetic data generation code for associations and sequential patterns (accessed Jan. 2007), \n                      \n                        http:\/\/www.almaden.ibm.com\/cs\/projects\/iis\/hdb\/Projects\/data_mining\/mining.shtml"},{"key":"43_CR11","series-title":"Lecture Notes in Artificial Intelligence","first-page":"551","volume-title":"Fuzzy Systems and Knowledge Discovery","author":"Y.C. Li","year":"2005","unstructured":"Li, Y.C., Yeh, J.S., Chang, C.C.: Direct candidates generation: A novel algorithm for discovering complete share-frequent itemsets. In: Wang, L., Jin, Y. (eds.) FSKD 2005. LNCS (LNAI), vol.\u00a03614, pp. 551\u2013560. Springer, Heidelberg (2005)"},{"key":"43_CR12","unstructured":"Li, Y.C., Yeh, J.S., Chang, C.C.: Efficient algorithms for mining share-frequent itemsets. In: Fuzzy Logic, Soft Computing and Computational Intelligence - 11th World Congress of International Fuzzy Systems Association (IFSA 2005), pp. 534\u2013539 (2005)"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","first-page":"417","volume-title":"Web Technologies Research and Development - APWeb 2005","author":"Y.C. Li","year":"2005","unstructured":"Li, Y.C., Yeh, J.S., Chang, C.C.: A fast algorithm for mining share-frequent itemsets. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds.) APWeb 2005. LNCS, vol.\u00a03399, pp. 417\u2013428. Springer, Heidelberg (2005)"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportunistic projection. In: Proceedings of the 8th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 229\u2013238 (2002)","DOI":"10.1145\/775047.775081"},{"key":"43_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Liao, W.-K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 689\u2013695. Springer, Heidelberg (2005)"},{"key":"43_CR16","unstructured":"Yao, H., Hamilton, H.J., Geng, L.: A unified framework for utility based measures for mining itemsets. In: Proceedings of ACM SIGKDD 2nd Workshop on Utility-Based Data Mining, pp. 28\u201337 (2006)"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: Proceedings of the 4th SIAM International Conference on Data Mining, pp. 428\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"}],"container-title":["Lecture Notes in Computer Science","Emerging Technologies in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77018-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:53:40Z","timestamp":1619520820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77018-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770169"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77018-3_43","relation":{},"subject":[]}}