Sayyed A. Hossayni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sayyed A. Hossayni has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Aldo Gangemi
University of Bologna
2 shared publications - Kourosh Parand
Department of Computer Sciences Shahid Beheshti University Tehran G.C Iran
2 shared publications - Mohammad Reza Akbarzadeh Tootoonchi
Department of Electrical Engineering, Center of Excellence on Soft Computing and Intelligent Information Processing, Ferdowsi University of Mashhad, Mashhad, Iran
2 shared publications - Behrouz Minaei-Bidgoli
Iran University of Science and Technology
1 shared publication - Diego Reforgiato Recupero
University of Cagliari
1 shared publication - Diego Reforgiato Recupero
Institute of Cognitive Sciences and Technologies (ISTC) Semantic Technology Lab Italian National Research Council (CNR) Italy
1 shared publication
Latest Publications
- Open Access
Interval Probabilistic Fuzzy WordNet
WordNet lexical-database groups English words into sets of synonyms called "synsets." Synsets are utilized for several applications in the field of text-mining. However, they were also open to criticism because although, in reality, not all the members of a synset represent the meaning of that synset with the same degree, in practice, they are considered as members of the synset, identically. Thus, the fuzzy version of synsets, called fuzzy-synsets (or fuzzy word-sense classes) were proposed and studied. In this study, we discuss why (type-1) fuzzy synsets (T1 F-synsets) do not properly model the membership uncertainty, and propose an upgraded version of fuzzy synsets in which membership degrees of word-senses are represented by intervals, similar to what in Interval Type 2 Fuzzy Sets (IT2 FS) and discuss that IT2 FS theoretical framework is insufficient for analysis and design of such synsets, and propose a new concept, called Interval Probabilistic Fuzzy (IPF) sets. Then we present an algorithm for constructing the IPF synsets in any language, given a corpus and a word-sense-disambiguation system. Utilizing our algorithm and the open-American-online-corpus (OANC) and UKB word-sense-disambiguation, we constructed and published the IPF synsets of WordNet for English language.
Open AccessInterval Probabilistic Fuzzy WordNet
WordNet lexical-database groups English words into sets of synonyms called "synsets." Synsets are utilized for several applications in the field of text-mining. However, they were also open to criticism because although, in reality, not all the members of a synset represent the meaning of that synset with the same degree, in practice, they are considered as members of the synset, identically. Thus, the fuzzy version of synsets, called fuzzy-synsets (or fuzzy word-sense classes) were proposed and studied. In this study, we discuss why (type-1) fuzzy synsets (T1 F-synsets) do not properly model the membership uncertainty, and propose an upgraded version of fuzzy synsets in which membership degrees of word-senses are represented by intervals, similar to what in Interval Type 2 Fuzzy Sets (IT2 FS) and discuss that IT2 FS theoretical framework is insufficient for analysis and design of such synsets, and propose a new concept, called Interval Probabilistic Fuzzy (IPF) sets. Then we present an algorithm for constructing the IPF synsets in any language, given a corpus and a word-sense-disambiguation system. Utilizing our algorithm and the open-American-online-corpus (OANC) and UKB word-sense-disambiguation, we constructed and published the IPF synsets of WordNet for English language.
- Open Access
An Algorithm for Fuzzification of WordNets, Supported by a Mathematical Proof
WordNet-like Lexical Databases (WLDs) group English words into sets of synonyms called "synsets." Although the standard WLDs are being used in many successful Text-Mining applications, they have the limitation that word-senses are considered to represent the meaning associated to their corresponding synsets, to the same degree, which is not generally true. In order to overcome this limitation, several fuzzy versions of synsets have been proposed. A common trait of these studies is that, to the best of our knowledge, they do not aim to produce fuzzified versions of the existing WLD's, but build new WLDs from scratch, which has limited the attention received from the Text-Mining community, many of whose resources and applications are based on the existing WLDs. In this study, we present an algorithm for constructing fuzzy versions of WLDs of any language, given a corpus of documents and a word-sense disambiguation (WSD) system for that language. Then, using the Open-American-National-Corpus and UKB WSD as algorithm inputs, we construct and publish online the fuzzified version of English WordNet (FWN). We also propose a theoretical (mathematical) proof of the validity of its results.
Open AccessAn Algorithm for Fuzzification of WordNets, Supported by a Mathematical Proof
WordNet-like Lexical Databases (WLDs) group English words into sets of synonyms called "synsets." Although the standard WLDs are being used in many successful Text-Mining applications, they have the limitation that word-senses are considered to represent the meaning associated to their corresponding synsets, to the same degree, which is not generally true. In order to overcome this limitation, several fuzzy versions of synsets have been proposed. A common trait of these studies is that, to the best of our knowledge, they do not aim to produce fuzzified versions of the existing WLD's, but build new WLDs from scratch, which has limited the attention received from the Text-Mining community, many of whose resources and applications are based on the existing WLDs. In this study, we present an algorithm for constructing fuzzy versions of WLDs of any language, given a corpus of documents and a word-sense disambiguation (WSD) system for that language. Then, using the Open-American-National-Corpus and UKB WSD as algorithm inputs, we construct and publish online the fuzzified version of English WordNet (FWN). We also propose a theoretical (mathematical) proof of the validity of its results.
- Open Access
GPU-Acceleration of Parallel Unconditionally Stable Group Explicit Finite Difference Method
Graphics Processing Units (GPUs) are high performance co-processors originally intended to improve the use and quality of computer graphics applications. Once, researchers and practitioners noticed the potential of using GPU for general purposes, GPUs applications have been extended from graphics applications to other fields. The main objective of this paper is to evaluate the impact of using GPU in solution of the transient diffusion type equation by parallel and stable group explicit finite difference method and encourage the researchers in this field to immigrate from implementing their algorithms in CPU to the GPU emerging world. For comparing them, we implemented the method in both GPU and CPU (multi-core) programming context. Moreover, we proposed an optimal synchronization arrangement for the implementation pseudo-code. Also, the interrelation of GPU parallel programming and initializing the algorithm variables were discussed, taking advantage of numerical experiences. The GPU-approach results are faster than those obtained from a much expensive parallel 8-thread CPU-based programming. The GPU used in this paper, is an ordinary old laptop GPU (GT 335M, launched at 2010) and is accessible for everyone and the newer generations of GPU (as discussed in paper) have even more performance priority over the similar-price GPUs. Then, the results are expected to encourage the entire research society to take advantage of GPUs and improve the time efficiency of their studies.
Open AccessGPU-Acceleration of Parallel Unconditionally Stable Group Explicit Finite Difference Method
Graphics Processing Units (GPUs) are high performance co-processors originally intended to improve the use and quality of computer graphics applications. Once, researchers and practitioners noticed the potential of using GPU for general purposes, GPUs applications have been extended from graphics applications to other fields. The main objective of this paper is to evaluate the impact of using GPU in solution of the transient diffusion type equation by parallel and stable group explicit finite difference method and encourage the researchers in this field to immigrate from implementing their algorithms in CPU to the GPU emerging world. For comparing them, we implemented the method in both GPU and CPU (multi-core) programming context. Moreover, we proposed an optimal synchronization arrangement for the implementation pseudo-code. Also, the interrelation of GPU parallel programming and initializing the algorithm variables were discussed, taking advantage of numerical experiences. The GPU-approach results are faster than those obtained from a much expensive parallel 8-thread CPU-based programming. The GPU used in this paper, is an ordinary old laptop GPU (GT 335M, launched at 2010) and is accessible for everyone and the newer generations of GPU (as discussed in paper) have even more performance priority over the similar-price GPUs. Then, the results are expected to encourage the entire research society to take advantage of GPUs and improve the time efficiency of their studies.
- Open Access
The application of the exact operational matrices for solving the Emden-Fowler equations, arising in astrophysics
The objective of this paper is to apply the well-known exact operational matrices (EOMs) idea for solving the Emden-Fowler equations, illustrating the superiority of EOMs versus ordinary operational matrices (OOMs). Up to now, a few studies have been conducted on EOMs and the differential equations solved by them do not have high-degree nonlinearity and the reported results are not regarded as appropriate criteria for the excellence of the new method. So, we chose Emden-Fowler type differential equations and solved them by this method. To confirm the accuracy of the new method and to show the preeminence of EOMs versus OOMs, the norm1 of the residual and error function of both methods are evaluated for multiple $m$ values, where $m$ is the degree of the Bernstein polynomials. We reported the results in form of plots to illustrate the error convergence of both methods to zero and also to show the primacy of the new method versus OOMs. The obtained results have demonstrated the increased accuracy of the new method.Open AccessThe application of the exact operational matrices for solving the Emden-Fowler equations, arising in astrophysics
The objective of this paper is to apply the well-known exact operational matrices (EOMs) idea for solving the Emden-Fowler equations, illustrating the superiority of EOMs versus ordinary operational matrices (OOMs). Up to now, a few studies have been conducted on EOMs and the differential equations solved by them do not have high-degree nonlinearity and the reported results are not regarded as appropriate criteria for the excellence of the new method. So, we chose Emden-Fowler type differential equations and solved them by this method. To confirm the accuracy of the new method and to show the preeminence of EOMs versus OOMs, the norm1 of the residual and error function of both methods are evaluated for multiple $m$ values, where $m$ is the degree of the Bernstein polynomials. We reported the results in form of plots to illustrate the error convergence of both methods to zero and also to show the primacy of the new method versus OOMs. The obtained results have demonstrated the increased accuracy of the new method.