How to combine inconsistent ordinal and cardinal preferences: A satisficing modelling approach

This paper analyzes a situation where a decision-maker provides cardinal and ordinal information about her/his preferences towards m objects (criteria, alternatives, etc.). However, the two rankings derived from her/his preferences are different. This situation of “inconsistent preferences” is formalized. Moreover, in order to deal with this type of conflictive situation, a satisficing model based on the minimization of p-metric distance functions is proposed. In this way, a final set of weights associated with the m objects, by using the cardinal and the ordinal information, is obtained. The final model corresponds to a linear extended goal programming, so the proposed approach is operationally and computationally efficient, since the computations are reduced to solving a small number of linear programming models of a moderate size.     

Integrated evidential reasoning approach in the presence of cardinal and ordinal preferences and its applications in software selection

A combination of cardinal and ordinal preferences in multiple-attribute decision making (MADM) demonstrates more reliability and flexibility compared with sole cardinal or ordinal preferences derived from a decision maker. This situation occurs particularly when the knowledge and experience of the decision maker, as well as the data regarding specific alternatives on certain attributes, are insufficient or incomplete. This paper proposes an integrated evidential reasoning (IER) approach to analyze uncertain MADM problems in the presence of cardinal and ordinal preferences. The decision maker provides complete or incomplete cardinal and ordinal preferences of each alternative on each attribute. Ordinal preferences are expressed as unknown distributed assessment vectors and integrated with cardinal preferences to form aggregated preferences of alternatives. Three optimization models considering cardinal and ordinal preferences are constructed to determine the minimum and maximum minimal satisfaction of alternatives, simultaneous maximum minimal satisfaction of alternatives, and simultaneous minimum minimal satisfaction of alternatives. The minimax regret rule, the maximax rule, and the maximin rule are employed respectively in the three models to generate three kinds of value functions of alternatives, which are aggregated to find solutions. The attribute weights in the three models can be precise or imprecise (i.e., characterized by six types of constraints). The IER approach is used to select the optimum software for product lifecycle management of a famous Chinese automobile manufacturing enterprise.     

Managing transitivity and consistency of preferences in AHP group decision making based on minimum modifications

Preference transitivity characterized by ordinal consistency is a fundamental principle for decision making models based on pairwise comparison matrices (PCMs). However, little previous research has addressed ordinal consistency in an optimal way. Further, because ordinal consistency is not considered in the consensus reaching process, non-transitive preferences may still exist in the revised PCMs. In this paper, optimization models are proposed to obtain transitive preferences for solving individual consistency and group consensus problems. First, the conditions satisfying the ordinal consistency of PCMs are analysed and a system of constraints is derived to allow for the ordinal consistency to be explicitly controlled in the optimization model. A mixed integer linear optimization model is then proposed to assist decision makers satisfy both the ordinal and cardinal consistencies. A second mixed integer linear optimization model is then designed to ensure that the consensus level in group decision making problems can be achieved when both the group as a whole and all individuals have acceptably cardinal and ordinal consistencies. Optimization models considering ordinal consistency and classical cardinal consistency indices are open problems needing to be managed in future. Compared with existing methods, the proposed models provide an optimal way to minimize modifications in deriving transitive preferences. Finally, the feasibility and validity of the models are verified through comparisons with classic models.     

Ranking and screening multiple criteria alternatives with partialinformation and use of ordinal and cardinal strength of preferences

This paper consists of three parts: 1) some theories and an efficient algorithm for ranking and screening multicriteria alternatives when there exists partial information on the decision maker's preferences; 2) generation of partial information using variety of methods; and 3) the existence of ordinal and cardinal functions based on and strengths of preferences. We demonstrate that strengths of preference concept can be very effectively used to generate the partial information on preferences. We propose axioms for ordinal and cardinal (measurable) value functions. An algorithm is developed for ranking and screening alternatives when there exists partial information about the preferences and the ordering of alternatives. The proposed algorithm obtains the same information very efficiently while by solving one mathematical programming problem many alternatives can be ranked and screened. Several examples are discussed and results of some computational experiments are reported     

Computing and managing cardinal direction relations

Qualitative spatial reasoning forms an important part of the commonsense reasoning required for building intelligent geographical information systems (GIS). Previous research has come up with models to capture cardinal direction relations for typical GIS data. In this paper, we target the problem of efficiently computing the cardinal direction relations between regions that are composed of sets of polygons and present two algorithms for this task. The first of the proposed algorithms is purely qualitative and computes, in linear time, the cardinal direction relations between the input regions. The second has a quantitative aspect and computes, also in linear time, the cardinal direction relations with percentages between the input regions. Our experimental evaluation indicates that the proposed algorithms outperform existing methodologies. The algorithms have been implemented and embedded in an actual system, CARDIRECT, that allows the user to 1) specify and annotate regions of interest in an image or a map, 2) compute cardinal direction relations between them, and 3) pose queries in order to retrieve combinations of interesting regions.     

