{"id":"https://openalex.org/W2513602964","doi":"https://doi.org/10.1109/icis.2016.7550767","title":"A simple population based hybrid harmonic estimation algorithm","display_name":"A simple population based hybrid harmonic estimation algorithm","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2513602964","doi":"https://doi.org/10.1109/icis.2016.7550767","mag":"2513602964"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2016.7550767","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","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/A5038392803","display_name":"Emre \u00d6ner Tartan","orcid":"https://orcid.org/0000-0002-5688-4226"},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Emre Oner Tartan","raw_affiliation_strings":["Baskent University, Vocational School of Technical Sciences, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baskent University, Vocational School of Technical Sciences, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001824626","display_name":"Hamit Erdem","orcid":"https://orcid.org/0000-0003-1704-1581"},"institutions":[{"id":"https://openalex.org/I188740104","display_name":"Ba\u015fkent University","ror":"https://ror.org/02v9bqx10","country_code":"TR","type":"education","lineage":["https://openalex.org/I188740104"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Hamit Erdem","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Baskent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Baskent University, Ankara, Turkey","institution_ids":["https://openalex.org/I188740104"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I188740104"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.995199978351593,"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"}},"topics":[{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.995199978351593,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13717","display_name":"Advanced Algorithms and Applications","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7208561301231384},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6822757124900818},{"id":"https://openalex.org/keywords/estimation-of-distribution-algorithm","display_name":"Estimation of distribution algorithm","score":0.5438909530639648},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5133101344108582},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4959755837917328},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4592871367931366},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.41211697459220886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3917592465877533}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7208561301231384},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6822757124900818},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.5438909530639648},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5133101344108582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4959755837917328},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4592871367931366},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.41211697459220886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3917592465877533},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","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.1109/icis.2016.7550767","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2004876064","https://openalex.org/W2010539213","https://openalex.org/W2078458667","https://openalex.org/W2112183087","https://openalex.org/W2117302474","https://openalex.org/W2122122715","https://openalex.org/W2134231130","https://openalex.org/W2151923461","https://openalex.org/W2152195021","https://openalex.org/W3023540311","https://openalex.org/W6636850861"],"related_works":["https://openalex.org/W3016456819","https://openalex.org/W2044138255","https://openalex.org/W2390168659","https://openalex.org/W2115004052","https://openalex.org/W2140656843","https://openalex.org/W2375785848","https://openalex.org/W4382862956","https://openalex.org/W2359271842","https://openalex.org/W2387988578","https://openalex.org/W2376347219"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,13,174],"new":[4],"hybrid":[5,51,134,175],"algorithm":[6,11,19,52,56,83,135],"for":[7,57,62,190],"harmonic":[8,33],"estimation.":[9],"The":[10,50],"combines":[12],"simple":[14],"fast":[15],"population":[16,86],"based":[17,26,192],"search":[18,55,82,94,164],"with":[20,150,181],"Least":[21],"Squares":[22],"Method.":[23],"It":[24],"is":[25,42],"on":[27],"the":[28,32,39,54,67,73,80,85,93,101,113,121,125,132,145,163],"structural":[29],"property":[30],"of":[31,75],"estimation":[34,59,186],"problem":[35],"which":[36,187],"implies":[37],"that":[38,106,131],"signal":[40],"model":[41],"linear":[43],"in":[44,48,97,110,120,168,173],"amplitude":[45,63],"and":[46,60,90,177,184],"nonlinear":[47],"phase.":[49],"uses":[53,107],"phase":[58,78],"LS":[61],"estimation,":[64,79],"iteratively.":[65],"Exploiting":[66],"objective":[68],"function":[69],"defined":[70],"according":[71],"to":[72,161],"error":[74],"single":[76],"harmonic's":[77],"proposed":[81,114,133],"distributes":[84],"through":[87],"equal":[88],"intervals":[89],"simply":[91],"narrows":[92],"space":[95],"sequentially":[96],"every":[98],"generation.":[99],"Unlike":[100],"other":[102,151,169],"heuristic":[103,152],"optimization":[104,153,171],"algorithms":[105,172],"random":[108],"distribution":[109],"initialization":[111],"stage,":[112],"method":[115],"provides":[116],"more":[117],"robust":[118],"convergence":[119],"limits":[122],"determined":[123],"by":[124],"generation":[126],"number.":[127],"Simulation":[128],"results":[129,140],"show":[130],"not":[136],"only":[137],"gives":[138],"accurate":[139],"but":[141],"also":[142],"significantly":[143],"improves":[144],"computation":[146],"time":[147],"when":[148,166],"compared":[149],"algorithms.":[154,193],"Moreover":[155],"this":[156],"approach":[157],"can":[158,179],"be":[159],"used":[160],"reduce":[162],"duration":[165],"involved":[167],"evolutionary":[170],"way":[176],"then":[178],"deal":[180],"frequency":[182],"deviation":[183],"subharmonic":[185],"are":[188],"pitfalls":[189],"DFT":[191]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}