Utilizing contextual ontological user profiles for personalized recommendations

As users may have different needs in different situations and contexts, it is increasingly important to consider user context data when filtering information. In the field of web personalization and recommender systems, most of the studies have focused on the process of modelling user profiles and the personalization process in order to provide personalized services to the user, but not on contextualized services. Rather limited attention has been paid to investigate how to discover, model, exploit and integrate context information in personalization systems in a generic way. In this paper, we aim at providing a novel model to build, exploit and integrate context information with a web personalization system. A context-aware personalization system (CAPS) is developed which is able to model and build contextual and personalized ontological user profiles based on the user’s interests and context information. These profiles are then exploited in order to infer and provide contextual recommendations to users. The methods and system developed are evaluated through a user study which shows that considering context information in web personalization systems can provide more effective personalization services and offer better recommendations to users.     

Fuzzy-genetic approach to recommender systems based on a novel hybrid user model

The main strengths of collaborative filtering (CF), the most successful and widely used filtering technique for recommender systems, are its cross-genre or ‘outside the box’ recommendation ability and that it is completely independent of any machine-readable representation of the items being recommended. However, CF suffers from sparsity, scalability, and loss of neighbor transitivity. CF techniques are either memory-based or model-based. While the former is more accurate, its scalability compared to model-based is poor. An important contribution of this paper is a hybrid fuzzy-genetic approach to recommender systems that retains the accuracy of memory-based CF and the scalability of model-based CF. Using hybrid features, a novel user model is built that helped in achieving significant reduction in system complexity, sparsity, and made the neighbor transitivity relationship hold. The user model is employed to find a set of like-minded users within which a memory-based search is carried out. This set is much smaller than the entire set, thus improving system’s scalability. Besides our proposed approaches are scalable and compact in size, computational results reveal that they outperform the classical approach.     

Generating fuzzy rules from training instances for fuzzy classification systems

In recent years, many methods have been proposed to generate fuzzy rules from training instances for handling the Iris data classification problem. In this paper, we present a new method to generate fuzzy rules from training instances for dealing with the Iris data classification problem based on the attribute threshold value α, the classification threshold value β and the level threshold value γ, where α  [0, 1], β  [0, 1] and γ  [0, 1]. The proposed method gets a higher average classification accuracy rate than the existing methods.     

Keyword clustering for user interest profiling refinement within paper recommender systems

To refine user interest profiling, this paper focuses on extending scientific subject ontology via keyword clustering and on improving the accuracy and effectiveness of recommendation of the electronic academic publications in online services. A clustering approach is proposed for domain keywords for the purpose of the subject ontology extension. Based on the keyword clusters, the construction of user interest profiles is presented on a rather fine granularity level. In the construction of user interest profiles, we apply two types of interest profiles: explicit profiles and implicit profiles. The explicit profiles are obtained by relating users’ interest-topic relevance factors to users’ interest measurements of these topics computed by a conventional ontology-based method, and the implicit profiles are acquired on the basis of the correlative relationships among the topic nodes in topic network graphs. Three experiments are conducted which reveal that the uses of the subject ontology extension approach as well as the two types of interest profiles satisfyingly contribute to an improvement in the accuracy of recommendation.     

A fuzzy model for managing natural noise in recommender systems

E-commerce customers demand quick and easy access to products in large search spaces according to their needs and preferences. To support and facilitate this process, recommender systems (RS) based on user preferences have recently played a key role. However the elicitation of customers preferences is not always precise either correct, because of external factors such as human errors, uncertainty and vagueness proper of human beings and so on. Such a problem in RS is known as natural noise and can bias customers recommendations. Despite different proposals have been presented to deal with natural noise in RS none of them is able to manage properly the inherent uncertainty and vagueness of customers preferences. Hence, this paper is devoted to a new fuzzy method for managing in a flexible and adaptable way such uncertainty of natural noise in order to improve recommendation accuracy. Eventually a case study is performed to show the improvements produced by this fuzzy method regarding previous proposals.     

Rough set theory for the interval-valued fuzzy information systems

