A Fireworks Algorithm for Modern Web Information Retrieval with Visual Results Mining

2016 ◽  
pp. 649-668
Author(s):  
Hadj Ahmed Bouarara ◽  
Reda Mohamed Hamou ◽  
Abdelmalek Amine ◽  
Amine Rahmani

The popularization of computers, the number of electronic documents available online /offline and the explosion of electronic communication have deeply rocked the relationship between man and information. Nowadays, we are awash in a rising tide of information where the web has impacted on almost every aspect of our life. Merely, the development of automatic tools for an efficient access to this huge amount of digital information appears as a necessity. This paper deals on the unveiling of a new web information retrieval system using fireworks algorithm (FWA-IR). It is based on a random explosion of fireworks and a set of operators (displacement, mapping, mutation, and selection). Each explosion of firework is a potential solution for the need of user (query). It generates a set of sparks (documents) with two locations (relevant and irrelevant). The authors experiments were performed on the MEDLARS dataset and using the validation measures (recall, precision, f-measure, silence, noise and accuracy) by studying the sensitive parameters of this technique (initial location number, iteration number, mutation probability, fitness function, selection method, text representation, and distance measure), aimed to show the benefit derived from using such approach compared to the results of others methods existed in literature (taboo search, simulated annealing, and naïve method). Finally, a result-mining tool was achieved for the purpose to see the outcome in graphical form (3d cub and cobweb) with more realism using the functionalities of zooming and rotation.

2015 ◽  
Vol 6 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Hadj Ahmed Bouarara ◽  
Reda Mohamed Hamou ◽  
Abdelmalek Amine ◽  
Amine Rahmani

The popularization of computers, the number of electronic documents available online /offline and the explosion of electronic communication have deeply rocked the relationship between man and information. Nowadays, we are awash in a rising tide of information where the web has impacted on almost every aspect of our life. Merely, the development of automatic tools for an efficient access to this huge amount of digital information appears as a necessity. This paper deals on the unveiling of a new web information retrieval system using fireworks algorithm (FWA-IR). It is based on a random explosion of fireworks and a set of operators (displacement, mapping, mutation, and selection). Each explosion of firework is a potential solution for the need of user (query). It generates a set of sparks (documents) with two locations (relevant and irrelevant). The authors experiments were performed on the MEDLARS dataset and using the validation measures (recall, precision, f-measure, silence, noise and accuracy) by studying the sensitive parameters of this technique (initial location number, iteration number, mutation probability, fitness function, selection method, text representation, and distance measure), aimed to show the benefit derived from using such approach compared to the results of others methods existed in literature (taboo search, simulated annealing, and naïve method). Finally, a result-mining tool was achieved for the purpose to see the outcome in graphical form (3d cub and cobweb) with more realism using the functionalities of zooming and rotation.


Information retrieval is a key technology in accessing the vast amount of data present on today’s World Wide Web. Numerous challenges arise at various stages of information retrieval from the web, such as missing of plenteous relevant documents, static user queries, ever changing and tremendous amount of document collection and so forth. Therefore, more powerful strategies are required to search for relevant documents. In this paper, a PSO methodology is proposed which is hybridized with Simulated Annealing with the aim of optimizing Web Information Retrieval (WIR) process. Hybridized PSO has a high impact on reducing the query response time of the system and hence subsidizes the system efficiency. A novel similarity measure called SMDR acts as a fitness function in the hybridized PSO-SA algorithm. Evaluations measures such as accuracy, MRR, MAP, DCG, IDCG, F-measure and specificity are used to measure the effectiveness of the proposed system and to compare it with existing system as well. Ultimately, experiments are extensively carried out on a huge RCV1 collections. Achieved precision-recall rates demonstrate the considerably improved effectiveness of the proposed system than that of existing one.


Author(s):  
Tarek Alloui ◽  
Imane Boussebough ◽  
Allaoua Chaoui

The Web has become the largest source of information worldwide and the information, in its various forms, is growing exponentially. So obtaining relevant and up-to-date information has become hard and tedious. This situation led to the emergence of search engines which index today billions of pages. However, they are generic services and they try to aim the largest number of users without considering their information needs in the search process. Moreover, users use generally few words to formulate their queries giving incomplete specifications of their information needs. So dealing this problem within Web context using traditional approaches is vain. This paper presents a novel particle swarm optimization approach for Web information retrieval. It uses relevance feedback to reformulate user query and thus improve the number of relevant results. In the authors' experimental results, they obtained a significant improvement of relevant results using their proposed approach comparing to what is obtained using only the user query into a search engine.


2015 ◽  
Vol 11 (3) ◽  
pp. 15-29 ◽  
Author(s):  
Tarek Alloui ◽  
Imane Boussebough ◽  
Allaoua Chaoui

The Web has become the largest source of information worldwide and the information, in its various forms, is growing exponentially. So obtaining relevant and up-to-date information has become hard and tedious. This situation led to the emergence of search engines which index today billions of pages. However, they are generic services and they try to aim the largest number of users without considering their information needs in the search process. Moreover, users use generally few words to formulate their queries giving incomplete specifications of their information needs. So dealing this problem within Web context using traditional approaches is vain. This paper presents a novel particle swarm optimization approach for Web information retrieval. It uses relevance feedback to reformulate user query and thus improve the number of relevant results. In the authors' experimental results, they obtained a significant improvement of relevant results using their proposed approach comparing to what is obtained using only the user query into a search engine.


2013 ◽  
Vol 76 (1) ◽  
pp. 29-32
Author(s):  
Vikas Thada ◽  
Vivek Jaglan

Sign in / Sign up

Export Citation Format

Share Document