{"id":"https://openalex.org/W2151151096","doi":"https://doi.org/10.1080/08839510802164234","title":"ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES","display_name":"ALGORITHMIC CHALLENGES IN LEARNING PATH METRICS FROM OBSERVED CHOICES","publication_year":2008,"publication_date":"2008-08-19","ids":{"openalex":"https://openalex.org/W2151151096","doi":"https://doi.org/10.1080/08839510802164234","mag":"2151151096"},"language":"en","primary_location":{"id":"doi:10.1080/08839510802164234","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839510802164234","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839510802164234?needAccess=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839510802164234?needAccess=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009539372","display_name":"Andr\u00e1s Farag\u00f3","orcid":"https://orcid.org/0000-0001-8952-6946"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s Farag\u00f3","raw_affiliation_strings":["Department of Computer Science , The University of Texas at Dallas , Richardson, Texas, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , The University of Texas at Dallas , Richardson, Texas, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009539372"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13045144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"7-8","first_page":"749","last_page":"760"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9900000095367432,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/metric","display_name":"Metric (unit)","score":0.7947487831115723},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7406530976295471},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7090698480606079},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5204137563705444},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5184144973754883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5097987055778503},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3985447585582733},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32824236154556274},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.30189403891563416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2521613538265228}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.7947487831115723},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7406530976295471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7090698480606079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5204137563705444},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5184144973754883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5097987055778503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3985447585582733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32824236154556274},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30189403891563416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2521613538265228},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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":1,"locations":[{"id":"doi:10.1080/08839510802164234","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839510802164234","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839510802164234?needAccess=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/08839510802164234","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839510802164234","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839510802164234?needAccess=true","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1491441015","https://openalex.org/W1497474439","https://openalex.org/W1583326271","https://openalex.org/W1963547452","https://openalex.org/W1991114512","https://openalex.org/W2072899462","https://openalex.org/W2200063098","https://openalex.org/W2911796152","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":{"In":[0,18,38],"many":[1,39],"systems":[2],"it":[3],"is":[4,48,62,91,127],"an":[5,109],"essential":[6],"part":[7],"of":[8,45],"the":[9,22,28,33,46,54,65,73,93,115,121,124],"operation":[10],"to":[11,20,26,63,84],"find":[12],"optimal":[13,34],"paths":[14,35],"in":[15],"large":[16],"graphs.":[17],"order":[19],"understand":[21],"system,":[23],"we":[24,50,107],"need":[25],"know":[27],"path":[29,55,75,95,125],"metric":[30,47,96,113,126],"under":[31],"which":[32],"are":[36,58],"chosen.":[37],"cases,":[40],"however,":[41],"no":[42],"explicite":[43],"knowledge":[44],"available,":[49],"can":[51,97],"only":[52],"observe":[53],"choices":[56],"that":[57,92,129],"made.":[59],"Our":[60,88],"goal":[61],"learn":[64],"unknown":[66],"metric,":[67],"as":[68,70],"accurately":[69],"possible,":[71],"from":[72],"observed":[74],"choices.":[76],"We":[77,118],"present":[78],"a":[79,102],"mathematical":[80],"model":[81],"and":[82],"method":[83],"handle":[85],"this":[86],"problem.":[87],"main":[89],"result":[90],"unknonw":[94],"be":[98],"optimally":[99],"learned":[100],"by":[101],"polynomial":[103],"time":[104],"algorithm,":[105],"if":[106],"assume":[108],"additive":[110],"(but":[111],"unknown)":[112],"over":[114],"graph":[116],"edges.":[117],"also":[119],"consider":[120],"case":[122],"when":[123],"general,":[128],"is,":[130],"not":[131],"necessarily":[132],"additive.":[133]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-19T21:40:30.786675","created_date":"2025-10-10T00:00:00"}