In this paper, using pre-semi-open L-sets and their inequality, a new notion of PS-compactness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This notion does not depend on the structure of the basis lattice L and L does not need any distributivity.

‎This paper deals with one problem that needs to be addressed in the emerging field known under the name computing with perceptions‎. ‎It is the problem of describing‎, ‎approximately‎, ‎a given fuzzy set in natural‎ ‎language‎. ‎This problem has lately been referred to as the problem of retranslation‎. ‎An approaches to ‎dealing with the retranslation problem is discussed in the paper‎, ‎that ...

The development of annotated resources in the area of frame semantics has been crucial to the development of robust systems for shallow semantic parsing. Resource-poor languages have shown a significant delay due to the lack of sufficient training data. Recent works proposed to exploit parallel corpora in order to automatically transfer the semantic information available for English to other ta...

This paper studies Regularized Discriminant Analysis (RDA) in the context of face recognition. We check RDA sensitivity to different photometric preprocessing methods and compare its performance to other classifiers. Our study shows that RDA is better able to extract the relevant discriminatory information from training data than the other classifiers tested, thus obtaining a lower error rate. ...

Answer set programming (ASP) approach is an efficient approach for solving the maximum quartet consistency problem. We distinguish two factors that affect the efficiency of a recent ASP approach for solving maximum quartet consistency problem; answer set programming itself and a variety of preprocessing steps. In this paper, we propose a method for applying one of the preprocessing steps used i...

Attribute reduction is viewed as an important preprocessing step for pattern recognition and data mining. Most of researches are focused on attribute reduction by using rough sets. Recently, Tsang et al. discussed attribute reduction with covering rough sets in the paper [E. C.C. Tsang, D. Chen, Daniel S. Yeung, Approximations and reducts with covering generalized rough sets, Computers and Math...