Collaborative filtering with ordinal scale-based implicit ratings for mobile music recommendations

Collaborative filtering (CF)-based recommender systems represent a promising solution for the rapidly growing mobile music market. However, in the mobile Web environment, a traditional CF system that uses explicit ratings to collect user preferences has a limitation: mobile customers find it difficult to rate their tastes directly because of poor interfaces and high telecommunication costs. Implicit ratings are more desirable for the mobile Web, but commonly used cardinal (interval, ratio) scales for representing preferences are also unsatisfactory because they may increase estimation errors. In this paper, we propose a CF-based recommendation methodology based on both implicit ratings and less ambitious ordinal scales. A mobile Web usage mining (mWUM) technique is suggested as an implicit rating approach, and a specific consensus model typically used in multi-criteria decision-making (MCDM) is employed to generate an ordinal scale-based customer profile. An experiment with the participation of real mobile Web customers shows that the proposed methodology provides better performance than existing CF algorithms in the mobile Web environment.     

FUZZY MODELS FOR ENERGY DEMAND MANAGEMENT

Abstract

Energy planning is a management and control tool meant to deal medium- and long-term with the interaction process between the economic development and efficient resource allocation of a given country. The paper gives a complementary approach to an econometric model which by means of fuzzy sets theory enables the social planner to estimate the energy vector at a given moment within the content of a given industrial structure. The fuzzy approach is used to quantify the preferences and/or the given information states that are neither deterministic in use nor certain and so they have to be dynamically approached. This approach is used to compute and evaluate end use energy demand on a time scale. The management-oriented results illuminate further dimensions of the complex problem of energy use management by means of models and the interaction with the social planner, its way of thinking and preferences.     

Asset pricing with dynamic programming

