{"id":"https://openalex.org/W3015206303","doi":"https://doi.org/10.23919/icact48636.2020.9061399","title":"Computationally Efficient Approximation Algorithm of Dominance Based Rough Set Approach","display_name":"Computationally Efficient Approximation Algorithm of Dominance Based Rough Set Approach","publication_year":2020,"publication_date":"2020-02-01","ids":{"openalex":"https://openalex.org/W3015206303","doi":"https://doi.org/10.23919/icact48636.2020.9061399","mag":"3015206303"},"language":"en","primary_location":{"id":"doi:10.23919/icact48636.2020.9061399","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact48636.2020.9061399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 22nd International Conference on Advanced Communication Technology (ICACT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103898032","display_name":"Aleena Ahmad","orcid":null},"institutions":[{"id":"https://openalex.org/I929597975","display_name":"National University of Sciences and Technology","ror":"https://ror.org/03w2j5y17","country_code":"PK","type":"education","lineage":["https://openalex.org/I929597975"]}],"countries":["PK"],"is_corresponding":true,"raw_author_name":"Aleena Ahmad","raw_affiliation_strings":["Computer Engineering Department, College of Electrical and Mechanical Engineering, National University of Sciences and Technology (NUST), Islamabad, Pakistan"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, College of Electrical and Mechanical Engineering, National University of Sciences and Technology (NUST), Islamabad, Pakistan","institution_ids":["https://openalex.org/I929597975"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050012170","display_name":"Usman Qamar","orcid":"https://orcid.org/0000-0003-2361-2061"},"institutions":[{"id":"https://openalex.org/I929597975","display_name":"National University of Sciences and Technology","ror":"https://ror.org/03w2j5y17","country_code":"PK","type":"education","lineage":["https://openalex.org/I929597975"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Usman Qamar","raw_affiliation_strings":["Computer Engineering Department, College of Electrical and Mechanical Engineering, National University of Sciences and Technology (NUST), Islamabad, Pakistan"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, College of Electrical and Mechanical Engineering, National University of Sciences and Technology (NUST), Islamabad, Pakistan","institution_ids":["https://openalex.org/I929597975"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059453434","display_name":"Summair Raza","orcid":null},"institutions":[{"id":"https://openalex.org/I79571142","display_name":"Virtual University of Pakistan","ror":"https://ror.org/00ya1zd25","country_code":"PK","type":"education","lineage":["https://openalex.org/I79571142"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Summair Raza","raw_affiliation_strings":["Department of Computer Science, Virtual University of Pakistan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virtual University of Pakistan","institution_ids":["https://openalex.org/I79571142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103898032"],"corresponding_institution_ids":["https://openalex.org/I929597975"],"apc_list":null,"apc_paid":null,"fwci":0.1407,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49135293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"571","last_page":"576"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9714000225067139,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.7490164041519165},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7336305379867554},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6881424784660339},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6494848132133484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5522255897521973},{"id":"https://openalex.org/keywords/dominance-based-rough-set-approach","display_name":"Dominance-based rough set approach","score":0.4925563931465149},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4528440535068512},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.416521281003952},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41433200240135193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32181084156036377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.300184965133667},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.28984928131103516}],"concepts":[{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.7490164041519165},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7336305379867554},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6881424784660339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6494848132133484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5522255897521973},{"id":"https://openalex.org/C39105242","wikidata":"https://www.wikidata.org/wiki/Q5290286","display_name":"Dominance-based rough set approach","level":3,"score":0.4925563931465149},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4528440535068512},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.416521281003952},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41433200240135193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32181084156036377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.300184965133667},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.28984928131103516},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/icact48636.2020.9061399","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact48636.2020.9061399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 22nd International Conference on Advanced Communication Technology (ICACT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1840300771","https://openalex.org/W1923896538","https://openalex.org/W1969525310","https://openalex.org/W1993369399","https://openalex.org/W1999662701","https://openalex.org/W2000599157","https://openalex.org/W2004075750","https://openalex.org/W2057608478","https://openalex.org/W2070083848","https://openalex.org/W2074005500","https://openalex.org/W2081712429","https://openalex.org/W2143040521","https://openalex.org/W2143451122","https://openalex.org/W2273389437","https://openalex.org/W2294558593","https://openalex.org/W2328613394","https://openalex.org/W2340020088","https://openalex.org/W2343561906","https://openalex.org/W2510434257","https://openalex.org/W2555933387","https://openalex.org/W2608726431","https://openalex.org/W2614528177","https://openalex.org/W2803496285","https://openalex.org/W2956646341"],"related_works":["https://openalex.org/W2123662875","https://openalex.org/W2473601878","https://openalex.org/W2379884433","https://openalex.org/W2042497195","https://openalex.org/W2397494716","https://openalex.org/W2165634587","https://openalex.org/W4214891796","https://openalex.org/W2087213536","https://openalex.org/W2382975841","https://openalex.org/W2963142056"],"abstract_inverted_index":{"Information":[0],"systems":[1],"contain":[2],"preference":[3],"ordered":[4],"decision":[5],"attributes":[6],"now":[7],"a":[8],"day.":[9],"To":[10],"deal":[11],"with":[12],"them":[13,34],"Dominance":[14],"based":[15],"Rough":[16],"Set":[17],"Approach":[18],"(DRSA)":[19],"is":[20,86],"used.":[21],"Two":[22],"important":[23],"concepts":[24],"in":[25,40,45,60,89],"DRSA":[26],"are":[27,35],"upper":[28,107],"and":[29,106],"lower":[30,105],"approximations,":[31],"both":[32],"of":[33,49,91,100],"computationally":[36],"heavy":[37],"algorithms.":[38],"Reduction":[39],"its":[41,55],"computational":[42,101],"complexity":[43,56,90,102],"helps":[44],"many":[46],"advance":[47],"applications":[48],"DRSA.":[50],"Our":[51,63],"proposed":[52,78],"algorithm":[53,67],"reduces":[54],"by":[57],"making":[58],"changes":[59],"conventional":[61],"procedure.":[62],"solution":[64,79],"stops":[65],"the":[66,70],"from":[68,73,83],"precomputing":[69],"same":[71],"thing":[72],"scratch.":[74],"We":[75],"tested":[76],"our":[77],"on":[80],"5":[81],"datasets":[82],"UCI.":[84],"There":[85],"50%":[87],"reduction":[88,99],"comparison":[92],"step,":[93],"which":[94],"will":[95],"lead":[96],"to":[97],"overall":[98],"for":[103],"calculating":[104],"approximations.":[108]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}