{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:04Z","timestamp":1760597644392},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T00:00:00Z","timestamp":1424563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10115-015-0824-9","type":"journal-article","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T01:58:55Z","timestamp":1424483935000},"page":"599-628","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The logic transformations for reducing the complexity of the discernibility function-based attribute reduction problem"],"prefix":"10.1007","volume":"46","author":[{"given":"Mehmet","family":"Hacibeyoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Shukri","family":"Salman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Selek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sirzat","family":"Kahramanli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"key":"824_CR1","volume-title":"Rough-fuzzy hybridization: rough sets: a tutorial. A new trend in decision making","author":"J Komorowski","year":"1999","unstructured":"Komorowski J, Pawlak Z, Polkowski L, Skowron A (1999) Rough-fuzzy hybridization: rough sets: a tutorial. A new trend in decision making. Springer, Berlin"},{"issue":"4","key":"824_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.patrec.2006.09.003","volume":"28","author":"XY Wang","year":"2007","unstructured":"Wang XY, Yang J, Teng XL, Xia WJ, Jensen R (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recogn Lett 28(4):459\u2013471","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"824_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2006.04.001","volume":"33","author":"WQ Shang","year":"2007","unstructured":"Shang WQ, Huang HK, Zhu HB, Lin YM, Qu YL, Wang ZH (2007) A novel feature selection algorithm for text categorization. Expert Syst Appl 33(1):1\u20135","journal-title":"Expert Syst Appl"},{"issue":"12B","key":"824_CR4","first-page":"4885","volume":"5","author":"Y Matsumoto","year":"2009","unstructured":"Matsumoto Y, Watada J (2009) Knowledge acquisition from time series data through rough sets analysis. Int J Innov Comput Inf Control 5(12B):4885\u20134897","journal-title":"Int J Innov Comput Inf Control"},{"issue":"3","key":"824_CR5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TKDE.2010.263","volume":"24","author":"K Javed","year":"2012","unstructured":"Javed K, Babri HA, Saeed M (2012) Feature selection based on class-dependent densities for high-dimensional binary data. IEEE Trans Knowl Data Eng 24(3):465\u2013477","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"824_CR6","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1109\/TKDE.2011.92","volume":"24","author":"SH Yang","year":"2012","unstructured":"Yang SH, Hu BG (2012) Discriminative feature selection by nonparametric Bayes error minimization. IEEE Trans Knowl Data Eng 24(8):1422\u20131434","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"824_CR7","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/TKDE.2011.222","volume":"25","author":"Z Zhao","year":"2013","unstructured":"Zhao Z, Wang L, Liu H, Ye JP (2013) On similarity preserving feature selection. IEEE Trans Knowl Data Eng 25(3):619\u2013632","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"824_CR8","doi-asserted-by":"crossref","unstructured":"Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. ICS PAS Report 1\/91, Technical University of Warsaw, pp 1\u201344","DOI":"10.1007\/978-94-015-7975-9_21"},{"issue":"6","key":"824_CR9","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TKDE.2009.124","volume":"22","author":"P Maji","year":"2010","unstructured":"Maji P, Pal SK (2010) Feature selection using f-information measures in fuzzy approximation spaces. IEEE Trans Knowl Data Eng 22(6):854\u2013867","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"824_CR10","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/TKDE.2004.96","volume":"16","author":"R Jensen","year":"2004","unstructured":"Jensen R, Shen Q (2004) Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Trans Knowl Data Eng 16(12):1457\u20131471","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"824_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2008.05.006","volume":"9","author":"K Thangavel","year":"2009","unstructured":"Thangavel K, Pethalakshmi A (2009) Dimensionality reduction based on rough set theory: a review. Appl Soft Comput 9(1):1\u201312","journal-title":"Appl Soft Comput"},{"issue":"3","key":"824_CR12","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TKDE.2011.260","volume":"25","author":"BJ Gao","year":"2013","unstructured":"Gao BJ, Ester M, Xiong H, Cai JY, Schulte O (2013) The minimum consistent subset cover problem: a minimization view of data mining. IEEE Trans Knowl Data Eng 25(3):690\u2013703","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"824_CR13","doi-asserted-by":"crossref","first-page":"1437","DOI":"10.1109\/TKDE.2003.1245283","volume":"15","author":"MA Hall","year":"2003","unstructured":"Hall MA, Holmes G (2003) Benchmarking attribute selection techniques for discrete class data mining. IEEE Trans Knowl Data Eng 15(6):1437\u20131447","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"824_CR14","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TKDE.2005.66","volume":"17","author":"H Liu","year":"2005","unstructured":"Liu H, Yu L (2005) Toward integrating feature selection algorithms for classification and clustering. IEEE Trans Knowl Data Eng 17(4):491\u2013502","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"824_CR15","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/TKDE.2005.136","volume":"17","author":"GZ Qu","year":"2005","unstructured":"Qu GZ, Hariri S, Yousif M (2005) A new dependency and correlation analysis for features. IEEE Trans Knowl Data Eng 17(9):1199\u20131207","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"824_CR16","doi-asserted-by":"crossref","first-page":"2858","DOI":"10.1016\/j.eswa.2007.05.037","volume":"34","author":"WC Chen","year":"2008","unstructured":"Chen WC, Tseng SS, Hong TP (2008) An efficient bit-based feature selection method. Expert Syst Appl 34(4):2858\u20132869","journal-title":"Expert Syst Appl"},{"issue":"1","key":"824_CR17","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.asoc.2012.07.018","volume":"13","author":"F Wang","year":"2013","unstructured":"Wang F, Liang JY, Dang CY (2013) Attribute reduction for dynamic data sets. Appl Soft Comput 13(1):676\u2013689","journal-title":"Appl Soft Comput"},{"issue":"3","key":"824_CR18","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TKDE.2006.45","volume":"18","author":"J Yan","year":"2006","unstructured":"Yan J, Zhang BY, Liu N, Yan SC, Cheng QS, Fan WG, Yang Q, Xi WS, Chen Z (2006) Effective and efficient dimensionality reduction for large-scale and streaming data preprocessing. IEEE Trans Knowl Data Eng 18(3):320\u2013333","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"824_CR19","first-page":"245","volume":"13","author":"A Skowron","year":"1990","unstructured":"Skowron A (1990) The rough sets theory and evidence theory. Fundam Inf 13:245\u2013262","journal-title":"Fundam Inf"},{"key":"824_CR20","unstructured":"\u00d8hrn A, Komorowski J, Skowron A, Synak P (1998) The design and implementation of a knowledge discovery toolkit based on rough sets: the ROSETTA system. In: Polkowski L, Skowron A (eds) Rough sets in knowledge discovery. Physica Verlag, Heidelberg, pp 376\u2013399"},{"key":"824_CR21","unstructured":"Jensen R, Shen Q (2007) Rough set based attribute selection: a review. http:\/\/cadair.aber.ac.uk\/dspace\/bitstream\/handle\/2160\/490\/JensenShen.pdf?sequence=3 . Accessed 12 Dec 2013"},{"issue":"6","key":"824_CR22","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF02943234","volume":"16","author":"J Wang","year":"2001","unstructured":"Wang J, Wang J (2001) Reduction algorithms based on discernibility matrix: the ordered attributes method. J Comput Sci Technol 16(6):489\u2013504","journal-title":"J Comput Sci Technol"},{"issue":"2","key":"824_CR23","first-page":"507","volume":"49","author":"M Mafarja","year":"2013","unstructured":"Mafarja M, Abdullah S (2013) Record-to-record travel algorithm for attribute reduction in rough set theory. J Theor Appl Inf Technol 49(2):507\u2013513","journal-title":"J Theor Appl Inf Technol"},{"issue":"5A","key":"824_CR24","first-page":"2167","volume":"7","author":"S Kahramanli","year":"2011","unstructured":"Kahramanli S, Hacibeyoglu M, Arslan A (2011) Attribute reduction by partitioning the minimized discernibility function. Int J Innov Comput Inf Control 7(5A):2167\u20132186","journal-title":"Int J Innov Comput Inf Control"},{"issue":"7","key":"824_CR25","first-page":"165","volume":"10","author":"AD Procaccia","year":"2006","unstructured":"Procaccia AD, Rosenschein JS (2006) Exact VC-dimension of Monotone formulas. Neural Inf Process Lett Rev 10(7):165\u2013168","journal-title":"Neural Inf Process Lett Rev"},{"issue":"4","key":"824_CR26","first-page":"643","volume":"19","author":"M Hacibeyoglu","year":"2011","unstructured":"Hacibeyoglu M, Basciftci F, Kahramanli S (2011) A logic method for efficient reduction of the space complexity of the attribute reduction problem. Turk J Electr Eng Comput Sci 19(4):643\u2013656","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"7","key":"824_CR27","doi-asserted-by":"crossref","first-page":"8229","DOI":"10.1016\/j.eswa.2011.01.002","volume":"38","author":"S Kahramanli","year":"2011","unstructured":"Kahramanli S, Hacibeyoglu M, Arslan A (2011) A Boolean function approach to feature selection in consistent decision information systems. Expert Syst Appl 38(7):8229\u20138239","journal-title":"Expert Syst Appl"},{"issue":"2","key":"824_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2266893","volume":"20","author":"JR Nelson","year":"1955","unstructured":"Nelson JR (1955) Simplest normal truth functions. J Symb Log 20(2):105\u2013108","journal-title":"J Symb Log"},{"issue":"4","key":"824_CR29","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/43.75625","volume":"10","author":"AA Malik","year":"1991","unstructured":"Malik AA, Brayton RK, Newton AR, Sangiovannivincentelli A (1991) Reduced offsets for minimization of binary-valued functions. IEEE Trans Comput Aided Des Integr Circuits Syst 10(4):413\u2013426","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"1\u20132","key":"824_CR30","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2005.07.029","volume":"347","author":"PB Miltersen","year":"2005","unstructured":"Miltersen PB, Radhakrishnan J, Wegener I (2005) On converting CNF to DNF. Theor Comput Sci 347(1\u20132):325\u2013335","journal-title":"Theor Comput Sci"},{"key":"824_CR31","doi-asserted-by":"crossref","unstructured":"Vorwerk K, Paulley GN (2002) On implicate discovery and query optimization. In: Proceedings of international database engineering and applications symposium, 2002","DOI":"10.1109\/IDEAS.2002.1029651"},{"issue":"3","key":"824_CR32","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/T-C.1970.222917","volume":"C\u201319","author":"JR Slagle","year":"1970","unstructured":"Slagle JR, Chang CL, Lee RCT (1970) New algorithm for generating prime implicants. IEEE Trans Comput C\u201319(3):304\u2013310","journal-title":"IEEE Trans Comput"},{"key":"824_CR33","volume-title":"Investigations of algorithms for computer-aided logic design of digital circuits","author":"B Thelen","year":"1981","unstructured":"Thelen B (1981) Investigations of algorithms for computer-aided logic design of digital circuits. University of Karlsruhe, Karlsruhe"},{"key":"824_CR34","first-page":"125","volume":"14","author":"J Bieganowski","year":"2005","unstructured":"Bieganowski J, Karatkevich A (2005) Heuristics for Thelen\u2019s prime implicant method. Scheda Inf 14: 125\u2013135","journal-title":"Scheda Inf"},{"issue":"1","key":"824_CR35","first-page":"113","volume":"14","author":"A Karatkevich","year":"2004","unstructured":"Karatkevich A, Bieganowski J (2004) Detection of deadlocks and traps in petri nets by means of Thelen\u2019s prime implicant method. Int J Appl Math Comput Sci 14(1):113\u2013121","journal-title":"Int J Appl Math Comput Sci"},{"key":"824_CR36","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00249017","volume":"7","author":"R Socher","year":"1991","unstructured":"Socher R (1991) Optimizing the clausal normal form transformation. J Autom Reason 7:325\u2013336","journal-title":"J Autom Reason"},{"issue":"2","key":"824_CR37","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/logcom\/8.2.135","volume":"8","author":"AK Shiny","year":"1998","unstructured":"Shiny AK, Pujari AK (1998) Computation of prime implicants using matrix and paths. J Logic Comput 8(2):135\u2013145","journal-title":"J Logic Comput"},{"issue":"5","key":"824_CR38","doi-asserted-by":"crossref","first-page":"1890","DOI":"10.1109\/TIT.2006.872860","volume":"52","author":"TT Lee","year":"2006","unstructured":"Lee TT, Lo TY, Wang JF (2006) An information-lossless decomposition theory of relational information systems. IEEE Trans Inf Theory 52(5):1890\u20131903","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"824_CR39","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/12.954508","volume":"50","author":"T Sasao","year":"2001","unstructured":"Sasao T, Butler JT (2001) Worst and best irredundant sum-of-products expressions. IEEE Trans Comput 50(9):935\u2013948","journal-title":"IEEE Trans Comput"},{"key":"824_CR40","unstructured":"Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml . Accessed 13 Dec 2013"},{"issue":"2","key":"824_CR41","first-page":"83","volume":"3","author":"K Selvakuberan","year":"2008","unstructured":"Selvakuberan K, Indradevi M, Rajaman R (2008) Combined feature selection and classification\u2014a novel approach for the categorization of web pages. J Inf Comput Sci 3(2):83\u201389","journal-title":"J Inf Comput Sci"},{"issue":"4","key":"824_CR42","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4316\/AECE.2013.04010","volume":"13","author":"M Hacibeyoglu","year":"2013","unstructured":"Hacibeyoglu M, Arslan A, Kahramanli S (2013) A hybrid method for fast finding the reduct with the best classification accuracy. Adv Electr Comput Eng 13(4):57\u201364","journal-title":"Adv Electr Comput Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0824-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0824-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0824-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:11:02Z","timestamp":1566346262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0824-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,22]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["824"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0824-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,22]]}}}