{"id":"https://openalex.org/W1967042012","doi":"https://doi.org/10.1109/rivf.2013.6719883","title":"Semantic based crossovers in Tree-Adjoining Grammar Guided Genetic Programming","display_name":"Semantic based crossovers in Tree-Adjoining Grammar Guided Genetic Programming","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1967042012","doi":"https://doi.org/10.1109/rivf.2013.6719883","mag":"1967042012"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2013.6719883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","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/A5064676003","display_name":"\u0110\u00e0o Ng\u1ecdc Phong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dao Ngoc Phong","raw_affiliation_strings":["ICT Department, Ha Noi People Commitee","ICT Dept., Ha Noi People Commitee, Ha Noi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICT Department, Ha Noi People Commitee","institution_ids":[]},{"raw_affiliation_string":"ICT Dept., Ha Noi People Commitee, Ha Noi, Vietnam","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072769304","display_name":"Nguyen Quang Uy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122257","display_name":"Vietnam Military Medical University","ror":"https://ror.org/02h28kk33","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210122257"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Quang Uy","raw_affiliation_strings":["Faculty of IT, Military Technical Academy, Vietnam","Fac. of IT, Mil. Tech. Acad., Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of IT, Military Technical Academy, Vietnam","institution_ids":["https://openalex.org/I4210122257"]},{"raw_affiliation_string":"Fac. of IT, Mil. Tech. Acad., Vietnam","institution_ids":["https://openalex.org/I4210122257"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088822298","display_name":"Nguy\u1ec5n Xu\u00e2n Ho\u00e0i","orcid":null},"institutions":[{"id":"https://openalex.org/I64519617","display_name":"Hanoi University","ror":"https://ror.org/01mxx0e62","country_code":"VN","type":"education","lineage":["https://openalex.org/I64519617"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Xuan Hoai","raw_affiliation_strings":["Faculty of IT, Hanoi University, Vietnam","Fac. of IT, Hanoi Univ., Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of IT, Hanoi University, Vietnam","institution_ids":["https://openalex.org/I64519617"]},{"raw_affiliation_string":"Fac. of IT, Hanoi Univ., Hanoi, Vietnam","institution_ids":["https://openalex.org/I64519617"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031018426","display_name":"Nguy\u1ec5n Thanh Th\u1ee7y","orcid":"https://orcid.org/0000-0002-9754-9141"},"institutions":[{"id":"https://openalex.org/I142732210","display_name":"University of Engineering and Technology Lahore","ror":"https://ror.org/0051w2v06","country_code":"PK","type":"education","lineage":["https://openalex.org/I142732210"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Nguyen Thanh Thuy","raw_affiliation_strings":["University of Engineering and Technology","Univ. Of Eng. & Technol., Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology","institution_ids":["https://openalex.org/I142732210"]},{"raw_affiliation_string":"Univ. Of Eng. & Technol., Hanoi, Vietnam","institution_ids":["https://openalex.org/I142732210"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0600354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2003","issue":null,"first_page":"141","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"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/T11663","display_name":"Viral Infectious Diseases and Gene Expression in Insects","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.8932288885116577},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8869183659553528},{"id":"https://openalex.org/keywords/symbolic-regression","display_name":"Symbolic regression","score":0.8639119863510132},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7021321058273315},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.5505778789520264},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4834507405757904},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4736924171447754},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46608585119247437},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.4612163305282593},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4373376667499542},{"id":"https://openalex.org/keywords/genetic-representation","display_name":"Genetic representation","score":0.414715975522995},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37386736273765564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21362808346748352},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10162678360939026}],"concepts":[{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.8932288885116577},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8869183659553528},{"id":"https://openalex.org/C2776400721","wikidata":"https://www.wikidata.org/wiki/Q18171762","display_name":"Symbolic regression","level":3,"score":0.8639119863510132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7021321058273315},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.5505778789520264},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4834507405757904},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4736924171447754},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46608585119247437},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.4612163305282593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4373376667499542},{"id":"https://openalex.org/C6135463","wikidata":"https://www.wikidata.org/wiki/Q5532920","display_name":"Genetic representation","level":3,"score":0.414715975522995},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37386736273765564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21362808346748352},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10162678360939026},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2013.6719883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.5400000214576721}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309617","display_name":"National Foundation for Science and Technology Development","ror":"https://ror.org/04rw64z44"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1479758177","https://openalex.org/W1483736078","https://openalex.org/W1498981737","https://openalex.org/W1501730763","https://openalex.org/W1519072852","https://openalex.org/W1527428406","https://openalex.org/W1581584868","https://openalex.org/W1795093649","https://openalex.org/W1969186573","https://openalex.org/W2061011797","https://openalex.org/W2106208871","https://openalex.org/W2130630493","https://openalex.org/W2144172186","https://openalex.org/W2164305954","https://openalex.org/W2214790688","https://openalex.org/W6630989773","https://openalex.org/W6634744848"],"related_works":["https://openalex.org/W1593354505","https://openalex.org/W1963986408","https://openalex.org/W2046401452","https://openalex.org/W2374095020","https://openalex.org/W2164305954","https://openalex.org/W1964607451","https://openalex.org/W4320149932","https://openalex.org/W4315697759","https://openalex.org/W2275389559","https://openalex.org/W4226048488"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"an":[5],"approach":[6],"to":[7],"implementing":[8],"new":[9,25,44,80],"semantic":[10],"based":[11,29,68],"crossover":[12,26],"operators":[13,27,45,81],"in":[14,41],"Tree-Adjoining":[15],"Grammar":[16],"Guided":[17],"Genetic":[18,61],"Programming":[19],"(TAG3P).":[20],"The":[21,43,73],"design":[22],"of":[23,38,52],"the":[24,31,79],"is":[28],"on":[30,49],"non-fixed":[32],"arity":[33],"(also":[34],"called":[35],"feasibility)":[36],"property":[37],"TAG-based":[39],"representation":[40],"TAG3P.":[42,72,89],"are":[46],"then":[47],"tested":[48],"a":[50],"family":[51],"benchmark":[53],"symbolic":[54],"regression":[55],"problems":[56],"and":[57,71,88],"compared":[58],"with":[59,65,78,86],"standard":[60],"programming":[62],"(GP),":[63],"GP":[64,85],"Semantic":[66],"Similarity":[67],"Crossover":[69],"(SSC),":[70],"results":[74],"show":[75],"that":[76],"TAG3P":[77],"significantly":[82],"outperforms":[83],"GP,":[84],"SSC,":[87]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}