The notion of a rough set was originally proposed by Pawlak [Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences 11 (5) (1982) 341-356]. Later on, Dubois and Prade [D. Dubois, H. Prade, Rough fuzzy sets and fuzzy rough sets, International Journal of General System 17 (2-3) (1990) 191-209] introduced rough fuzzy sets and fuzzy rough sets as a generalization of rough sets. This paper deals with an interval-valued fuzzy information system by means of integrating the classical Pawlak rough set theory with the interval-valued fuzzy set theory and discusses the basic rough set theory for the interval-valued fuzzy information systems. In this paper we firstly define the rough approximation of an interval-valued fuzzy set on the universe U in the classical Pawlak approximation space and the generalized approximation space respectively, i.e., the space on which the interval-valued rough fuzzy set model is built. Secondly several interesting properties of the approximation operators are examined, and the interrelationships of the interval-valued rough fuzzy set models in the classical Pawlak approximation space and the generalized approximation space are investigated. Thirdly we discuss the attribute reduction of the interval-valued fuzzy information systems. Finally, the methods of the knowledge discovery for the interval-valued fuzzy information systems are presented with an example.     

One-and-only item recommendation with fuzzy logic techniques

Recommender systems anticipate users’ needs by suggesting items that are likely to interest them. Most existing systems employ collaborative filtering (CF) techniques, searching for regularities in the way users have rated items. While in general a successful approach, CF cannot cope well with so-called one-and-only items, that is: items of which there is only one single instance (like an event), and which as such cannot be repetitively “sold”. Typically such items are evaluated only after they have ceased being available, thereby thwarting the classical CF strategy. In this paper, we develop a conceptual framework for recommending one-and-only items. It uses fuzzy logic, which allows to reflect the graded/uncertain information in the domain, and to extend the CF paradigm, overcoming limitations of existing techniques. A possible application in the context of trade exhibition recommendation for e-government is discussed to illustrate the proposed conceptual framework.     

Fuzzy rough set theory for the interval-valued fuzzy information systems

The concept of the rough set was originally proposed by Pawlak as a formal tool for modelling and processing incomplete information in information systems, then in 1990, Dubois and Prade first introduced the rough fuzzy sets and fuzzy rough sets as a fuzzy extension of the rough sets. The aim of this paper is to present a new extension of the rough set theory by means of integrating the classical Pawlak rough set theory with the interval-valued fuzzy set theory, i.e., the interval-valued fuzzy rough set model is presented based on the interval-valued fuzzy information systems which is defined in this paper by a binary interval-valued fuzzy relations RF⁽ⁱ⁾(U×U) on the universe U. Several properties of the rough set model are given, and the relationships of this model and the others rough set models are also examined. Furthermore, we also discuss the knowledge reduction of the classical Pawlak information systems and the interval-valued fuzzy information systems respectively. Finally, the knowledge reduction theorems of the interval-valued fuzzy information systems are built.     

A collaborative filtering framework based on fuzzy association rules and multiple-level similarity

The rapid development of Internet technologies in recent decades has imposed a heavy information burden on users. This has led to the popularity of recommender systems, which provide advice to users about items they may like to examine. Collaborative Filtering (CF) is the most promising technique in recommender systems, providing personalized recommendations to users based on their previously expressed preferences and those of other similar users. This paper introduces a CF framework based on Fuzzy Association Rules and Multiple-level Similarity (FARAMS). FARAMS extended existing techniques by using fuzzy association rule mining, and takes advantage of product similarities in taxonomies to address data sparseness and nontransitive associations. Experimental results show that FARAMS improves prediction quality, as compared to similar approaches. Cane Wing-ki Leung is a PhD student in the Department of Computing, The Hong Kong Polytechnic University, where she received her BA degree in Computing in 2003. Her research interests include collaborative filtering, data mining and computer-supported collaborative work. Stephen Chi-fai Chan is an Associate Professor and Associate Head of the Department of Computing, The Hong Kong Polytechnic University. Dr. Chan received his PhD from the University of Rochester, USA, worked on computer-aided design at Neo-Visuals, Inc. in Toronto, Canada, and researched in computer-integrated manufacturing at the National Research Council of Canada before joining the Hong Kong Polytechnic University in 1993. He is currently working on the development of collaborative Web-based information systems, with applications in education, electronic commerce, and manufacturing. Fu-lai Chung received his BSc degree from the University of Manitoba, Canada, in 1987, and his MPhil and PhD degrees from the Chinese University of Hong Kong in 1991 and 1995, respectively. He joined the Department of Computing, Hong Kong Polytechnic University in 1994, where he is currently an Associate Professor. He has published widely in the areas of computational intelligence, pattern recognition and recently data mining and multimedia in international journals and conferences and his current research interests include time series data mining, Web data mining, bioinformatics data mining, multimedia content analysis,and new computational intelligence techniques.     

Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization

