{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T17:40:01Z","timestamp":1748799601669,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493809"},{"type":"electronic","value":"9783662493816"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49381-6_51","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:24:06Z","timestamp":1457375046000},"page":"532-543","source":"Crossref","is-referenced-by-count":0,"title":["Treap Mining \u2013 A Comparison with Traditional Algorithm"],"prefix":"10.1007","author":[{"given":"H. S.","family":"Anand","sequence":"first","affiliation":[]},{"given":"S. S.","family":"Vinodchandra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Boney, L., Tewfik, A.H., Hamdy, K.N.: Minimum association rule in large database. In: Proceedings of the Third IEEE International Conference on Computing, pp. 12\u201316 (2006)","key":"51_CR1"},{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB, pp. 487\u2013499 (1994)","key":"51_CR2"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., Li. W.: New algorithms for fast discovery of association rules. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, vol. 2, pp. 283\u2013296 (1997)","key":"51_CR3","DOI":"10.1007\/978-1-4615-5669-5_1"},{"unstructured":"Anandhavalli, G.K.: Association rule mining in genomics. Int. J. Comput. Theory Eng. 1 (2007)","key":"51_CR4"},{"key":"51_CR5","first-page":"398","volume":"9","author":"C Cooper","year":"2007","unstructured":"Cooper, C., Zito, M.: Realistic synthetic data for testing association rule mining algorithms for market basket databases. Knowl. Disc. Databases PKDD 9, 398\u2013405 (2007)","journal-title":"Knowl. Disc. Databases PKDD"},{"key":"51_CR6","first-page":"116","volume":"8","author":"AS Varde","year":"2004","unstructured":"Varde, A.S., Takahashi, M., Rundensteiner, E.A., Ward, M.O., Maniruzzaman, M., Sisson, R.D.: Apriori algorithm and game of life for predictive analysis in materials science. Int. J. Knowl. Based Intell. Eng. Syst. 8, 116\u2013122 (2004)","journal-title":"Int. J. Knowl. Based Intell. Eng. Syst."},{"doi-asserted-by":"crossref","unstructured":"Wu, H., Lu, Z., Pan, L., Xu, R., Jiang, W.: An improved apriori based algorithm for association rules mining. In: Proceedings of Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp. 51\u201355 (2009)","key":"51_CR7","DOI":"10.1109\/FSKD.2009.193"},{"unstructured":"Bodon, F.: A fast apriori implementation. In: Proceedings of the IEEE ICDM Workshop on Frequent Item-set Mining Implementation, vol. 9 (2003)","key":"51_CR8"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-7908-1840-6_12","volume":"56","author":"M Kryszkiewicz","year":"2000","unstructured":"Kryszkiewicz, M., Rybi\u00f1ski, H.: Data mining in incomplete information systems from rough set perspective. Rough Set Methods Appl. 56, 567\u2013580 (2000)","journal-title":"Rough Set Methods Appl."},{"key":"51_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-48412-4_4","volume-title":"Advances in Intelligent Data Analysis","author":"AW Kosters","year":"1999","unstructured":"Kosters, A.W., Marchiori, E., Oerlemans, A.J.: Mining clusters with association rules. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds.) IDA 1999. LNCS, vol. 1642, pp. 39\u201350. Springer, Heidelberg (1999)"},{"unstructured":"Lin, T.Y.: Rough set theory in very large databases. In: Symposium on Modeling, Analysis and Simulation, vol. 2, pp. 936\u2013941 (1996)","key":"51_CR11"},{"doi-asserted-by":"crossref","unstructured":"Borgelt, C.: An implementation of FP growth algorithm. In: Proceedings of the Workshop on Open ource Mining Software ACM (2005)","key":"51_CR12","DOI":"10.1145\/1133905.1133907"},{"key":"51_CR13","first-page":"54","volume":"12","author":"K Malik","year":"2011","unstructured":"Malik, K., Raheja, N., Garg, P.: Enhance FP growth algorithm. Int. J. Comput. Eng. Manage. 12, 54\u201356 (2011)","journal-title":"Int. J. Comput. Eng. Manage."},{"doi-asserted-by":"crossref","unstructured":"Guy, E.B., Margaret, R.M.: Fast set operations using treaps. In: Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 16\u201326 (1998)","key":"51_CR14","DOI":"10.1145\/277651.277660"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/s004539900061","volume":"16","author":"R Aragon Cecilia","year":"1996","unstructured":"Aragon Cecilia, R., Aragon, C.: Randomized search trees. Algorithmica 16, 464\u2013497 (1996)","journal-title":"Algorithmica"},{"key":"51_CR16","first-page":"270","volume":"38","author":"A Jane","year":"2005","unstructured":"Jane, A., Ross, A.: Score normalization in multimodal biometrics systems. Pattern Recogn. 38, 270\u2013285 (2005)","journal-title":"Pattern Recogn."},{"unstructured":"Ben Khalifa, A., Gazzah, S.: Adaptive score normalization: a novel approach for multimodal biometric systems. Int. J. Comput. Electr. Autom. Control Inf. Eng. 7(3) (2013)","key":"51_CR17"},{"key":"51_CR18","isbn-type":"print","volume-title":"Artificial Intelligence and Machine Learning","author":"SS Vinodchandra","year":"2014","unstructured":"Vinodchandra, S.S., Anand, H.S.: Artificial Intelligence and Machine Learning. PHI Publishers, Delhi (2014). 368p. ISBN ISBN: 978-81-203-4934-6","ISBN":"https:\/\/id.crossref.org\/isbn\/9788120349346"},{"key":"51_CR19","first-page":"239","volume":"9","author":"HS Anand","year":"2014","unstructured":"Anand, H.S., Vinodchandra, S.S.: Mining association rules using improved frequent-pattern growth algorithm. Int. J. Appl. Eng. Res. 9, 239\u2013246 (2014). (ISSN: 0973-4562)","journal-title":"Int. J. Appl. Eng. Res."},{"unstructured":"Anand, H.S., Vinodchandra, S.S.: Horizontal and vertical rule mining algorithms. In: ACCIS, Proceedings of Elsevier, pp. 26\u201328 (2014)","key":"51_CR20"},{"doi-asserted-by":"crossref","unstructured":"Anand, H.S., Vinodchandra, S.S.: Applying correlation threshold on apriori algorithm. In: IEEE ICE-CCN (2013)","key":"51_CR21","DOI":"10.1109\/ICE-CCN.2013.6528537"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49381-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T17:27:17Z","timestamp":1748798837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49381-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493809","9783662493816"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49381-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}