{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:45:14Z","timestamp":1743003914872,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030348687"},{"type":"electronic","value":"9783030348694"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-34869-4_35","type":"book-chapter","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:02:57Z","timestamp":1574640177000},"page":"317-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding Optimal Rough Set Reduct with A* Search Algorithm"],"prefix":"10.1007","author":[{"given":"Abhimanyu","family":"Bar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. S. V. S.","family":"Sai Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.asoc.2016.02.003","volume":"42","author":"J Chen","year":"2016","unstructured":"Chen, J., Lin, Y., Li, J., Ma, Z., Tan, A.: A rough set method for the minimum vertex cover problem of graphs. Appl. Soft Comput. 42, 360\u2013367 (2016)","journal-title":"Appl. Soft Comput."},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.knosys.2015.02.002","volume":"81","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Zhu, Q., Xu, H.: Finding rough set reducts with fish swarm algorithm. Knowl.-Based Syst. 81, 22\u201329 (2015)","journal-title":"Knowl.-Based Syst."},{"key":"35_CR3","unstructured":"Dua, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-0-387-09823-4_13","volume-title":"Data Mining and Knowledge Discovery Handbook","author":"JW Grzymala-Busse","year":"2009","unstructured":"Grzymala-Busse, J.W.: Rule induction. In: Maimon, O., Rokach, L. (eds.) Data Mining and Knowledge Discovery Handbook, pp. 249\u2013265. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-09823-4_13"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Hassanien, A.E., Suraj, Z., Slezak, D., Lingras, P.: Rough Computing: Theories, Technologies and Applications. IGI Global, Hershey (2007)","DOI":"10.4018\/978-1-59904-552-8"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-25929-9_20","volume-title":"Rough Sets and Current Trends in Computing","author":"J Han","year":"2004","unstructured":"Han, J., Hu, X., Lin, T.Y.: Feature subset selection based on relative dependency between attributes. In: Tsumoto, S., S\u0142owi\u0144ski, R., Komorowski, J., Grzyma\u0142a-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 176\u2013185. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25929-9_20"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Jensen, R.: Rough set-based feature selection: a review. In: Rough Computing: Theories, Technologies and Applications, pp. 70\u2013107. IGI Global (2008)","DOI":"10.4018\/978-1-59904-552-8.ch003"},{"key":"35_CR9","unstructured":"Jensen, R., Shen, Q.: Finding rough set reducts with ant colony optimization. In: Proceedings of UKCI-2003, vol. 1, pp. 15\u201322 (2003)"},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0165-0114(03)00021-6","volume":"141","author":"R Jensen","year":"2004","unstructured":"Jensen, R., Shen, Q.: Fuzzy-rough attribute reduction with application to web categorization. Fuzzy Sets Syst. 141(3), 469\u2013485 (2004)","journal-title":"Fuzzy Sets Syst."},{"issue":"12","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1109\/TKDE.2004.96","volume":"16","author":"R Jensen","year":"2004","unstructured":"Jensen, R., Shen, Q.: Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Trans. Knowl. Data Eng. 16(12), 1457\u20131471 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR12","unstructured":"Kim, H.J.: MDLP: discretization using the minimum description length principle (2010). https:\/\/rdrr.io\/cran\/discretization\/"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1609\/aimag.v38i1.2716","volume":"38","author":"B Kuipers","year":"2017","unstructured":"Kuipers, B., Feigenbaum, E.A., Hart, P.E., Nilsson, N.J.: Shakey: from conception to history. AI Mag. 38, 88\u2013103 (2017)","journal-title":"AI Mag."},{"key":"35_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning About Data","author":"Z Pawalk","year":"1991","unstructured":"Pawalk, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-25725-4_31","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"PSVS Sai Prasad","year":"2011","unstructured":"Sai Prasad, P.S.V.S., Raghavendra Rao, C.: Extensions to IQuickReduct. In: Sombattheera, C., Agarwal, A., Udgata, S.K., Lavangnananda, K. (eds.) MIWAI 2011. LNCS (LNAI), vol. 7080, pp. 351\u2013362. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25725-4_31"},{"key":"35_CR16","unstructured":"Skowron, A., et al.: Rough Set Exploration System (RSES). Warsaw University, Warsaw (2005). https:\/\/www.mimuw.edu.pl\/~szczuka\/rses\/"},{"key":"35_CR17","series-title":"Theory and Decision Library (Series D: System Theory, Knowledge Engineering and Problem Solving)","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent Decision Support","author":"A Skowron","year":"1992","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: S\u0142owi\u0144ski, R. (ed.) Intelligent Decision Support. Theory and Decision Library (Series D: System Theory, Knowledge Engineering and Problem Solving), vol. 11, pp. 331\u2013362. Springer, Dordrecht (1992). https:\/\/doi.org\/10.1007\/978-94-015-7975-9_21"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.patrec.2006.09.003","volume":"28","author":"X Wang","year":"2007","unstructured":"Wang, X., Yang, J., Teng, X., Xia, W., Jensen, R.: Feature selection based on rough sets and PSO. Pattern Recogn. Lett. 28(4), 459\u2013471 (2007)","journal-title":"Pattern Recogn. Lett."},{"key":"35_CR19","unstructured":"Wroblewski, J.: Finding minimal reducts using genetic algorithms. In: Proccedings of the Second Annual Join Conference on Infromation Science, vol. 2, pp. 186\u2013189 (1995)"},{"issue":"15","key":"35_CR20","doi-asserted-by":"publisher","first-page":"6748","DOI":"10.1016\/j.eswa.2014.04.042","volume":"41","author":"K Zheng","year":"2014","unstructured":"Zheng, K., Hu, J., Zhan, Z., Ma, J., Qi, J.: An enhancement for heuristic attribute reduction algorithm in rough set. Expert Syst. Appl. 41(15), 6748\u20136754 (2014)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34869-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T15:15:36Z","timestamp":1710170136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-34869-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030348687","9783030348694"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34869-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PReMI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition and Machine Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tezpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"premi2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tezu.ernet.in\/~premi2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}