{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:09:51Z","timestamp":1743026991392,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789814585170"},{"type":"electronic","value":"9789814585187"}],"license":[{"start":{"date-parts":[[2013,12,15]],"date-time":"2013-12-15T00:00:00Z","timestamp":1387065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,15]],"date-time":"2013-12-15T00:00:00Z","timestamp":1387065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-981-4585-18-7_19","type":"book-chapter","created":{"date-parts":[[2013,12,14]],"date-time":"2013-12-14T06:28:37Z","timestamp":1387002517000},"page":"159-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining Indirect Least Association Rule"],"prefix":"10.1007","author":[{"given":"Zailani","family":"Abdullah","sequence":"first","affiliation":[]},{"given":"Tutut","family":"Herawan","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"Mat Deris","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,15]]},"reference":[{"key":"19_CR1","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P.: From Data Mining to Knowledge Discovery in Databases. Advances in Knowledge Discovery and Data Mining. American Association for Artificial Intelligence, Menlo Park, USA (1996)"},{"key":"19_CR2","unstructured":"Agrawal, R., & Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases.: In Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487-499 (1994)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Mannila, H., Toivonen, H., and Verkamo, A.I.: Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery, 1, 259\u2013289 (1997)","DOI":"10.1023\/A:1009748302351"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., and Yu, P.S.: An Effective Hash-based Algorithm for Mining Association Rules. In: Proceedings of the ACM-SIGMOD Intl. Conf. Management of Data (SIGMOD\u201995), pp. 175\u2013186. ACM Press (1995)","DOI":"10.1145\/568271.223813"},{"key":"19_CR5","unstructured":"Savasere, A., Omiecinski, E., and Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proceedings of the 21st Intl. Conf. on Very Large Data Bases (VLDB\u201995), pp. 432\u2013443. ACM Press (1995)"},{"key":"19_CR6","unstructured":"Fayyad, U., Patesesky-Shapiro, G., Smyth, P. and Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. MIT Press, MA (1996)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently Mining Long Patterns from Databases. In: Proceedings of the ACM-SIGMOD International Conference on Management of Data (SIGMOD\u201998), pp. 85\u201393. ACM Press (1998)","DOI":"10.1145\/276305.276313"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. and Hsiao, C.J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proceedings of the 2002 SIAM Intl. Conf. Data Mining, pp. 457\u2013473. SIAM (2002).","DOI":"10.1137\/1.9781611972726.27"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R. Agarwal","year":"2001","unstructured":"Agarwal, R., Aggarwal, C., and Prasad, V.V.V.: A Tree Projection Algorithm for generation of Frequent Itemsets. Journal of Parallel and Distributed Computing 61, 350\u2013371 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W. and Ma, Y.: Mining Association Rules with Multiple Minimum Support. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 337\u2013341. ACM Press (1999)","DOI":"10.1145\/312129.312274"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T. and Deris, M.M.: Scalable Model for Mining Critical Least Association Rules. In Rongbo Zhu et al. ICICA 2010, LNCS 6377, pp. 509-516. Springer Heidelberg (2010)","DOI":"10.1007\/978-3-642-16167-4_65"},{"issue":"7","key":"19_CR12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.knosys.2008.03.012","volume":"21","author":"C.W. Leung","year":"2008","unstructured":"Leung, C.W., Chan S.C and Chung, F.: An Empirical Study of a Cross-level Association Rule Mining Approach to Cold-start Recommendations. Knowledge-Based Systems, 21(7), October 2008, 515\u2013529 (2008)","journal-title":"Knowledge-Based Systems"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Tan, P.N., Kumar, V. and Srivastava, J.: Indirect Association: Mining Higher Order Dependences in Data. In: Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 632-637. Springer Heidelberg (2000)","DOI":"10.1007\/3-540-45372-5_77"},{"issue":"2","key":"19_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10844-006-2618-8","volume":"27","author":"Q Wan","year":"2006","unstructured":"Wan, Q. and An, A.: An Efficient Approach to Mining Indirect Associations. Journal Intelligent Information Systems, 27(2), 135\u2013158 (2006)","journal-title":"Journal Intelligent Information Systems"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Kazienko, P.: Mining Indirect Association Rules for Web Recommendation. International Journal of Applied Mathematics and Computer Science, 19(1), 165\u2013186 (2009)","DOI":"10.2478\/v10006-009-0015-5"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Tsuruoka, Y., Miwa, M., Hamamoto, K., Tsujii, J. and Ananiadou, S.: Discovering and Visualizing Indirect Associations between Biomedical Concepts. Bioinformatics, 27(13), 111-119 (2011).","DOI":"10.1093\/bioinformatics\/btr214"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Chen, L., Bhowmick, S.S. and Li, J.: Mining Temporal Indirect Associations. In: PAKDD2006, LNAI 3918, pp. 425-434. Springer Heidelberg (2006)","DOI":"10.1007\/11731139_49"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Cornelis, C., Yan, P., Zhang, X. and Chen, G.: Mining Positive and Negative Association from Large Databases. In: Proceedings of the 2006 IEEE International Conference on Cybernetics and Intelligent systems, pp. 1-6. IEEE (2006)","DOI":"10.1109\/ICCIS.2006.252251"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Kazienko, P. and Kuzminska, K.: The Influence of Indirect Association Rules on Recommendation Ranking Lists. In: Proceeding of the 5th Intl. Conf. on Intelligent Systems Design and Applications, pp. 482-487 (2005)","DOI":"10.1109\/ISDA.2005.90"},{"key":"19_CR20","unstructured":"Tseng, V.S, Liu, Y.C and Shin J.W.: Mining Gene Expression Data with Indirect Association Rules. In Proceeding of the 2007 National Computer Symposium (2007)"},{"issue":"3","key":"19_CR21","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X. Wu","year":"2004","unstructured":"Wu, X., Zhang, C. and Zhang, S. Efficient Mining of Positive and Negative Association Rules. ACM Transaction on Information Systems, 22(3), 381-405 (2004)","journal-title":"ACM Transaction on Information Systems"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T., Noraziah, A. and Deris, M.M.: Mining Significant Association Rules from Educational Data using Critical Relative Support Approach. Procedia Social and Behavioral Sciences, 2011, 28, 97\u2013191. Elsevier (2011)","DOI":"10.1016\/j.sbspro.2011.11.020"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., and Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proceedings of the International ACM SIGMOD Conference, pp. 255\u2013264. ACM Press (1997)","DOI":"10.1145\/253262.253325"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Tan, P., Kumar, V., and Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proceedings of the 8th Intl. Conf. on Knowledge Discovery and Data Mining, pp. 32-41. (2002)","DOI":"10.1145\/775047.775053"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Lin, W-Y., Wei, Y-E., and Chen, C-H. Generic Approach for Mining Indirect Association Rules in Data Streams. LNCS 6703, pp. 95-104. Springer Heidelberg. (2011).","DOI":"10.1007\/978-3-642-21822-4_11"},{"key":"19_CR26","unstructured":"UCI Machine Learning Repository, http:\/\/archive.ics.uci.edu\/ml\/datasets\/"},{"issue":"2","key":"19_CR27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.4018\/jkss.2012040102","volume":"3","author":"T. Herawan","year":"2012","unstructured":"Herawan, T., Vitasari, P., and Abdullah, Z.: Mining Interesting Association Rules of Students Suffering Study Anxieties Using SLP-Growth Algorithm. International Journal of Knowledge and Systems Sciences, 3(2), 24-41 (2012)","journal-title":"International Journal of Knowledge and Systems Sciences"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T. Noraziah, A. and Deris, M.M.: Detecting Critical Least Association Rules in Medical Databases. International Journal of Modern Physics: Conference Series, World Scientific, 9, 464\u2013479 (2012)","DOI":"10.1142\/S2010194512005557"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Herawan, T. and Abdullah, Z.: CNAR-M: A Model for Mining Critical Negative Association Rules. In Zhihua Cai et al. (Eds): ISICA 2012, CCIS, 316, pp. 170\u2013179. Springer Heidelberg (2012)","DOI":"10.1007\/978-3-642-34289-9_20"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T. Noraziah, A. and Deris, M.M and Abawajy, J.H.: IPMA: Indirect Patterns Mining Algorithm. In N.T. Nguyen et al. (Eds.): ICCCI 2012, AMCCISC, 457, pp. 187\u2013196. Springer Heidelberg (2012)","DOI":"10.1007\/978-3-642-34300-1_18"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Herawan, T., P. Vitasari, and Abdullah, Z.: Mining Interesting Association Rules of Student Suffering Mathematics Anxiety. In J.M. Zain et al. (Eds.): ICSECS 2011, CCIS, vol. 188, II, pp. 495\u2013508. Springer Heidelberg (2011)","DOI":"10.1007\/978-3-642-22191-0_43"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T. and Deris, M.M.: Efficient and Scalable Model for Mining Critical Least Association Rules. In a special issue from AST\/UCMA\/ISA\/ACN 2010, Journal of The Chinese Institute of Engineer, Taylor and Francis, 35, No. 4, 27 June 2012, 547\u2013554 (2012)","DOI":"10.1080\/02533839.2012.679064"},{"key":"19_CR33","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.sbspro.2011.11.022","volume":"28","author":"Z. Abdullah","year":"2011","unstructured":"Abdullah, Z., Herawan, T. Noraziah, A. and Deris, M.M.: Extracting Highly Positive Association Rules from Students\u2019 Enrollment Data. Procedia Social and Behavioral Sciences, 28, 107\u2013111 (2011)","journal-title":"Procedia Social and Behavioral Sciences"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Abdullah, Z., Herawan, T. Noraziah, A. and Deris, M.M.: Mining Significant Association Rules from Educational Data using Critical Relative Support Approach. Procedia Social and Behavioral Sciences, 28, 97\u2013101 (2011)","DOI":"10.1016\/j.sbspro.2011.11.020"},{"key":"19_CR35","unstructured":"Abdullah, Z., Herawan, T. and Deris, M.M.: An Alternative Measure for Mining Weighted Least Association Rule and Its Framework. In J.M. Zain et al. (Eds.): ICSECS 2011, CCIS, vol. 188, II, pp. 475\u2013485. Springer Heidelberg (2011)"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Lin, W-Y., and Chen, Y-C.: A Mediator Exploiting Approach for Mining Indirect Associations from Web Data Streams. IEEE Xplore in the 2nd Intl. Conf. on Innovations in Bio-inspired Computing and Applications (IBICA) 2011, pp. 183-186 (2011)","DOI":"10.1109\/IBICA.2011.50"},{"issue":"10","key":"19_CR37","first-page":"6041","volume":"7","author":"Y-C. Liu","year":"2011","unstructured":"Liu, Y-C., Shin, J.W., and Tseng, V.S.: Discovering Indirect Gene Associations by Filtering-Based Indirect Association Rule Mining, International Journal of Innovative Computing, Information and Control, 7(10), 6041\u20136053 (2011)","journal-title":"International Journal of Innovative Computing, Information and Control"}],"container-title":["Lecture Notes in Electrical Engineering","Proceedings of the First International Conference on Advanced Data and Information Engineering (DaEng-2013)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-4585-18-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T06:34:50Z","timestamp":1674887690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-4585-18-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,15]]},"ISBN":["9789814585170","9789814585187"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-4585-18-7_19","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2013,12,15]]},"assertion":[{"value":"15 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}