Toward Efficient Ranked-key Algorithm for the Web notification of Big Data Systems

Tourad, Mohamedou Cheikh; Abdali, Abdelmounaïm

doi:10.1145/3090354.3090386

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A comparative study has also been presented to explain how onovel approach can overcome the limitations and weaknesses of the existing methods. This approach will help us develop an intelligent filtering of the pub-sub system [20,21].…”

Section: Resultsmentioning

confidence: 99%

An Intelligent Similarity Model between Generalized Trapezoidal Fuzzy Numbers in Large Scale

Tourad¹,

Abdali²

2018

IJFIS

Self Cite

View full text Add to dashboard Cite

The rapid expansion of data published on the web has given rise to the similarity problem on a large scale, a very important subject for scientific research in the field of computer science. Several methods have been developed for this. In this paper, we propose the first mathematical model to find the similarity value between generalized trapezoidal fuzzy numbers (GTFNs). This model employs fuzzy inference systems to find the value of an effective weighting, the weights to be associated to different kinds of methods that can handle an important scale of the data. This model will allow us to develop intelligent systems. A comparative study based on 21 sets of GTFNs has been carried out to demonstrate the difference between our approach and existing methods. This study shows that our model is more reasonable than existing methods.

show abstract

Section: Resultsmentioning

confidence: 99%

An Intelligent Similarity Model between Generalized Trapezoidal Fuzzy Numbers in Large Scale

Tourad¹,

Abdali²

2018

IJFIS

Self Cite

View full text Add to dashboard Cite

show abstract

“…Only subscription is new Ranked-key index proposed by Tourad, M.C. et al [12], [13] in 2017. With regard to CILs (Count-based Inverted List) and RILs (Ranked key Inverted List), which are based on inverted lists proposed by Hmedeh, Z. et al [14] in 2016, the CIL algorithm is used to count key terms of the subscription item (Count-based), whereas the aim of the RIL algorithm is to identify the least frequent term within a particular subscription (Ranked-key).…”

Section: B Counter and Inverted-listsmentioning

confidence: 99%

A New Ranked-Key Structure for Intelligent Pub-Sub Systems in Large Scale

Tourad*,

Abdali

2019

IJEAT

Self Cite

View full text Add to dashboard Cite

The rapid growth of information published on the net and the subsequent increase of the number of it users was the reason behind the discovery of Web syndication. The Pub/sub (Publish/Subscribe) system is the first and the most used system for web syndication. It allows the user to keep an eye on the development of the information that interested him. This information is managed by data collectors (RSS : Really Simple Syndication) in real time. Today, the development of new notifications systems is essential for the retrieval of specific information from the Big Data. In the present work, a new algorithm based on Ranked key is proposed. Such indexation allows the development of an efficient and an intelligent system.

show abstract

Toward Efficient Ranked-key Algorithm for the Web notification of Big Data Systems

Cited by 2 publications

References 12 publications

An Intelligent Similarity Model between Generalized Trapezoidal Fuzzy Numbers in Large Scale

An Intelligent Similarity Model between Generalized Trapezoidal Fuzzy Numbers in Large Scale

A New Ranked-Key Structure for Intelligent Pub-Sub Systems in Large Scale

Contact Info

Product

Resources

About