{"id":"https://openalex.org/W4407691297","doi":"https://doi.org/10.1109/dsit61374.2024.10882131","title":"A Density-Weighted Information Gain Tree for Clustering Mixed-Type Data","display_name":"A Density-Weighted Information Gain Tree for Clustering Mixed-Type Data","publication_year":2024,"publication_date":"2024-12-20","ids":{"openalex":"https://openalex.org/W4407691297","doi":"https://doi.org/10.1109/dsit61374.2024.10882131"},"language":"en","primary_location":{"id":"doi:10.1109/dsit61374.2024.10882131","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsit61374.2024.10882131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 7th International Conference on Data Science and Information Technology (DSIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100701157","display_name":"Yu Zhao","orcid":"https://orcid.org/0000-0002-0606-4676"},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yu Zhao","raw_affiliation_strings":["Tokyo University of Science,Department of Management, School of Management,Tokyo,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo University of Science,Department of Management, School of Management,Tokyo,Japan","institution_ids":["https://openalex.org/I161296585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100701157"],"corresponding_institution_ids":["https://openalex.org/I161296585"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3081583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/cluster-analysis","display_name":"Cluster analysis","score":0.6949441432952881},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6884125471115112},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5701904296875},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.40833067893981934},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3310019075870514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21394872665405273},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0902288556098938}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6949441432952881},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6884125471115112},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5701904296875},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40833067893981934},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3310019075870514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21394872665405273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0902288556098938}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsit61374.2024.10882131","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsit61374.2024.10882131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 7th International Conference on Data Science and Information Technology (DSIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8655371296","display_name":"Introduction of Uncertainty into Data Envelopment Analysis","funder_award_id":"22K14443","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W151377110","https://openalex.org/W1995875735","https://openalex.org/W1998871699","https://openalex.org/W2149230623","https://openalex.org/W2779640815","https://openalex.org/W3090540127","https://openalex.org/W3183763998","https://openalex.org/W3203644918","https://openalex.org/W4235169531","https://openalex.org/W4285781363","https://openalex.org/W4311840441","https://openalex.org/W4320039414","https://openalex.org/W4320168164","https://openalex.org/W4367043704","https://openalex.org/W4367301052","https://openalex.org/W4367721687","https://openalex.org/W4387194117","https://openalex.org/W4390780641","https://openalex.org/W4390873424","https://openalex.org/W6637131181","https://openalex.org/W6678914141"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Clustering":[0],"mixed-type":[1,30,113],"data,":[2],"which":[3,57],"includes":[4],"both":[5,95],"continuous":[6,39,64],"and":[7,25,40,65,89,97,115],"categorical":[8,41,66],"features,":[9],"presents":[10],"significant":[11],"challenges":[12],"due":[13],"to":[14,37,111],"the":[15,50,102],"distinct":[16],"nature":[17],"of":[18],"these":[19,46],"data":[20,31,114],"types.":[21],"Many":[22],"traditional":[23],"distance-based":[24],"density-based":[26],"methods":[27],"struggle":[28],"with":[29],"because":[32],"they":[33],"are":[34],"not":[35],"designed":[36],"handle":[38,112],"features":[42,67],"simultaneously.":[43],"To":[44],"address":[45],"limitations,":[47],"we":[48],"propose":[49],"Density-Weighted":[51],"Information":[52],"Gain":[53],"(DWIG)":[54],"Tree":[55,75,104],"algorithm,":[56],"effectively":[58],"manages":[59],"mixed":[60],"datasets":[61,99],"by":[62],"integrating":[63],"through":[68],"a":[69],"recursive":[70],"partitioning":[71],"strategy.":[72],"The":[73],"DWIG":[74,103],"maximizes":[76],"information":[77],"gain":[78],"while":[79],"accounting":[80],"for":[81],"local":[82],"density":[83],"variations,":[84],"resulting":[85],"in":[86],"more":[87,119],"accurate":[88],"interpretable":[90],"clustering":[91],"outcomes.":[92],"Experiments":[93],"on":[94],"synthetic":[96],"real-world":[98],"demonstrate":[100],"that":[101],"outperforms":[105],"K-Prototypes,":[106],"highlighting":[107],"its":[108],"superior":[109],"capability":[110],"capture":[116],"natural":[117],"groupings":[118],"accurately.":[120]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}