In this article, we analyze a co-operative multi-thread search-based optimization strategy, where each solver thread represents a different optimization algorithm (or the same one with different settings), and they are all controlled by a centralized co-ordinator. We also propose the use of memory to keep track of both the state of the individual threads and the obtained solutions. Based on this memory, a very simple fuzzy rule base is used to control the system behavior.We also present the results of three computational experiments. The first of these checks the strategy by comparing it with an independent search strategy and a sequential algorithm, and the superiority of the co-operative scheme is confirmed. The second analyzes how definition of the threads affects the quality of the results, and the importance of there being a balanced set between intensification and diversification is corroborated. The third explores the use of memory with two different fuzzy rules, and the results indicate that the best combination is to use memory together with two rules (solver dependent and solver independent ones) (although this combination should not be activated at the beginning of the search in order to avoid premature convergence).     

A simple method for identification of singleton fuzzy models

This article presents a simple method for constructing a singleton fuzzy model from a given set of input/output data. The method consists of three computational steps: the initial phase, the growth phase, and the optional refining phase. The universe of discourse and two linguistic terms for each input variable and a rule base are established during the initial phase. Additional linguistic terms and rules are then appended sequentially during the growth phase to modify the model structure and to elevate the performance. During the optional refining phase the overall modelling performance can be further improved by adjusting the singleton outputs of the rule set in the sense of least squares. The proposed identification method can simultaneously provide an appropriate model structure and parameters without any time-consuming optimisation. Several numerical examples demonstrate the effectiveness of the proposed identification method.     

Level sets and the representation theorem for intuitionistic fuzzy sets

We discuss the concept of a level set of a fuzzy set and the related ideas of the representation theorem and Zadeh’s extension principle. We then describe the extension of these ideas to the case of interval valued fuzzy sets (IVFS). We then recall the formal equivalence between IVFS and intuitionistic fuzzy sets (IFS). This equivalence allows us to naturally extend the concepts of level sets, representation theorem and extension principle from the domain of IVFS to the domain of IFS. What is important to note here is that in the case of these non-standard fuzzy sets, interval valued and intuitionistic, the number of distinct level sets can be greater then the number of distinct membership grades of the fuzzy set being represented. This is a result of the fact that the distinct level sets are generated by the power set of the membership grades. In particular, the minimum of each subset of membership grades provides a level set. In the case of the standard fuzzy sets the minimum of a subset of membership grades results in one of the elements in the subset. In the case of the non-standard fuzzy sets, the membership grades are not linearly ordered and hence taking the minimum of a subset of these can result in a value that was not one of the members of the subset.

Gaussian kernel-based fuzzy inference systems for high dimensional regression

We propose a novel architecture for a higher order fuzzy inference system (FIS) and develop a learning algorithm to build the FIS. The consequent part of the proposed FIS is expressed as a nonlinear combination of the input variables, which can be obtained by introducing an implicit mapping from the input space to a high dimensional feature space. The proposed learning algorithm consists of two phases. In the first phase, the antecedent fuzzy sets are estimated by the kernel-based fuzzy c-means clustering. In the second phase, the consequent parameters are identified by support vector machine whose kernel function is constructed by fuzzy membership functions and the Gaussian kernel. The performance of the proposed model is verified through several numerical examples generally used in fuzzy modeling. Comparative analysis shows that, compared with the zero-order fuzzy model, first-order fuzzy model, and polynomial fuzzy model, the proposed model exhibits higher accuracy, better generalization performance, and satisfactory robustness.     

A weight space-based approach to fuzzy multiple-objective linear programming

In this paper, the effects of uncertainty on multiple-objective linear programming models are studied using the concepts of fuzzy set theory. The proposed interactive decision support system is based on the interactive exploration of the weight space. The comparative analysis of indifference regions on the various weight spaces (which vary according to intervals of values of the satisfaction degree of objective functions and constraints) enables to study the stability and evolution of the basis that correspond to the calculated efficient solutions with changes of some model parameters.     

Fuzzy methods for case-based recommendation and decision support

The paper proposes two case-based methods for recommending decisions to users on the basis of information stored in a database. In both approaches, fuzzy sets and related (approximate) reasoning techniques are used for modeling user preferences and decision principles in a flexible manner. The first approach, case-based decision making, can principally be seen as a case-based counterpart to classical decision principles well-known from statistical decision theory. The second approach, called case-based elicitation, combines aspects from flexible querying of databases and case-based prediction. Roughly, imagine a user who aims at choosing an optimal alternative among a given set of options. The preferences with respect to these alternatives are formalized in terms of flexible constraints, the expression of which refers to cases stored in a database. As both types of decision support might provide useful tools for recommender systems, we also place the methods in a broader context and discuss the role of fuzzy set theory in some related fields.     

