Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/35036
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BEKKARI, FOUAD | - |
dc.contributor.author | AYACHI, NOUR ELHOUDA | - |
dc.contributor.author | GHOULA, HADJER | - |
dc.date.accessioned | 2023-11-19T09:22:19Z | - |
dc.date.available | 2023-11-19T09:22:19Z | - |
dc.date.issued | 2023 | - |
dc.identifier.uri | https://dspace.univ-ouargla.dz/jspui/handle/123456789/35036 | - |
dc.description.abstract | Word mismatch problem between the user’s query and the retrieved search results is one of the biggest problems facing the information retrieval(IR) field. Due to this problem, several techniques have been proposed such as query expansion(QE), which improves the IR performance by giving a more suitable extended query for users in comparison to the original query. In this work, we are looking for the best combination of the words in the extended queries using the semantic-based query expansion approach “ConceptNet”. To find these combinations we applied a low-level parallel metaheuristic Iterated local search(ILS) and a high-level parallel metaheuristic Accelerated particle swarm optimization(APSO) with Local search. | en_US |
dc.language.iso | en | en_US |
dc.publisher | UNIVERSITY OF KASDI MERBAH OUARGLA | en_US |
dc.subject | Information retrieval | en_US |
dc.subject | Query expansion | en_US |
dc.subject | ConceptNet | en_US |
dc.subject | Iterated local search(ILS) | en_US |
dc.subject | Accelerated particle swarm optimization(APSO) | en_US |
dc.subject | Parallel metaheuristic | en_US |
dc.title | PARALLEL METAHEURISTIC FOR SEMANTIC BASED QUERY EXPANSION | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Département d'informatique et technologie de l'information - Master |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AYACHI-GHOULA.pdf | 1,01 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.