{"id":"https://openalex.org/W2140441384","doi":null,"title":"Anytime Induction of Cost-sensitive Trees","display_name":"Anytime Induction of Cost-sensitive Trees","publication_year":2007,"publication_date":"2007-12-03","ids":{"openalex":"https://openalex.org/W2140441384","mag":"2140441384"},"language":"en","primary_location":{"id":"mag:2140441384","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/3192-anytime-induction-of-cost-sensitive-trees.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"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":"Neural Information Processing Systems","raw_type":null},"volume":null,"type":"article","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/A5109890593","display_name":"Saher Esmeir","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Saher Esmeir","raw_affiliation_strings":["Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088024319","display_name":"Shaul Markovitch","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shaul Markovitch","raw_affiliation_strings":["Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Sci. Dept., Technion - Israel Inst. of Tech., Haifa, Israel#TAB#","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.7504,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88341621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"20","issue":null,"first_page":"425","last_page":"432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.8270999789237976,"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.8270999789237976,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.08380000293254852,"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"}},{"id":"https://openalex.org/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.016100000590085983,"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/cost-sensitive-learning","display_name":"cost-sensitive learning","score":0.6190000176429749},{"id":"https://openalex.org/keywords/decision-tree","display_name":"decision tree","score":0.7570000290870667},{"id":"https://openalex.org/keywords/anytime-algorithms","display_name":"anytime algorithms","score":0.9779999852180481},{"id":"https://openalex.org/keywords/misclassification-cost","display_name":"misclassification cost","score":0.671999990940094},{"id":"https://openalex.org/keywords/testing-cost","display_name":"test cost","score":0.5590000152587891},{"id":"https://openalex.org/keywords/local-optima-avoidance","display_name":"local optima avoidance","score":0.6050000190734863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.764124870300293},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.651549756526947},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6435931324958801},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6048234105110168},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.545691192150116},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5226262211799622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4885648190975189},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.47386980056762695},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4487914443016052},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4408488869667053},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.434179425239563},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33101266622543335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20341792702674866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11045771837234497},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2140441384","doi":null,"is_oa":false,"landing_page_url":"https://papers.nips.cc/paper/3192-anytime-induction-of-cost-sensitive-trees.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4363606243","display_name":"neural information processing systems","issn_l":"1049-5258","issn":["1049-5258"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"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":"Neural Information Processing Systems","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":26,"referenced_works":["https://openalex.org/W87848775","https://openalex.org/W163887238","https://openalex.org/W167016754","https://openalex.org/W1503605645","https://openalex.org/W1504694836","https://openalex.org/W1519196800","https://openalex.org/W1527418157","https://openalex.org/W1534897962","https://openalex.org/W1553533669","https://openalex.org/W1554944419","https://openalex.org/W1565746575","https://openalex.org/W1581109190","https://openalex.org/W1589187426","https://openalex.org/W1594031697","https://openalex.org/W1819386543","https://openalex.org/W2020246567","https://openalex.org/W2039024435","https://openalex.org/W2058732827","https://openalex.org/W2070902649","https://openalex.org/W2084812512","https://openalex.org/W2098576843","https://openalex.org/W2098737324","https://openalex.org/W2104597806","https://openalex.org/W2125055259","https://openalex.org/W2170849167","https://openalex.org/W3085162807"],"related_works":["https://openalex.org/W2170616581","https://openalex.org/W7099824098","https://openalex.org/W2109483014","https://openalex.org/W7095735223","https://openalex.org/W1580662873","https://openalex.org/W2005530589","https://openalex.org/W2136192430","https://openalex.org/W2183159859","https://openalex.org/W2081639074","https://openalex.org/W7097779435"],"abstract_inverted_index":{"Machine":[0],"learning":[1,38],"techniques":[2,101],"are":[3],"increasingly":[4],"being":[5],"used":[6],"to":[7,87,124,131,134,153,159,188],"produce":[8],"a":[9,43,55,79,120,147],"wide-range":[10],"of":[11,28,34,94,110,149,157,161,164,180],"classifiers":[12],"for":[13,58,73,91,104,174],"complex":[14],"real-world":[15],"applications":[16,30],"that":[17,68,160,173],"involve":[18],"nonuniform":[19],"testing":[20],"costs":[21],"and":[22,39,82,115],"misclassification":[23],"costs.":[24,76,183],"As":[25],"the":[26,32,37,92,95,108,111,117,155,162,165],"complexity":[27],"these":[29],"grows,":[31],"management":[33],"resources":[35,86],"during":[36],"classification":[40,75],"processes":[41],"becomes":[42],"challenging":[44],"task.":[45],"In":[46],"this":[47],"work":[48],"we":[49],"introduce":[50],"ACT":[51,63,102,128,158,177,184],"(Anytime":[52],"Cost-sensitive":[53],"Trees),":[54],"novel":[56],"framework":[57],"operating":[59],"in":[60],"such":[61],"environments.":[62],"is":[64,129,185],"an":[65],"anytime":[66,191],"algorithm":[67],"allows":[69],"trading":[70],"computation":[71],"time":[72,85],"lower":[74,182],"It":[77],"builds":[78],"tree":[80,168],"top-down":[81],"exploits":[83],"additional":[84],"obtain":[88],"better":[89],"estimations":[90],"utility":[93],"different":[96],"candidate":[97,106],"splits.":[98],"Using":[99],"sampling":[100],"approximates":[103],"each":[105],"split":[107],"cost":[109],"subtree":[112],"under":[113],"it":[114],"favors":[116],"one":[118],"with":[119,146,193],"minimal":[121],"cost.":[122],"Due":[123],"its":[125],"stochastic":[126],"nature":[127],"expected":[130],"be":[132,143],"able":[133],"escape":[135],"local":[136],"minima,":[137],"into":[138],"which":[139],"greedy":[140],"methods":[141],"may":[142],"trapped.":[144],"Experiments":[145],"variety":[148],"datasets":[150],"were":[151],"conducted":[152],"compare":[154],"performance":[156],"state":[163],"art":[166],"cost-sensitive":[167],"learners.":[169],"The":[170],"results":[171],"show":[172],"most":[175],"domains":[176],"produces":[178],"trees":[179],"significantly":[181],"also":[186],"shown":[187],"exhibit":[189],"good":[190],"behavior":[192],"diminishing":[194],"returns.":[195]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}