{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:04:45Z","timestamp":1723014285625},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"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":["J Intell Inf Syst"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10844-022-00750-4","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T07:02:42Z","timestamp":1666076562000},"page":"191-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient approximate top-k mutual information based feature selection"],"prefix":"10.1007","volume":"61","author":[{"given":"Md Abdus","family":"Salam","sequence":"first","affiliation":[]},{"given":"Senjuti","family":"Basu Roy","sequence":"additional","affiliation":[]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"750_CR1","volume-title":"Modern information retrieval, Vol. 463","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., & et al. (1999). Modern information retrieval Vol. 463. New York: ACM Press."},{"issue":"2","key":"750_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1137\/S1052623498348481","volume":"11","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., & Pferschy, U. (2000). The multiple subset sum problem. SIAM Journal on Optimization, 11 (2), 308\u2013319. https:\/\/doi.org\/10.1137\/s1052623498348481.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"750_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar, G., & Sahin, F. (2014). A survey on feature selection methods. Computers & Electrical Engineering, 40(1), 16\u201328. https:\/\/doi.org\/10.1016\/j.compeleceng.2013.11.024.","journal-title":"Computers & Electrical Engineering"},{"key":"750_CR4","doi-asserted-by":"publisher","unstructured":"Chen, X., & Wang, S. (2021). Efficient approximate algorithms for empirical entropy and mutual information. In Proceedings of the 2021 International Conference on Management of Data, pp 274\u2013286. https:\/\/doi.org\/10.1145\/3448016.3457255.","DOI":"10.1145\/3448016.3457255"},{"key":"750_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., & Thomas, J.A. (1991). Elements of information theory. USA: Wiley. https:\/\/doi.org\/10.1002\/0471200611."},{"key":"750_CR6","doi-asserted-by":"publisher","unstructured":"Dalkilic, M.M., & Roberston, E.L. (2000). Information dependencies. In Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. https:\/\/doi.org\/10.1145\/335168.336059 (pp. 245\u2013253).","DOI":"10.1145\/335168.336059"},{"key":"750_CR7","unstructured":"Dua, D., & Graff, C. (2017). Uci machine learning repository. http:\/\/archive.ics.uci.edu\/ml."},{"key":"750_CR8","volume-title":"Fundamentals of database systems","author":"R Elmasri","year":"2011","unstructured":"Elmasri, R., & Navathe, S.B. (2011). Fundamentals of database systems. USA: Pearson Education Boston."},{"key":"750_CR9","volume-title":"Computers and intractability a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and intractability a guide to the theory of NP-completeness. W.H Freeman and Company: New York."},{"issue":"6","key":"750_CR10","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.is.2003.10.006","volume":"29","author":"C Giannella","year":"2004","unstructured":"Giannella, C., & Robertson, E. (2004). On approximation measures for functional dependencies. Information Systems, 29(6), 483\u2013507. https:\/\/doi.org\/10.1016\/j.is.2003.10.006.","journal-title":"Information Systems"},{"issue":"Mar","key":"750_CR11","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., & Elisseeff, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3(Mar), 1157\u20131182.","journal-title":"Journal of Machine Learning Research"},{"key":"750_CR12","volume-title":"Data mining: Concepts and techniques","author":"J Han","year":"2011","unstructured":"Han, J., Pei, J., & Kamber, M. (2011). Data mining: Concepts and techniques. USA: Elsevier."},{"issue":"14","key":"750_CR13","doi-asserted-by":"publisher","first-page":"6371","DOI":"10.1016\/j.eswa.2014.04.019","volume":"41","author":"N Hoque","year":"2014","unstructured":"Hoque, N., Bhattacharyya, D.K., & Kalita, J.K. (2014). Mifs-nd: a mutual information-based feature selection method. Expert Systems with Applications, 41(14), 6371\u20136385. https:\/\/doi.org\/10.1016\/j.eswa.2014.04.019.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"750_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y Huhtala","year":"1999","unstructured":"Huhtala, Y., K\u00e4rkk\u00e4inen, J., Porkka, P., & et al. (1999). Tane: an efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2), 100\u2013111. https:\/\/doi.org\/10.1093\/comjnl\/42.2.100.","journal-title":"The Computer Journal"},{"key":"750_CR15","doi-asserted-by":"publisher","unstructured":"Jovi\u0107, A, Brki\u0107, K, & Bogunovi\u0107, N. (2015). A review of feature selection methods with applications. In 2015 38Th international convention on information and communication technology, electronics and microelectronics (MIPRO). https:\/\/doi.org\/10.1109\/mipro.2015.7160458 (pp. 1200\u20131205). IEEE.","DOI":"10.1109\/mipro.2015.7160458"},{"issue":"1","key":"750_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J Kivinen","year":"1995","unstructured":"Kivinen, J., & Mannila, H. (1995). Approximate inference of functional dependencies from relations. Theoretical Computer Science, 149(1), 129\u2013149. https:\/\/doi.org\/10.1016\/0304-3975(95)00028-u.","journal-title":"Theoretical Computer Science"},{"key":"750_CR17","doi-asserted-by":"publisher","unstructured":"Lee, T.T. (1987). An information-theoretic analysis of relational databases\u2013 part i: Data dependencies and information metric. IEEE Transactions on Software Engineering (10):1049\u20131061. https:\/\/doi.org\/10.1109\/tse.1987.232847.","DOI":"10.1109\/tse.1987.232847"},{"issue":"5-6","key":"750_CR18","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/BF01025996","volume":"60","author":"W Li","year":"1990","unstructured":"Li, W. (1990). Mutual information functions versus correlation functions. Journal of Statistical Physics, 60(5-6), 823\u2013837. https:\/\/doi.org\/10.1007\/bf01025996.","journal-title":"Journal of Statistical Physics"},{"issue":"2","key":"750_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TKDE.2010.197","volume":"24","author":"J Liu","year":"2010","unstructured":"Liu, J., Li, J., Liu, C., & et al (2010). Discover dependencies from data \u2013 a review. IEEE Transactions on Knowledge and Data Engineering, 24(2), 251\u2013264. https:\/\/doi.org\/10.1109\/tkde.2010.197.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"750_CR20","doi-asserted-by":"publisher","unstructured":"Lopes, S., Petit, J.M., & Lakhal, L. (2000). Efficient discovery of functional dependencies and armstrong relations. In International Conference on Extending Database Technology. https:\/\/doi.org\/10.1007\/3-540-46439-5_24 (pp. 350\u2013364). Springer.","DOI":"10.1007\/3-540-46439-5_24"},{"issue":"11","key":"750_CR21","doi-asserted-by":"publisher","first-page":"4223","DOI":"10.1007\/s10115-020-01494-9","volume":"62","author":"P Mandros","year":"2020","unstructured":"Mandros, P., Boley, M., & Vreeken, J. (2020). Discovering dependencies with reliable mutual information. Knowledge and Information Systems, 62(11), 4223\u20134253. https:\/\/doi.org\/10.1007\/s10115-020-01494-9.","journal-title":"Knowledge and Information Systems"},{"key":"750_CR22","doi-asserted-by":"publisher","DOI":"10.4135\/9781412985116","volume-title":"Monte carlo simulation 116","author":"CZ Mooney","year":"1997","unstructured":"Mooney, C.Z. (1997). Monte carlo simulation 116. USA: Sage. https:\/\/doi.org\/10.4135\/9781412985116."},{"issue":"7","key":"750_CR23","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0306-4379(01)00032-1","volume":"26","author":"N Novelli","year":"2001","unstructured":"Novelli, N., & Cicchetti, R. (2001). Functional and embedded dependency inference: a data mining point of view. Information Systems, 26(7), 477\u2013506. https:\/\/doi.org\/10.1016\/s0306-4379(01)00032-1.","journal-title":"Information Systems"},{"key":"750_CR24","doi-asserted-by":"publisher","unstructured":"Salam, M.A., Koone, M.E., Thirumuruganathan, S., & et al (2019). A human-in-the-loop attribute design framework for classification. In The World Wide Web Conference. https:\/\/doi.org\/10.1145\/3308558.3313547 (pp. 1612\u20131622).","DOI":"10.1145\/3308558.3313547"},{"issue":"1","key":"750_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00521-013-1368-0","volume":"24","author":"JR Vergara","year":"2014","unstructured":"Vergara, J.R., & Est\u00e9vez, P.A. (2014). A review of feature selection methods based on mutual information. Neural Computing and Applications, 24(1), 175\u2013186. https:\/\/doi.org\/10.1007\/s00521-013-1368-0.","journal-title":"Neural Computing and Applications"},{"key":"750_CR26","doi-asserted-by":"publisher","unstructured":"Wang, C., & Ding, B. (2019). Fast approximation of empirical entropy via subsampling. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. https:\/\/doi.org\/10.1145\/3292500.3330938 (pp. 658\u2013667).","DOI":"10.1145\/3292500.3330938"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-022-00750-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-022-00750-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-022-00750-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T08:09:30Z","timestamp":1694506170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-022-00750-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["750"],"URL":"https:\/\/doi.org\/10.1007\/s10844-022-00750-4","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,18]]},"assertion":[{"value":"28 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}