{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:04:00Z","timestamp":1760079840349},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147161"},{"type":"electronic","value":"9783319147178"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14717-8_1","type":"book-chapter","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T14:17:28Z","timestamp":1418825848000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["A New Improved Apriori Algorithm Based on Compression Matrix"],"prefix":"10.1007","author":[{"given":"Taoshen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","first-page":"207","volume-title":"Proceedings of the ACM SIGMOD Conference on Management of Date","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinaki, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Date, pp. 207\u2013216. ACM press, Washington, D.C (1993)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generations. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 1\u201312. ACM Press, Dallas (2000)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/223784.223813","volume-title":"Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data","author":"J.S. Park","year":"1995","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithms for mining association rules. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 175\u2013186. ACM Press, San Jose (1995)"},{"key":"1_CR4","first-page":"432","volume-title":"Proceedings of the 21st International Conference on Very Large Database","author":"A. Savasere","year":"1995","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association rules. In: Proceedings of the 21st International Conference on Very Large Database, pp. 432\u2013444. ACM Press, New York (1995)"},{"key":"1_CR5","unstructured":"Tovionen, H.: Sampling large databases for association rules. In: 22th International Conference on Very Large Database, Bombay, India, pp. 1\u201312 (1996)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253260.253325","volume-title":"1997 ACM SIGMOD Conference on Management of Data","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwan, R.I., Ullman, J.D., et al.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: 1997 ACM SIGMOD Conference on Management of Data, pp. 255\u2013264. ACM Press, New York (1997)"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 372\u2013390 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/BF02948845","volume":"15","author":"L.S. Huang","year":"2000","unstructured":"Huang, L.S., Chen, H.P., Wang, X., et al.: A Fast Algorithm for Mining Association Rules. Journal of Computer Science and Technology\u00a015(6), 619\u2013624 (2000)","journal-title":"Journal of Computer Science and Technology"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/11538059_39","volume-title":"Advances in Intelligent Computing","author":"Y. Yuan","year":"2005","unstructured":"Yuan, Y., Huang, T.: A Matrix Algorithm for Mining Association Rules. In: Huang, D.-S., Zhang, X.-P., Huang, G.-B. (eds.) ICIC 2005. LNCS, vol.\u00a03644, pp. 370\u2013379. Springer, Heidelberg (2005)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, Z.L., Liu, J., Zhang, J.: A Fast Algorithm for Mining association Rules Based on Boolean Matrix. In: 2008 International Conference on Wireless Communications, Networking and Mobile Computing, Dalian, China, pp. 1\u20133 (2008)","DOI":"10.1109\/WiCom.2008.2707"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Wand, F., Li, Y.H.: An improved Apriori algorithm based on the matix. In: 2008 International Seminar on Future BioMedical Information Engineering, Wuhan, China, pp. 152\u2013155 (2008)","DOI":"10.1109\/FBIE.2008.80"},{"key":"1_CR12","first-page":"1","volume-title":"2009 International Conference on Computational Intelligence and Software Engineering","author":"H.Z. Liu","year":"2009","unstructured":"Liu, H.Z., Dai, S.P., Jiang, H.: Quantitative association rules mining algorithm based on matrix. In: 2009 International Conference on Computational Intelligence and Software Engineering, pp. 1\u20134. IEEE Computer Society, Wuhan (2009)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/ITC.2010.8","volume-title":"2010 International Conference on Recent Trends in Information, Telecommunication and Computing","author":"N. Khare","year":"2010","unstructured":"Khare, N., Adlakha, N., Pardasani, K.R.: An Algorithm for Mining Multidimensional Association Rules using Boolean Matrix. In: 2010 International Conference on Recent Trends in Information, Telecommunication and Computing, pp. 95\u201399. IEEE Computer Society, Kochi (2010)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/ICICCI.2010.55","volume-title":"2010 International Conference on Intelligent Computing and Cognitive Informatics","author":"X.W. Luo","year":"2010","unstructured":"Luo, X.W., Wang, W.Q.: Improved Algorithms Research for Association Rule Based on Matrix. In: 2010 International Conference on Intelligent Computing and Cognitive Informatics, pp. 415\u2013419. IEEE Computer Society, Kuala Lumpur (2010)"},{"key":"1_CR15","first-page":"1128","volume-title":"11th IEEE Internatinal Conference on Data Mining","author":"P. Krajca","year":"2011","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Using frequent closed itemsets for data dimensionality reduction. In: 11th IEEE Internatinal Conference on Data Mining, pp. 1128\u20131133. Institute of Electrical and Electronics Engineers Inc, Vancouver (2011)"},{"key":"1_CR16","first-page":"1","volume-title":"19th International Conference on Geoinformatics","author":"J.M. Chen","year":"2011","unstructured":"Chen, J.M., Lin, G.F., Yang, Z.H.: Extracting spatial association rules from the maximum frequent itemsets based on Boolean matrix. In: 19th International Conference on Geoinformatics, pp. 1\u20135. IEEE Computer Society, Shanghai (2011)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/ChiCC.2014.6896674","volume-title":"33rd Chinese Control Conference","author":"Z.P. Zhou","year":"2014","unstructured":"Zhou, Z.P., Wang, J.F.: An improved matrix sorting index association rule data mining algorithm. In: 33rd Chinese Control Conference, pp. 500\u2013505. IEEE Computer Society, Nanjing (2014)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/ICICIS.2010.5534718","volume-title":"3rd International Conference on Information Sciences and Interaction Sciences","author":"X.Y. Yang","year":"2010","unstructured":"Yang, X.Y., Zhen, L., Fu, Y.: MapReduce as a programming model for association rules algorithm on Hadoop. In: 3rd International Conference on Information Sciences and Interaction Sciences, pp. 99\u2013102. IEEE Computer Society, Chengdu (2010)"},{"key":"1_CR19","first-page":"591","volume-title":"Fifth International Conference on Computational and Information Sciences","author":"Z.Q. Wang","year":"2013","unstructured":"Wang, Z.Q., Li, H.L.: Research of Massive Web Log Data Mining Based on Cloud Computing. In: Fifth International Conference on Computational and Information Sciences, pp. 591\u2013594. IEEE Computer Society, Shiyang (2013)"},{"key":"1_CR20","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: AAAI Workshop on Knowledge Discovery in Databases (KDD 1994), pp. 181\u2013192 (1994)"},{"key":"1_CR21","unstructured":"Liu, B.Z.: Improved appriori mining frequent items algorithm. Application Research of computation\u00a029(2), 475\u2013477 (2012) (in Chinese)"},{"key":"1_CR22","unstructured":"Li, R., Kang, L.Y., Geng, H.: New optimization association rule algorithm based on array. Science Technology and Engineering\u00a08(21), 5846\u20135849 (2008) (in Chinese)"},{"key":"1_CR23","unstructured":"Fu, S., Liao, M.H., Song, D.: An improved Appriori algorithm based on compression matrix approach. Microelectronics and Computer\u00a029(6), 28\u201332 (2010) (in Chinese)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14717-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:34:27Z","timestamp":1559093667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14717-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319147161","9783319147178"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14717-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}