Falah Hassan Ali Al-Akashi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Falah Hassan Ali Al-Akashi has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Diana Inkpen
University of Ottawa, Canada
2 shared publications- Diana Inkpen
University of Ottawa
1 shared publication
Latest Publications
- Open Access
- 25 June 2024
- Published by Faculty of Organisation and Informatics in Journal of information and organizational sciences
- Vol. 48 (1) , 1-17
Relevancy between Anchor Text and Wikipedia. A Web Search Framework
The overall volume of data available on the Internet is growing rapidly while finding relevant documents is becoming increasingly difficult. Moreover, queries entered by users are unique, unstructured and often ambiguous while the process has changed dramatically from standard query languages that governed by strict syntax rules to unstructured strings. In Web information retrieval, search paradigms used term occurrences to weight document content prior to any boosting stage. PageRank algorithm, for instance, was used integrated techniques to enhance post retrieval document relevancy to adequately compromise the overall process in two stages. Nevertheless, hypertexts in Web have been used for improving the quality of search results for the most common type of queries. Our main premise is that hypertexts play an important role for ranking documents in IR such as margining between user queries and consensus hypertext. We propose a new algorithm that uses term impact technology for compromising hypertext weighting in Web along with Wikipedia for efficiently find most relevant documents among large set of results. Our experimental results showed that Wikipedia could efficiently improve document relevancy rank when combined with hypertexts for exhibit robust and very good short-term process capability.
- 25 June 2024
- Published by Faculty of Organisation and Informatics in Journal of information and organizational sciences
- Vol. 48 (1) , 1-17
Open AccessRelevancy between Anchor Text and Wikipedia. A Web Search Framework
The overall volume of data available on the Internet is growing rapidly while finding relevant documents is becoming increasingly difficult. Moreover, queries entered by users are unique, unstructured and often ambiguous while the process has changed dramatically from standard query languages that governed by strict syntax rules to unstructured strings. In Web information retrieval, search paradigms used term occurrences to weight document content prior to any boosting stage. PageRank algorithm, for instance, was used integrated techniques to enhance post retrieval document relevancy to adequately compromise the overall process in two stages. Nevertheless, hypertexts in Web have been used for improving the quality of search results for the most common type of queries. Our main premise is that hypertexts play an important role for ranking documents in IR such as margining between user queries and consensus hypertext. We propose a new algorithm that uses term impact technology for compromising hypertext weighting in Web along with Wikipedia for efficiently find most relevant documents among large set of results. Our experimental results showed that Wikipedia could efficiently improve document relevancy rank when combined with hypertexts for exhibit robust and very good short-term process capability.
- Open Access
- 1 January 2022
- Published by IGI Global Scientific Publishing in International Journal of Intelligent Information Technologies
- Vol. 18 (1) , 1-19
A New Adaptive Indexing for Real-Time Web Search
Adaptive indexing is an alternative to the self-tuning methods. It is especially useful in the scenario of unpredictable workload, and there is no idle time to invest in index creation. The authors present their ongoing work on a new realistic adaptive indexing that transforms the previous data crawling offline approach to a data-driven online approach. The proposed approach consists of three tasks: topic prediction, resource selection, and results combination and ranking. They work simultaneously to retrieve highly relevant results to the user's query in real time. To make the index highly refreshed and up-to-date, they collected data from highly prominent resources (e.g., Facebook, Twitter, Wikipedia, etc.). The empirical results showed that the proposed model is better than the traditional models that work offline and spend hours or days for building the index in different periods. In addition, the experiments showed that the training results are highly relevant for adhoc and diversity tasks. Request access from your librarian to read this article's full text.
- 1 January 2022
- Published by IGI Global Scientific Publishing in International Journal of Intelligent Information Technologies
- Vol. 18 (1) , 1-19
Open AccessA New Adaptive Indexing for Real-Time Web Search
Adaptive indexing is an alternative to the self-tuning methods. It is especially useful in the scenario of unpredictable workload, and there is no idle time to invest in index creation. The authors present their ongoing work on a new realistic adaptive indexing that transforms the previous data crawling offline approach to a data-driven online approach. The proposed approach consists of three tasks: topic prediction, resource selection, and results combination and ranking. They work simultaneously to retrieve highly relevant results to the user's query in real time. To make the index highly refreshed and up-to-date, they collected data from highly prominent resources (e.g., Facebook, Twitter, Wikipedia, etc.). The empirical results showed that the proposed model is better than the traditional models that work offline and spend hours or days for building the index in different periods. In addition, the experiments showed that the training results are highly relevant for adhoc and diversity tasks. Request access from your librarian to read this article's full text.
- Open Access
- 1 January 2022
- Published by IGI Global Scientific Publishing in Journal of Information Technology Research
- Vol. 15 (1) , 1-16
Stock Market Index Prediction Using Artificial Neural Network
Often, nonlinearity exists in the financial markets while Artificial Neural Network (ANN) could be used to expect equity market returns for the next years. ANN has been improved its ability to forecast the daily stock exchange rate and to investigate several feeds using the back propagation algorithm. The proposed research utilized five neural network models, Elman network, Multilayer Perceptron (MLP) network, Elman network with Self-Optimizing Map (SOM), MLP with SOM filter and simple linear regression, for estimating new values. Results were examined to investigate the predicting ability and to provide an effective feeds for future values. The result of the proposed simulation showed that SOM could greatly improve the convergence of the neuron networks; whereas Elman network did a better performance to capture the temporal pattern of the symbolic streams generated by SOM.A benchmark of linear regression model was also employed to show the ability of neural network models to generate higher accuracy in forecasting financial market index.
- 1 January 2022
- Published by IGI Global Scientific Publishing in Journal of Information Technology Research
- Vol. 15 (1) , 1-16
Open AccessStock Market Index Prediction Using Artificial Neural Network
Often, nonlinearity exists in the financial markets while Artificial Neural Network (ANN) could be used to expect equity market returns for the next years. ANN has been improved its ability to forecast the daily stock exchange rate and to investigate several feeds using the back propagation algorithm. The proposed research utilized five neural network models, Elman network, Multilayer Perceptron (MLP) network, Elman network with Self-Optimizing Map (SOM), MLP with SOM filter and simple linear regression, for estimating new values. Results were examined to investigate the predicting ability and to provide an effective feeds for future values. The result of the proposed simulation showed that SOM could greatly improve the convergence of the neuron networks; whereas Elman network did a better performance to capture the temporal pattern of the symbolic streams generated by SOM.A benchmark of linear regression model was also employed to show the ability of neural network models to generate higher accuracy in forecasting financial market index.
- 1 January 2022
- Published by IGI Global Scientific Publishing in International Journal of Software Innovation
- Vol. 10 (1) , 1-14
A Scalable Real-Time Agent-Based Information Retrieval Engine
In distributed information retrieval systems, information in web should be ranked based on a combination of multiple features. Linear combination of ranks has been the dominant approach due to its simplicity and efficiency. Such a combination scheme in distributed infrastructure requires that ranks in resources or agents are comparable to each other. The main challenge is how to transform the raw rank values of different criteria appropriately to make them comparable before any combination. In this manuscript, we will demonstrate how to rank Web documents based on its resource-provided information stream and how to combine and incorporate several raking schemas in one time. The system was tested on the queries provided by a Text Retrieval Conference (TREC), and our experimental results showed that it is robust and efficient compared with similar platforms that used offline data resources.
- 1 January 2022
- Published by IGI Global Scientific Publishing in International Journal of Software Innovation
- Vol. 10 (1) , 1-14
A Scalable Real-Time Agent-Based Information Retrieval Engine
In distributed information retrieval systems, information in web should be ranked based on a combination of multiple features. Linear combination of ranks has been the dominant approach due to its simplicity and efficiency. Such a combination scheme in distributed infrastructure requires that ranks in resources or agents are comparable to each other. The main challenge is how to transform the raw rank values of different criteria appropriately to make them comparable before any combination. In this manuscript, we will demonstrate how to rank Web documents based on its resource-provided information stream and how to combine and incorporate several raking schemas in one time. The system was tested on the queries provided by a Text Retrieval Conference (TREC), and our experimental results showed that it is robust and efficient compared with similar platforms that used offline data resources.
- 1 April 2021
- Published by IGI Global Scientific Publishing in International Journal of Intelligent Information Technologies
- Vol. 17 (2) , 96-106
Analysing Twitter Data for Phishing Tweets Identification
Detecting threats like adult, violent, and phishing tweets on online social networks is a crucial issue in recent years. The aim of the work is to identify phishing content from the users' perspective in real-time tweets. To outline such content comprehensively, lexicon analysis with sentiments are encapsulated to investigate tweets that yield phishing dynamic keywords, while some features and parameters are altered to optimize the performance. To support the preliminary study, the approach is rigorously designed to assemble users' opinions on completely different classes of phishing content. Each direct and indirect opinions as well as recently projected opinions are listed to characterize all sorts of phishing content. The authors use word level analysis with sentiments to build keyword blacklist lexicons. High promising results and high level of accuracy and performance are obtained experimentally if compared with the alternative algorithms.
- 1 April 2021
- Published by IGI Global Scientific Publishing in International Journal of Intelligent Information Technologies
- Vol. 17 (2) , 96-106
Analysing Twitter Data for Phishing Tweets Identification
Detecting threats like adult, violent, and phishing tweets on online social networks is a crucial issue in recent years. The aim of the work is to identify phishing content from the users' perspective in real-time tweets. To outline such content comprehensively, lexicon analysis with sentiments are encapsulated to investigate tweets that yield phishing dynamic keywords, while some features and parameters are altered to optimize the performance. To support the preliminary study, the approach is rigorously designed to assemble users' opinions on completely different classes of phishing content. Each direct and indirect opinions as well as recently projected opinions are listed to characterize all sorts of phishing content. The authors use word level analysis with sentiments to build keyword blacklist lexicons. High promising results and high level of accuracy and performance are obtained experimentally if compared with the alternative algorithms.
- 22 December 2020
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 44 (7) , 633-640
SAMA: a real-time Web search architecture
With the increasing number of information resources in the World Wide Web, how to retrieve real-time information is becoming very important. The resources include traditional databases, flat files, knowledge bases, topical content and programs. In this paper, we propose a new model for retrieving high-quality data from distributed Web resources over the Internet. Unlike traditional models which are web crawler-based algorithms and collect data prior to indexing, supposedly making the process going offline, the proposed algorithm embeds the crawling process with the searching process to make the process more realistic since data are collected and indexed in real-time fashion. We aim to get high-quality and refreshed results for every user’s query, as well as, for better query expansion and formulation. In our experiments, we found that the proposed approach was highly relevant for most recently searched queries, consisting in its performance and resilient to the drawbacks faced by other techniques.
- 22 December 2020
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 44 (7) , 633-640
SAMA: a real-time Web search architecture
With the increasing number of information resources in the World Wide Web, how to retrieve real-time information is becoming very important. The resources include traditional databases, flat files, knowledge bases, topical content and programs. In this paper, we propose a new model for retrieving high-quality data from distributed Web resources over the Internet. Unlike traditional models which are web crawler-based algorithms and collect data prior to indexing, supposedly making the process going offline, the proposed algorithm embeds the crawling process with the searching process to make the process more realistic since data are collected and indexed in real-time fashion. We aim to get high-quality and refreshed results for every user’s query, as well as, for better query expansion and formulation. In our experiments, we found that the proposed approach was highly relevant for most recently searched queries, consisting in its performance and resilient to the drawbacks faced by other techniques.