{"id":"https://openalex.org/W2125753160","doi":"https://doi.org/10.1109/fuzz.2003.1209452","title":"Discovering reduct rules from N-indiscernibility objects in rough sets","display_name":"Discovering reduct rules from N-indiscernibility objects in rough sets","publication_year":2004,"publication_date":"2004-05-25","ids":{"openalex":"https://openalex.org/W2125753160","doi":"https://doi.org/10.1109/fuzz.2003.1209452","mag":"2125753160"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz.2003.1209452","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz.2003.1209452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","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/A5110955515","display_name":"Junping Sun","orcid":"https://orcid.org/0000-0001-9164-8061"},"institutions":[{"id":"https://openalex.org/I203088144","display_name":"Nova Southeastern University","ror":"https://ror.org/042bbge36","country_code":"US","type":"education","lineage":["https://openalex.org/I203088144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Junping Sun","raw_affiliation_strings":["Graduate School of Computer and Information Sciences, Nova Southeastern University, Fort Lauderdale, FL, USA","Graduate Sch. of Comput. & Inf. Sci., Nova Southeastern Univ., Fort Lauderdale, FL, USA"],"affiliations":[{"raw_affiliation_string":"Graduate School of Computer and Information Sciences, Nova Southeastern University, Fort Lauderdale, FL, USA","institution_ids":["https://openalex.org/I203088144"]},{"raw_affiliation_string":"Graduate Sch. of Comput. & Inf. Sci., Nova Southeastern Univ., Fort Lauderdale, FL, USA","institution_ids":["https://openalex.org/I203088144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110955515"],"corresponding_institution_ids":["https://openalex.org/I203088144"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18066254,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"720","last_page":"725"},"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.9567999839782715,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reduct","display_name":"Reduct","score":0.9675334692001343},{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.9409659504890442},{"id":"https://openalex.org/keywords/decision-table","display_name":"Decision table","score":0.7876376509666443},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5944263935089111},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5722958445549011},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.55140221118927},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5454580783843994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5356148481369019},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4946291148662567},{"id":"https://openalex.org/keywords/dominance-based-rough-set-approach","display_name":"Dominance-based rough set approach","score":0.4861454665660858},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.47937825322151184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4115551710128784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40797704458236694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2119077444076538},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18790379166603088}],"concepts":[{"id":"https://openalex.org/C69177213","wikidata":"https://www.wikidata.org/wiki/Q12880812","display_name":"Reduct","level":3,"score":0.9675334692001343},{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.9409659504890442},{"id":"https://openalex.org/C172967692","wikidata":"https://www.wikidata.org/wiki/Q747762","display_name":"Decision table","level":3,"score":0.7876376509666443},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5944263935089111},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5722958445549011},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.55140221118927},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5454580783843994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5356148481369019},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4946291148662567},{"id":"https://openalex.org/C39105242","wikidata":"https://www.wikidata.org/wiki/Q5290286","display_name":"Dominance-based rough set approach","level":3,"score":0.4861454665660858},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.47937825322151184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4115551710128784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40797704458236694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2119077444076538},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18790379166603088},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/fuzz.2003.1209452","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz.2003.1209452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:nsuworks.nova.edu:gscis_facarticles-1496","is_oa":false,"landing_page_url":"https://nsuworks.nova.edu/gscis_facarticles/497","pdf_url":null,"source":{"id":"https://openalex.org/S4377196410","display_name":"NSUWorks (Nova Southeastern University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I203088144","host_organization_name":"Nova Southeastern University","host_organization_lineage":["https://openalex.org/I203088144"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CCE Faculty Articles","raw_type":"article"},{"id":"pmh:oai:nsuworks.nova.edu:gscis_facpres-1603","is_oa":false,"landing_page_url":"https://nsuworks.nova.edu/gscis_facpres/615","pdf_url":null,"source":{"id":"https://openalex.org/S4377196410","display_name":"NSUWorks (Nova Southeastern University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I203088144","host_organization_name":"Nova Southeastern University","host_organization_lineage":["https://openalex.org/I203088144"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CCE Faculty Proceedings, Presentations, Speeches and Lectures","raw_type":"conference"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W37854187","https://openalex.org/W66392090","https://openalex.org/W122588048","https://openalex.org/W1486452390","https://openalex.org/W1510610982","https://openalex.org/W1526500914","https://openalex.org/W1593247374","https://openalex.org/W2031242907","https://openalex.org/W2129150932","https://openalex.org/W2499254828","https://openalex.org/W2506703326","https://openalex.org/W2612487376","https://openalex.org/W3143971390","https://openalex.org/W6605054285"],"related_works":["https://openalex.org/W2386508597","https://openalex.org/W2102903132","https://openalex.org/W2281166163","https://openalex.org/W2155531808","https://openalex.org/W2692618134","https://openalex.org/W2883863831","https://openalex.org/W2557802193","https://openalex.org/W2354227702","https://openalex.org/W2146407160","https://openalex.org/W3013418296"],"abstract_inverted_index":{"In":[0],"rough":[1,61,73],"set":[2,11,35,57,62,126],"theory,":[3],"the":[4,16,24,28,33,66,78,82,86,95,101,104,111],"reduct":[5],"is":[6,20,44],"defined":[7],"as":[8,31],"a":[9,39,131],"minimal":[10,56],"of":[12,36,58,81,94,110,122,127],"attributes":[13,37,59,128],"that":[14,103],"partitions":[15],"tuple":[17],"space":[18],"and":[19,84,91,107],"used":[21],"to":[22,26,45,51,120],"perform":[23],"classification":[25],"achieve":[27],"equivalent":[29],"result":[30],"using":[32],"whole":[34],"in":[38,72,114,130],"decision":[40,53,132],"table.":[41,133],"This":[42,97],"paper":[43,76,98,116],"present":[46],"an":[47],"incremental":[48],"partitioning":[49],"algorithm":[50,68,112],"discover":[52],"rules":[54,71],"with":[55],"from":[60,125],"data.":[63],"Besides":[64],"developing":[65],"heuristic":[67],"for":[69],"discovering":[70],"sets,":[74],"this":[75,115],"analyzes":[77],"time":[79],"complexity":[80],"algorithm,":[83],"presents":[85],"lower":[87,105],"bound,":[88,90],"upper":[89,108],"average":[92],"cost":[93],"algorithm.":[96],"also":[99],"finds":[100],"characteristics":[102],"bound":[106,109],"presented":[113],"are":[117],"closely":[118],"related":[119],"cardinalities":[121],"attribute":[123],"values":[124],"involved":[129]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}