{"id":"https://openalex.org/W273536037","doi":null,"title":"An efficient algorithm for finding optimal gain-ratio multiple-split tests on hierarchical attributes in decision tree learning","display_name":"An efficient algorithm for finding optimal gain-ratio multiple-split tests on hierarchical attributes in decision tree learning","alternate_titles":[],"publication_year":1996,"publication_date":"1996-08-04","ids":{"openalex":"https://openalex.org/W273536037","mag":"273536037"},"language":"en","primary_location":{"id":"mag:273536037","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/aaai/aaai96-1.html#AlmuallimAK96","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W273536037"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5056083446","display_name":"Hussein Almuallim","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hussein Almuallim","raw_affiliation_strings":["Information and Computer Science Department King Fahd University of Petroleum and Minerals  Dhahran Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Computer Science Department King Fahd University of Petroleum and Minerals  Dhahran Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110437010","display_name":"Yasuhiro Akiba","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Yasuhiro Akiba","raw_affiliation_strings":["NTT Communication Science Labs, Yokosuka-shi, Kanagawa, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Labs, Yokosuka-shi, Kanagawa, Japan#TAB#","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110500294","display_name":"Shigeo Kaneda","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Shigeo Kaneda","raw_affiliation_strings":["NTT Communication Science Labs, Yokosuka-shi, Kanagawa, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Communication Science Labs, Yokosuka-shi, Kanagawa, Japan#TAB#","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.31,"has_fulltext":false,"cited_by_count":11,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.51493535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"703","last_page":"708"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9955999851226807,"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"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9955999851226807,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.0024999999441206455,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decision-tree-induction","display_name":"decision tree induction","score":0.8510000109672546},{"id":"https://openalex.org/keywords/gain-ratio","display_name":"gain ratio","score":0.6669999957084656},{"id":"https://openalex.org/keywords/attribute-hierarchy","display_name":"attribute hierarchy","score":0.734000027179718}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.754488468170166},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.637908399105072},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5987389087677002},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.5783755779266357},{"id":"https://openalex.org/C202185110","wikidata":"https://www.wikidata.org/wiki/Q6031086","display_name":"Information gain ratio","level":3,"score":0.5414327383041382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5281790494918823},{"id":"https://openalex.org/C2983203078","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Information gain","level":2,"score":0.5271512866020203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4550730288028717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4515976309776306},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4411039650440216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.350456565618515},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3062726855278015},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28943249583244324},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2731131911277771},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11263763904571533},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:273536037","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/aaai/aaai96-1.html#AlmuallimAK96","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1497174031","https://openalex.org/W1585743408","https://openalex.org/W1589187426","https://openalex.org/W1994022788","https://openalex.org/W2032427901","https://openalex.org/W2056751685","https://openalex.org/W2089967664","https://openalex.org/W2114691585","https://openalex.org/W2149706766","https://openalex.org/W3085162807"],"related_works":["https://openalex.org/W224527993","https://openalex.org/W2135579862","https://openalex.org/W605537499","https://openalex.org/W7099633453","https://openalex.org/W1967148170","https://openalex.org/W1484813431","https://openalex.org/W2124655718","https://openalex.org/W1762419678","https://openalex.org/W2996919918","https://openalex.org/W2039721827"],"abstract_inverted_index":{"Given":[0],"a":[1,8,20,87],"set":[2,89],"of":[3,33,43,90,97],"training":[4,88],"examples":[5,92],"S":[6],"and":[7,56,93],"tree-structured":[9],"attribute":[10,95],"x,":[11],"the":[12,41,44,48,65,80],"goal":[13],"in":[14,40,61,103],"this":[15,75],"work":[16],"is":[17],"to":[18,54,63,106],"find":[19],"multiple-split":[21,36],"test":[22],"defined":[23],"on":[24],"x":[25],"that":[26,77],"maximizes":[27],"Quinlan's":[28],"gain-ratio":[29,81],"measure.":[30],"The":[31],"number":[32],"possible":[34,84],"such":[35],"tests":[37,60],"grows":[38],"exponentially":[39],"size":[42],"hierarchy":[45,96],"associated":[46],"with":[47],"attribute.":[49],"It":[50],"is,":[51],"therefore,":[52],"impractical":[53],"enumerate":[55],"evaluate":[57],"all":[58,83],"these":[59],"order":[62],"choose":[64],"best":[66],"one.":[67],"We":[68],"introduce":[69],"an":[70,94],"efficient":[71,111],"algorithm":[72,101],"for":[73,113],"solving":[74],"problem":[76],"guarantees":[78],"maximizing":[79],"over":[82],"tests.":[85],"For":[86],"m":[91],"height":[98],"d,":[99],"our":[100],"runs":[102],"time":[104],"proportional":[105],"dm,":[107],"which":[108],"makes":[109],"it":[110],"enough":[112],"practical":[114],"use.":[115]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W273536037","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
