In this paper, we propose a model to represent not completely deened data. These data are structured in rooted trees that take into account unknown and impossible values. We make a Galois connexion between entities described with imprecise data and their associated predicates. We propose an algorithm to nd concepts deened by a Galois connexion.

We consider the problem of regression analysis with imprecise data. By imprecise data we mean imprecise observations of precise quantities in the form of sets of values. In this paper, we explore a recently introduced likelihood-based approach to regression with such data. The approach is very general, since it covers all kinds of imprecise data (i.e. not only intervals) and it is not restricte...

the selection of best information system (is) project from many competing proposals is a critical business activity which is very helpful to all organizations. while previous is project selection methods are useful but have restricted application because they handle only cases with precise data. indeed, these methods are based on precise data with less emphasis on imprecise data. this paper pro...

Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...