{"id":"https://openalex.org/W2461499990","doi":"https://doi.org/10.1109/tcyb.2016.2552079","title":"Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation","display_name":"Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation","publication_year":2016,"publication_date":"2016-06-24","ids":{"openalex":"https://openalex.org/W2461499990","doi":"https://doi.org/10.1109/tcyb.2016.2552079","mag":"2461499990","pmid":"https://pubmed.ncbi.nlm.nih.gov/27352402"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2016.2552079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2016.2552079","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5103400829","display_name":"Minh Luan Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I3005327000","display_name":"Institute for Infocomm Research","ror":"https://ror.org/053rfa017","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I3005327000","https://openalex.org/I91275662"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Minh Luan Nguyen","raw_affiliation_strings":["Institute for Infocomm Research, A*Star, Singapore"],"affiliations":[{"raw_affiliation_string":"Institute for Infocomm Research, A*Star, Singapore","institution_ids":["https://openalex.org/I3005327000"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111739946","display_name":"Siu Cheung Hui","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Siu Cheung Hui","raw_affiliation_strings":["Department of Computer Engineering, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005401414","display_name":"A.C.M. Fong","orcid":"https://orcid.org/0000-0001-8596-675X"},"institutions":[{"id":"https://openalex.org/I4210158759","display_name":"University of Glasgow Singapore","ror":"https://ror.org/05jzgzx91","country_code":"SG","type":"education","lineage":["https://openalex.org/I4210158759"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Alvis C. M. Fong","raw_affiliation_strings":["Department of Computing Science, University of Glasgow, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Glasgow, Singapore","institution_ids":["https://openalex.org/I4210158759"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103400829"],"corresponding_institution_ids":["https://openalex.org/I3005327000"],"apc_list":null,"apc_paid":null,"fwci":1.78,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.89058446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"47","issue":"6","first_page":"1562","last_page":"1575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940999746322632,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9940999746322632,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9771000146865845,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9746999740600586,"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/submodular-set-function","display_name":"Submodular set function","score":0.9258629679679871},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7122007012367249},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.7048085927963257},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5820046067237854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5725178718566895},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5433881282806396},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.48731574416160583},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4545641541481018},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32822319865226746},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.2955395579338074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19708019495010376}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9258629679679871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7122007012367249},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7048085927963257},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5820046067237854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5725178718566895},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5433881282806396},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.48731574416160583},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4545641541481018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32822319865226746},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2955395579338074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19708019495010376}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tcyb.2016.2552079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2016.2552079","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Cybernetics","raw_type":"journal-article"},{"id":"pmid:27352402","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/27352402","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE transactions on cybernetics","raw_type":null},{"id":"pmh:oai:eprints.gla.ac.uk:123211","is_oa":false,"landing_page_url":"http://eprints.gla.ac.uk/view/author/30576.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W166068347","https://openalex.org/W601739640","https://openalex.org/W1498671329","https://openalex.org/W1531340371","https://openalex.org/W1576820654","https://openalex.org/W1589196414","https://openalex.org/W1600130330","https://openalex.org/W1680189815","https://openalex.org/W1918283942","https://openalex.org/W1989453388","https://openalex.org/W1989801809","https://openalex.org/W2013518095","https://openalex.org/W2019932779","https://openalex.org/W2033885045","https://openalex.org/W2035575256","https://openalex.org/W2035960005","https://openalex.org/W2042464029","https://openalex.org/W2050511894","https://openalex.org/W2053381548","https://openalex.org/W2062061003","https://openalex.org/W2066293034","https://openalex.org/W2066933614","https://openalex.org/W2072137234","https://openalex.org/W2080458282","https://openalex.org/W2081939577","https://openalex.org/W2095794917","https://openalex.org/W2097536098","https://openalex.org/W2102771160","https://openalex.org/W2104274529","https://openalex.org/W2114620686","https://openalex.org/W2114791779","https://openalex.org/W2117522162","https://openalex.org/W2122510010","https://openalex.org/W2123838014","https://openalex.org/W2126105956","https://openalex.org/W2126307323","https://openalex.org/W2138207818","https://openalex.org/W2143376842","https://openalex.org/W2506152732","https://openalex.org/W2992918992","https://openalex.org/W3016005719","https://openalex.org/W6635351750","https://openalex.org/W6771210241"],"related_works":["https://openalex.org/W2318617794","https://openalex.org/W2132985225","https://openalex.org/W1481410647","https://openalex.org/W4295205538","https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2950365512","https://openalex.org/W2735578456","https://openalex.org/W3204684126"],"abstract_inverted_index":{"Parallel":[0],"test":[1,18,30],"paper":[2,161],"generation":[3],"is":[4,32,62],"a":[5,50,131],"biobjective":[6],"distributed":[7],"resource":[8],"optimization":[9],"problem,":[10],"which":[11,68],"aims":[12],"to":[13,22,35,78],"generate":[14],"multiple":[15,23],"similarly":[16],"optimal":[17],"papers":[19,31],"automatically":[20],"according":[21],"user-specified":[24],"assessment":[25],"criteria.":[26],"Generating":[27],"high-quality":[28],"parallel":[29],"challenging":[33],"due":[34],"its":[36],"NP-hardness":[37],"in":[38,130,138,158],"both":[39],"of":[40,73,86,93,101,135,160],"the":[41,70,74,87,91,99,102,112,118,155],"collective":[42,75],"objective":[43,76,116],"functions.":[44],"In":[45],"this":[46,57],"paper,":[47],"we":[48],"propose":[49],"submodular":[51,71,94,104],"memetic":[52,65],"approximation":[53,81],"algorithm":[54,61,66,108,151],"for":[55,83],"solving":[56],"problem.":[58],"The":[59],"proposed":[60],"an":[63],"adaptive":[64],"(MA),":[67],"exploits":[69],"property":[72],"functions":[77],"design":[79],"greedy-based":[80],"algorithms":[82],"enhancing":[84],"steps":[85],"multiobjective":[88],"MA.":[89],"Synergizing":[90],"intensification":[92],"local":[95],"search":[96,133],"mechanism":[97],"with":[98],"diversification":[100],"population-based":[103],"crossover":[105],"operator,":[106],"our":[107,150],"can":[109,125],"jointly":[110],"optimize":[111],"total":[113],"quality":[114,120,162],"maximization":[115,121],"and":[117,163],"fairness":[119],"objective.":[122],"Our":[123],"MA":[124],"achieve":[126],"provable":[127],"near-optimal":[128],"solutions":[129],"huge":[132],"space":[134],"large":[136],"datasets":[137,146],"efficient":[139],"polynomial":[140],"runtime.":[141],"Performance":[142],"results":[143],"on":[144],"various":[145],"have":[147],"shown":[148],"that":[149],"has":[152],"drastically":[153],"outperformed":[154],"current":[156],"techniques":[157],"terms":[159],"runtime":[164],"efficiency.":[165]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}