{"id":"https://openalex.org/W2590778359","doi":"https://doi.org/10.1109/icci-cc.2016.7862043","title":"Semantic computing of simplicity in attributed generalized trees","display_name":"Semantic computing of simplicity in attributed generalized trees","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2590778359","doi":"https://doi.org/10.1109/icci-cc.2016.7862043","mag":"2590778359"},"language":"en","primary_location":{"id":"doi:10.1109/icci-cc.2016.7862043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icci-cc.2016.7862043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","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/A5033773776","display_name":"Mahsa Kiani","orcid":"https://orcid.org/0000-0003-1171-2970"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mahsa Kiani","raw_affiliation_strings":["Faculty of Computer Science University of New Brunswick, Fredericton, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science University of New Brunswick, Fredericton, Canada","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111680679","display_name":"Virendrakumar C. Bhavsar","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Virendrakumar C. Bhavsar","raw_affiliation_strings":["Faculty of Computer Science University of New Brunswick, Fredericton, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science University of New Brunswick, Fredericton, Canada","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001111183","display_name":"Harold Boley","orcid":"https://orcid.org/0000-0002-8940-7469"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Harold Boley","raw_affiliation_strings":["Faculty of Computer Science University of New Brunswick, Fredericton, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science University of New Brunswick, Fredericton, Canada","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033773776"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":null,"apc_paid":null,"fwci":0.8569,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.85283577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":null,"first_page":"244","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9979000091552734,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9979000091552734,"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/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/simplicity","display_name":"Simplicity","score":0.9890790581703186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085288524627686},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5257942080497742},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5223237872123718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47642621397972107},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41855764389038086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3436651825904846}],"concepts":[{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.9890790581703186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085288524627686},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5257942080497742},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5223237872123718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47642621397972107},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41855764389038086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3436651825904846},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icci-cc.2016.7862043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icci-cc.2016.7862043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W180044567","https://openalex.org/W1515832801","https://openalex.org/W1762818859","https://openalex.org/W1953744017","https://openalex.org/W2011176634","https://openalex.org/W2057472927","https://openalex.org/W2122410182","https://openalex.org/W2127447298","https://openalex.org/W2168546489","https://openalex.org/W2169459648","https://openalex.org/W2243767758","https://openalex.org/W3003623942","https://openalex.org/W4246219036","https://openalex.org/W6638017292"],"related_works":["https://openalex.org/W2368019753","https://openalex.org/W2333930193","https://openalex.org/W2737356002","https://openalex.org/W2246241526","https://openalex.org/W4301122218","https://openalex.org/W2374150061","https://openalex.org/W2081340182","https://openalex.org/W4210711561","https://openalex.org/W78216654","https://openalex.org/W2478607759"],"abstract_inverted_index":{"In":[0,53],"earlier":[1],"work,":[2],"Attributed":[3],"Generalized":[4],"Tree":[5],"(AGT)":[6],"structures,":[7],"having":[8],"vertex":[9],"labels,":[10,12],"edge":[11,14],"and":[13,48,76,101,115],"weights":[15],"have":[16,39],"been":[17],"introduced.":[18],"AGTs":[19,38,116],"can":[20],"represent":[21],"knowledge":[22],"in":[23,41,86,117],"domains":[24,43],"containing":[25],"rich":[26],"semantic/pragmatic":[27],"object-centered":[28],"descriptions":[29],"as":[30,32,45],"well":[31],"complex":[33],"relations":[34],"between":[35],"objects.":[36],"Therefore,":[37],"applications":[40],"many":[42],"such":[44],"health,":[46],"business,":[47],"finance":[49],"(e.g.,":[50],"insurance":[51],"underwriting).":[52],"this":[54],"paper,":[55],"we":[56],"introduce":[57],"a":[58,84,95,118],"function":[59,70],"to":[60,83],"quantify":[61],"the":[62,81,87,99,109,140,146],"simplicity":[63,69,92,104,111,126,131,141],"of":[64,98,108,148],"an":[65],"arbitrary":[66],"AGT.":[67],"Our":[68],"takes":[71],"into":[72],"account":[73],"branch,":[74],"position,":[75],"weight":[77],"factors;":[78],"it":[79],"maps":[80],"structure":[82],"value":[85,142],"interval":[88],"[0,1].":[89],"The":[90,133],"recursive":[91],"algorithm":[93],"performs":[94],"top-down":[96],"traversal":[97],"AGT":[100,110,149],"computes":[102],"its":[103],"bottom-up.":[105],"Characteristic":[106],"properties":[107],"measure":[112],"are":[113,121],"analyzed,":[114],"test":[119],"dataset":[120],"ranked":[122],"based":[123],"on":[124],"their":[125],"values":[127],"computed":[128],"using":[129],"our":[130,137],"algorithm.":[132],"experimental":[134],"analysis":[135],"confirms":[136],"expectation":[138],"that":[139],"decreases":[143],"with":[144],"increasing":[145],"complexity":[147],"structure.":[150]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}