FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2901274976> ?p ?o ?g. }

• W2901274976 endingPage "1728" @default.
• W2901274976 startingPage "1728" @default.
• W2901274976 abstract "Feature selection or the process of selecting the most discriminating feature subset is an essential practice in speech processing that significantly affects the performance of classification. However, the volume of features that presents in speech processing makes the feature selection perplexing. Moreover, finding the optimal feature subset is a NP-hard problem (2ⁿ). Thus, a good searching strategy is required to avoid evaluating large number of combinations in the whole feature subsets. As a result, in recent years, many heuristic based search algorithms are developed to address this NP-hard problem. One of the several meta heuristic algorithms that is applied in many application domains to solve feature selection problem is Ant Colony Optimization (ACO) based algorithms. ACO based algorithms are nature-inspired from the foraging behavior of actual ants. The success of an ACO based feature selection algorithm depends on the choice of the construction graph with respect to runtime behavior. While most ACO based feature selection algorithms use fully connected graphs, this paper proposes ACO based algorithm that uses graphs with prescribed degree sequences. In this method, the degree of the graph representing the search space will be predicted and the construction graph that satisfies the predicted degree will be generated. This research direction on graph representation for ACO algorithms may offer possibilities to reduce computation complexity from O(n²) to O(nm) in which m is the number of edges. This paper outlines some popular optimization based feature selection algorithms in the field of speech processing applications and overviewed ACO algorithm and its main variants. In addition to that, ACO based feature selection is explained and its application in various speech processing tasks is reviewed. Finally, a degree based graph construction for ACO algorithms is proposed." @default.
• W2901274976 created "2018-11-29" @default.
• W2901274976 creator A5021709504 @default.
• W2901274976 creator A5050234792 @default.
• W2901274976 date "2018-09-30" @default.
• W2901274976 modified "2023-09-25" @default.
• W2901274976 title "Ant Colony Optimization Based Subset Feature Selection in Speech Processing: Constructing Graphs with Degree Sequences" @default.
• W2901274976 cites W1557288165 @default.
• W2901274976 cites W1566652554 @default.
• W2901274976 cites W1801849579 @default.
• W2901274976 cites W1999999586 @default.
• W2901274976 cites W2040710789 @default.
• W2901274976 cites W2042865020 @default.
• W2901274976 cites W2053410046 @default.
• W2901274976 cites W2107941094 @default.
• W2901274976 cites W2111124271 @default.
• W2901274976 cites W2136222411 @default.
• W2901274976 cites W2154929945 @default.
• W2901274976 cites W2289709731 @default.
• W2901274976 cites W2343420905 @default.
• W2901274976 cites W2571661779 @default.
• W2901274976 cites W2606694865 @default.
• W2901274976 cites W3102797530 @default.
• W2901274976 cites W874310575 @default.
• W2901274976 doi "https://doi.org/10.18517/ijaseit.8.4-2.6812" @default.
• W2901274976 hasPublicationYear "2018" @default.
• W2901274976 type Work @default.
• W2901274976 sameAs 2901274976 @default.
• W2901274976 citedByCount "3" @default.
• W2901274976 countsByYear W29012749762020 @default.
• W2901274976 countsByYear W29012749762023 @default.
• W2901274976 crossrefType "journal-article" @default.
• W2901274976 hasAuthorship W2901274976A5021709504 @default.
• W2901274976 hasAuthorship W2901274976A5050234792 @default.
• W2901274976 hasBestOaLocation W29012749761 @default.
• W2901274976 hasConcept C11413529 @default.
• W2901274976 hasConcept C132525143 @default.
• W2901274976 hasConcept C138885662 @default.
• W2901274976 hasConcept C148483581 @default.
• W2901274976 hasConcept C153180895 @default.
• W2901274976 hasConcept C154945302 @default.
• W2901274976 hasConcept C173801870 @default.
• W2901274976 hasConcept C2776401178 @default.
• W2901274976 hasConcept C40128228 @default.
• W2901274976 hasConcept C41008148 @default.
• W2901274976 hasConcept C41895202 @default.
• W2901274976 hasConcept C80444323 @default.
• W2901274976 hasConceptScore W2901274976C11413529 @default.
• W2901274976 hasConceptScore W2901274976C132525143 @default.
• W2901274976 hasConceptScore W2901274976C138885662 @default.
• W2901274976 hasConceptScore W2901274976C148483581 @default.
• W2901274976 hasConceptScore W2901274976C153180895 @default.
• W2901274976 hasConceptScore W2901274976C154945302 @default.
• W2901274976 hasConceptScore W2901274976C173801870 @default.
• W2901274976 hasConceptScore W2901274976C2776401178 @default.
• W2901274976 hasConceptScore W2901274976C40128228 @default.
• W2901274976 hasConceptScore W2901274976C41008148 @default.
• W2901274976 hasConceptScore W2901274976C41895202 @default.
• W2901274976 hasConceptScore W2901274976C80444323 @default.
• W2901274976 hasIssue "4-2" @default.
• W2901274976 hasLocation W29012749761 @default.
• W2901274976 hasOpenAccess W2901274976 @default.
• W2901274976 hasPrimaryLocation W29012749761 @default.
• W2901274976 hasRelatedWork W2159220931 @default.
• W2901274976 hasRelatedWork W2316780152 @default.
• W2901274976 hasRelatedWork W2374344280 @default.
• W2901274976 hasRelatedWork W2376619456 @default.
• W2901274976 hasRelatedWork W2546942002 @default.
• W2901274976 hasRelatedWork W2554403468 @default.
• W2901274976 hasRelatedWork W2592385986 @default.
• W2901274976 hasRelatedWork W27971500 @default.
• W2901274976 hasRelatedWork W4307883119 @default.
• W2901274976 hasRelatedWork W2345184372 @default.
• W2901274976 hasVolume "8" @default.
• W2901274976 isParatext "false" @default.
• W2901274976 isRetracted "false" @default.
• W2901274976 magId "2901274976" @default.
• W2901274976 workType "article" @default.