On intuitionistic fuzzy sub-hyperquasigroups of hyperquasigroups

The notion of intuitionistic fuzzy sets was introduced by Atanassov as a generalization of the notion of fuzzy sets. In this paper, we consider the intuitionistic fuzzification of the concept of sub-hyperquasigroups in a hyperquasigroup and investigate some properties of such sub-hyperquasigroups. In particular, we investigate some natural equivalence relations on the set of all intuitionistic fuzzy sub-hyperquasigroups of a hyperquasigroup.Comment: 13 page

Poverty Growth in Scandinavian Countries: A Sen Multi-decomposition

We show in this paper that the growth rate of the Sen index is multi-decomposable, that is, decomposable simultaneously by groups and income sources. The multi-decomposition of the poverty growth yields respectively: the growth rate of the poverty incidence (poverty rate) decomposed by groups, the growth rate of the poverty depth (poverty gap ratios) decomposed by sources and groups, and the growth rate of inequality decomposed by sources and groups. We demonstrate that the multi-decomposition is not unique. It is mainly dependent on poverty lines defined on the space of income sources. An application to Scandinavian countries shows that poverty lines based on non-correlation between the sources of incomes imply serious underestimation of the contribution levels of the different components of the global poverty growth. The main contribution of our paper is to pay a particular attention to the poverty growth and its source components in order to avoid underestimation of poverty growth.

Rough matroids based on coverings

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving them are usually greedy. Matroid, as a generalization of linear independence in vector spaces, it has a variety of applications in many fields such as algorithm design and combinatorial optimization. An excellent introduction to the topic of rough matroids is due to Zhu and Wang. On the basis of their work, we study the rough matroids based on coverings in this paper. First, we investigate some properties of the definable sets with respect to a covering. Specifically, it is interesting that the set of all definable sets with respect to a covering, equipped with the binary relation of inclusion $\subseteq$, constructs a lattice. Second, we propose the rough matroids based on coverings, which are a generalization of the rough matroids based on relations. Finally, some properties of rough matroids based on coverings are explored. Moreover, an equivalent formulation of rough matroids based on coverings is presented. These interesting and important results exhibit many potential connections between rough sets and matroids.Comment: 15page

Level subsets and translations of QFST(G)

First, we introduce level subsets and translations of  QFST(G)  and study their properties.  Secondly,  we prove that the union and intersection of two-level subsets of QTST(G)  are subgroups of G. Also we prove that translations of  QTST(G)  are also  QFST(G).  Finally,  we define  fuzzy image and fuzzy pre-image of translations of  QFST(G)  under group homomorphisms and anti group homomorphisms and investigate properties of them

Survey of data mining approaches to user modeling for adaptive hypermedia

The ability of an adaptive hypermedia system to create tailored environments depends mainly on the amount and accuracy of information stored in each user model. Some of the difficulties that user modeling faces are the amount of data available to create user models, the adequacy of the data, the noise within that data, and the necessity of capturing the imprecise nature of human behavior. Data mining and machine learning techniques have the ability to handle large amounts of data and to process uncertainty. These characteristics make these techniques suitable for automatic generation of user models that simulate human decision making. This paper surveys different data mining techniques that can be used to efficiently and accurately capture user behavior. The paper also presents guidelines that show which techniques may be used more efficiently according to the task implemented by the applicatio

On the relationship between fuzzy subgroups and indistinguishability operators

Fuzzy subgroups are revisited considering their close relationship with indistinguishability operators (fuzzy equivalences) invariant under translations. Different ways to obtain new fuzzy subgroups from a given one are provided and different ways to characterize normal fuzzy subgroups are obtained. The idea of double coset of two (crisp) subgroups allow us to relate them via their equivalence classes. This is generalized to the fuzzy framework. The conditions in which a fuzzy relation R on a group G can be considered a fuzzy subgroup of G × G are obtained.Peer ReviewedPostprint (author's final draft