RSS-based e-learning recommendations exploiting fuzzy FCA for Knowledge Modeling

Nowadays, Web 2.0 focuses on user generated content, data sharing and collaboration activities. Formats like Really Simple Syndication (RSS) provide structured Web information, display changes in summary form and stay updated about news headlines of interest. This trend has also affected the e-learning domain, where RSS feeds demand for dynamic learning activities, enabling learners and teachers to access to new blog posts, to keep track of new shared media, to consult Learning Objects which meet their needs.This paper presents an approach to enrich personalized e-learning experiences with user-generated content, through a contextualized RSS-feeds fruition. The synergic exploitation of Knowledge Modeling and Formal Concept Analysis techniques enables the design and development of a system that supports learners in their learning activities by collecting, conceptualizing, classifying and providing updated information on specific topics coming from relevant information sources. An agent-based layer supervises the extraction and filtering of RSS feeds whose topics cover a specific educational domain.     

A new method for solving dual hesitant fuzzy assignment problems with restrictions based on similarity measure

Zhu et al. (2012) proposed dual hesitant fuzzy set as an extension of hesitant fuzzy sets which encompass fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and fuzzy multisets as a special case. Dual hesitant fuzzy sets consist of two parts, that is, the membership and nonmembership degrees, which are represented by two sets of possible values. Therefore, in accordance with the practical demand these sets are more flexible, and provides much more information about the situation. In this paper, the axiom definition of a similarity measure between dual hesitant fuzzy sets is introduced. A new similarity measure considering membership and nonmembership degrees of dual hesitant fuzzy sets has been presented and also it is shown that the corresponding distance measures can be obtained from the proposed similarity measures. To check the effectiveness, the proposed similarity measure is applied in a bidirectional approximate reasoning systems. Mathematical formulation of dual hesitant fuzzy assignment problem with restrictions is presented. Two algorithms based on the proposed similarity measure, are developed to finds the optimal solution of dual hesitant fuzzy assignment problem with restrictions. Finally, the proposed method is illustrated by numerical examples.     

A survey of recommender systems for energy efficiency in buildings: Principles,challenges and prospects

Recommender systems have significantly developed in recent years in parallel with the witnessed advancements in both internet of things (IoT) and artificial intelligence (AI) technologies. Accordingly, as a consequence of IoT and AI, multiple forms of data are incorporated in these systems, e.g. social, implicit, local and personal information, which can help in improving recommender systems’ performance and widen their applicability to traverse different disciplines. On the other side, energy efficiency in the building sector is becoming a hot research topic, in which recommender systems play a major role by promoting energy saving behavior and reducing carbon emissions. However, the deployment of the recommendation frameworks in buildings still needs more investigations to identify the current challenges and issues, where their solutions are the keys to enable the pervasiveness of research findings, and therefore, ensure a large-scale adoption of this technology. Accordingly, this paper presents, to the best of the authors’ knowledge, the first timely and comprehensive reference for energy-efficiency recommendation systems through (i) surveying existing recommender systems for energy saving in buildings; (ii) discussing their evolution; (iii) providing an original taxonomy of these systems based on specified criteria, including the nature of the recommender engine, its objective, computing platforms, evaluation metrics and incentive measures; and (iv) conducting an in-depth, critical analysis to identify their limitations and unsolved issues. The derived challenges and areas of future implementation could effectively guide the energy research community to improve the energy-efficiency in buildings and reduce the cost of developed recommender systems-based solutions.     

hGA: Hybrid genetic algorithm in fuzzy rule-based classification systems for high-dimensional problems

The aim of this work is to propose a hybrid heuristic approach (called hGA) based on genetic algorithm (GA) and integer-programming formulation (IPF) to solve high dimensional classification problems in linguistic fuzzy rule-based classification systems. In this algorithm, each chromosome represents a rule for specified class, GA is used for producing several rules for each class, and finally IPF is used for selection of rules from a pool of rules, which are obtained by GA. The proposed algorithm is experimentally evaluated by the use of non-parametric statistical tests on seventeen classification benchmark data sets. Results of the comparative study show that hGA is able to discover accurate and concise classification rules.