The study of asset price characteristics of stochastic growth models such as the risk-free interest rate, equity premium, and the Sharpe-ratio has been limited by the lack of global and accurate methods to solve dynamic optimization models. In this paper, a stochastic version of a dynamic programming method with adaptive grid scheme is applied to compute the asset price characteristics of a stochastic growth model. The stochastic growth model is of the type as developed by [Brock and Mirman (1972), Journal of Economic Theory, 4, 479–513 and Brock (1979), Part I: The growth model (pp. 165–190). New York: Academic Press; The economies of information and uncertainty (pp. 165–192). Chicago: University of Chicago Press. (1982). It has become the baseline model in the stochastic dynamic general equilibrium literature. In a first step, in order to test our procedure, it is applied to this basic stochastic growth model for which the optimal consumption and asset prices can analytically be computed. Since, as shown, our method produces only negligible errors, as compared to the analytical solution, in a second step, we apply it to more elaborate stochastic growth models with adjustment costs and habit formation. In the latter model preferences are not time separable and past consumption acts as a constraint on current consumption. This model gives rise to an additional state variable. We here too apply our stochastic version of a dynamic programming method with adaptive grid scheme to compute the above mentioned asset price characteristics. We show that our method is very suitable to be used as solution technique for such models with more complicated decision structure.      

Toward automated feature model configuration with optimizing non-functional requirements

ContextA software product line is a family of software systems that share some common features but also have significant variabilities. A feature model is a variability modeling artifact, which represents differences among software products with respect to the variability relationships among their features. Having a feature model along with a reference model developed in the domain engineering lifecycle, a concrete product of the family is derived by binding the variation points in the feature model (called configuration process) and by instantiating the reference model.ObjectiveIn this work we address the feature model configuration problem and propose a framework to automatically select suitable features that satisfy both the functional and non-functional preferences and constraints of stakeholders. Additionally, interdependencies between various non-functional properties are taken into account in the framework.MethodThe proposed framework combines Analytical Hierarchy Process (AHP) and Fuzzy Cognitive Maps (FCM) to compute the non-functional properties weights based on stakeholders’ preferences and interdependencies between non-functional properties. Afterwards, Hierarchical Task Network (HTN) planning is applied to find the optimal feature model configuration.ResultOur approach improves state-of-art of feature model configuration by considering positive or negative impacts of the features on non-functional properties, the stakeholders’ preferences, and non-functional interdependencies. The approach presented in this paper extends earlier work presented in [1] from several distinct perspectives including mechanisms handling interdependencies between non-functional properties, proposing a novel tooling architecture, and offering visualization and interaction techniques for representing functional and non-functional aspects of feature models.Conclusionour experiments show the scalability of our configuration approach when considering both functional and non-functional requirements of stakeholders.     

Ordinal Measures for Iris Recognition

Images of a human iris contain rich texture information useful for identity authentication. A key and still open issue in iris recognition is how best to represent such textural information using a compact set of features (iris features). In this paper, we propose using ordinal measures for iris feature representation with the objective of characterizing qualitative relationships between iris regions rather than precise measurements of iris image structures. Such a representation may lose some image-specific information, but it achieves a good trade-off between distinctiveness and robustness. We show that ordinal measures are intrinsic features of iris patterns and largely invariant to illumination changes. Moreover, compactness and low computational complexity of ordinal measures enable highly efficient iris recognition. Ordinal measures are a general concept useful for image analysis and many variants can be derived for ordinal feature extraction. In this paper, we develop multilobe differential filters to compute ordinal measures with flexible intralobe and interlobe parameters such as location, scale, orientation, and distance. Experimental results on three public iris image databases demonstrate the effectiveness of the proposed ordinal feature models.     

Robust Plackett–Luce model for <Emphasis Type="Italic">k</Emphasis>-ary crowdsourced preferences

The aggregation of k-ary preferences is an emerging ranking problem, which plays an important role in several aspects of our daily life, such as ordinal peer grading and online product recommendation. At the same time, crowdsourcing has become a trendy way to provide a plethora of k-ary preferences for this ranking problem, due to convenient platforms and low costs. However, k-ary preferences from crowdsourced workers are often noisy, which inevitably degenerates the performance of traditional aggregation models. To address this challenge, in this paper, we present a RObust PlAckett–Luce (ROPAL) model. Specifically, to ensure the robustness, ROPAL integrates the Plackett–Luce model with a denoising vector. Based on the Kendall-tau distance, this vector corrects k-ary crowdsourced preferences with a certain probability. In addition, we propose an online Bayesian inference to make ROPAL scalable to large-scale preferences. We conduct comprehensive experiments on simulated and real-world datasets. Empirical results on “massive synthetic” and “real-world” datasets show that ROPAL with online Bayesian inference achieves substantial improvements in robustness and noisy worker detection over current approaches.     

Realistic Input Models for Geometric Algorithms

Abstract. The traditional worst-case analysis often fails to predict the actual behavior of the running time of geometric algorithms in practical situations. One reason is that worst-case scenarios are often very contrived and do not occur in practice. To avoid this, models are needed that describe the properties that realistic inputs have, so that the analysis can take these properties into account. We try to bring some structure to this emerging research direction. In particular, we present the following results: • We show the relations between various models that have been proposed in the literature. • For several of these models, we give algorithms to compute the model parameter(s) for a given (planar) scene; these algorithms can be used to verify whether a model is appropriate for typical scenes in some application area. • As a case study, we give some experimental results on the appropriateness of some of the models for one particular type of scene often encountered in geographic information systems, namely certain triangulated irregular networks.     

融合双层信息的显著性检测

目的 针对已有工作在颜色及结构显著性描述方面的缺陷,提出一种新的图像显著性检测方法。方法 本文方法在不同的图像区域表达上从颜色与空间结构角度计算图像的显著性,充分考虑图像的特征与像素聚类方式之间的适应性。首先,根据颜色复杂度、边缘与连通性等信息,将图像从像素空间映射到双层区域表示空间。然后,根据两个层次空间的特性,与每个图像区域的边界特性,计算图像的结构和颜色显著度。最后,由于不同图像表示中的显著性信息存在互补性,将所有这些信息进行融合得到最终的显著性图。结果 在公认的MSRA-1000数据集上验证本文方法并与目前国际上流行的方法进行对比。实验结果表明,本文方法在精确率、召回率以及绝对误差(分别为75.03%、89.39%、85.61%)等方面要优于当前前沿的方法。结论 提出了一种融合双层信息的显著性检测算法。根据图像本身信息控制区域数目构建图像双层表示,提高了方法的普适性;利用图像不同层次的特性从不同角度计算显著性,增强了方法鲁棒性。     

Ordinal preference and inter-rater pattern recognition: Hopfield neural network vs. measures of association

In decision analysis, if the criterion is an ordinal rather than a cardinal one, a preferential solution depends on the inter-rater agreement. The Kendall coefficient of concordance W, the Friedman ranks statistic F _r , and the Page L statistic are often used to determine the association among M sets of rankings. However, they may get some anomalies because they all use the cardinal variable “variance” to judge the association. In order to correct the anomalies, we use the modified Hopfield neural network instead to determine the association among M sets of rankings. The results are not only to reduce the unidentified cases but also to solve the anomalies.     

Representing Trees of Higher Degree

This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (or k-ary tries), where each node has k slots, labelled {1,...,k}, each of which may have a reference to a child, and ordinal trees, where the children of each node are simply ordered. Our representations use a number of bits close to the information theoretic lower bound and support operations in constant time. For ordinal trees we support the operations of finding the degree, parent, ith child, and subtree size. For cardinal trees the structure also supports finding the child labelled i of a given node apart from the ordinal tree operations. These representations also provide a mapping from the n nodes of the tree onto the integers {1, ..., n}, giving unique labels to the nodes of the tree. This labelling can be used to store satellite information with the nodes efficiently.     

A utility range-based interactive group support system for multiattribute decision making

This research suggests an interactive procedure for solving a multiattribute group decision problem using a range-typed utility information, and develops an interactive group support system (RINGS) to implement some capabilities of the procedure. It is often difficult for group members to articulate their preferences with cardinal values, instead they prefer to give incomplete information only. Utility ranges are obtained by solving linear programming problems with incompletely specified information. RINGS finds out conflicting opinions among group members, compares each member's preferences with the others’, and suggests a direction for consensus seeking. The procedure of RINGS utilizes range-typed visual information, which helps the group reach a consensus. RINGS has several facilities like graphic user interface, model base, and database, so the total time to reach a group consensus is reduced. The evaluation of information systems is illustrated as a demonstration of some capabilities of RINGS.Scope and purposeThis paper deals with the multiple attribute decision-making problem using a separable linear programming technique when group decision makers give only their incomplete information about the attribute weight and alternative value. The utility range for individual decision maker is calculated from each decision maker's incomplete information, and the utility range for group decision makers is obtained from those of individual decision makers. An interactive procedure for establishing a group's pairwise dominance relations with a group's utility range is described, and an interactive group support system (RINGS) is developed to implement the procedure. A case study about the evaluation of information systems is illustrated as a demonstration of some capabilities of RINGS.     

Stress-strength reliability models under incomplete information

A new approach to compute structural reliability is proposed. The novelty of the approach is that initial statistical information concerning the stress and strength of engineered structures is partial. Different numerous cases of state of knowledge about the stress and strength are analysed. A set of canonical analytical expressions for computing imprecise structural reliability has been obtained and a few examples are presented. The reliability models developed are generalisations of a conventional one.     

A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics

We study a new fixpoint semantics for logic programs with negation. Our construction is intermediate between Van Gelder’s well-founded model and Gelfond and Lifschitz’s stable model semantics. We show first that the stable models of a logic programP are exactly the well-supported models ofP, i.e. the supported models with loop-free finite justifications. Then we associate to any logic programP a non-monotonic operator over the semilattice of justified interpretations, and we define in an abstract form its ordinal powers. We show that the fixpoints of this operator are the stable models ofP, and that its ordinal powers after some ordinala are extensions of the well-founded partial model ofP. In particular ifP has a well-founded model then that canonical model is also an ordinal power and the unique fixpoint of our operator. We show with examples of logic programs which have a unique stable model but no well-founded model that the converse is false. We relate also our work to Doyle’s truth maintenance system and some implementations of rule-based expert systems.     

HOPE: a hybrid deep neural model for out-of-town next POI recommendation

Next Point-of-interest (POI) recommendation has been recognized as an important technique in location-based services, and existing methods aim to utilize sequential models to return meaningful recommendation results. But these models fail to fully consider the phenomenon of user interest drift, i.e. a user tends to have different preferences when she is in out-of-town areas, resulting in sub-optimal results accordingly. To achieve more accurate next POI recommendation for out-of-town users, an adaptive attentional deep neural model HOPE is proposed in this paper for modeling user’s out-of-town dynamic preferences precisely. Aside from hometown preferences of a user, it captures the long and short-term preferences of the user in out-of-town areas using “Asymmetric-SVD” and “TC-SeqRec” respectively. In addition, toward the data sparsity problem of out-of-town preference modeling, a region-based pattern discovery method is further adopted to capture all visitor’s crowd preferences of this area, enabling out-of-town preferences of cold start users to be captured reasonably. In addition, we adaptively fuse all above factors according to the contextual information by adaptive attention, which incorporates temporal gating to balance the importance of the long-term and short-term preferences in a reasonable and explainable way. At last, we evaluate the HOPE with baseline sequential models for POI recommendation on two real datasets, and the results demonstrate that our proposed solution outperforms the state-of-art models significantly.

     

Rank order-based recommendation approach for multiple featured products

Recommendation methods, which suggest a set of products likely to be of interest to a customer, require a great deal of information about both the user and the products. Recommendation methods take different forms depending on the types of preferences required from the customer. In this paper, we propose a new recommendation method that attempts to suggest products by utilizing simple information, such as ordinal specification weights and specification values, from the customer. These considerations lead to an ordinal weight-based multi-attribute value model. This model is well suited to situations in which there exist insufficient data regarding the demographics and transactional information on the target customers, because it enables us to recommend personalized products with a minimal input of customer preferences. The proposed recommendation method is different from previously reported recommendation methods in that it explicitly takes into account multidimensional features of each product by employing an ordered weight-based multi-attribute value model. To evaluate the proposed method, we conduct comparative experiments with two other methods rooted in distance-based similarity measures.