TAILIEUCHUNG - Hedges algebras and fuzzy partition problem for qualitative attributes

In this paper, the author proposed a new method to construct the membership functions (MFs) based on database. The theory of hedge algrebra was used to build the membership functions and GA is applied to optimize them. The experimental results demonstrate the benefits of this method. | Journal of Computer Science and Cybernetics, , (2016), 335–350 DOI HEDGES ALGEBRAS AND FUZZY PARTITION PROBLEM FOR QUALITATIVE ATTRIBUTES TRAN THAI SON1 , NGUYEN TUAN ANH2 1 Institute of Information Technology, Vietnam Academy of Science and Technology 2 University of Information and Communication Technology, Thai Nguyen University 1 ttson1955@; 2 anhnt@ Abstract. There have been many approaches proposed to derive membership functions for mining fuzzy association rules using genetic algorithms (GAs) and show their advantages. However, these approaches show that the number of linguistic terms needs to be predefined. In this paper, the author proposed a new method to construct the membership functions (MFs) based on database. The theory of hedge algrebra was used to build the membership functions and GA is applied to optimize them. The experimental results demonstrate the benefits of this method. Keywords. Fuzzy Association Rules; Data mining; Hedge algebras; Genetic algorithms; Membership functions 1. INTRODUCTION Recently, mining fuzzy association rules, such as “If students have high academic results and are passionate about researching, they will find a good job.”, has been the topic that is considered and developed. To be able to get fuzzy rules, in the first step, we partition each attribute domain of a database into fuzzy sets, characterized by membership functions (MFs). Then, each value (number) in the database will be converted to the corresponding set of the degree of membership. Numerical Database is converted into a fuzzy database ready for fuzzy mining in next steps. Traditionally, the fuzzy database is often assumed to be available, , the MF sets are defined for each DB attribute. Such MF sets are usually determined experimentally and independently from database. In fact, it was shown that the approach may inversely affect the quality of the mining rules. Therefore, researchers .

• Kỹ thuật lập trình
• Journal of Computer Science and Cybernetics
• Hedges algebras and fuzzy partition problem for qualitative attributes
• Construct the membership functions
• Fuzzy Association Rules
• Member ship functions
• Nonstandard finite difference schemes
• Solving a modified epidemiological model for computer viruses
• Nonstandard finite difference
• Computer virus propagation model
• Multi objective evolutionary algorithms
• Evolutionary algorithms and foundation
• development and open issues
• EC enables computer scientists
• Evolutionary algorithms designed
• Learning interaction measure
• Relevance feedback in image retrieval
• Multi feature query
• The fuzzy density values
• Quality of transmission aware routing in ad hoc networks
• Cross layer model combined
• The static agent
• Ad hoc networks
• QoT aware routing
• sattic agent
• Algorithm to build fuzzy decision tree for data classification problem
• Fuzziness intervals matching
• Fuzzy decision tree
• The fuzzy data mining problem
• Characterizations for several classes of alternative codes
• Several classes of alternative codes
• norm alternative code
• Left norm alternative code
• Two sided alternative code
• Left alternative code
• Strict alternative code
• Packet classification algorithm
• Multi way priority trie
• Significant number of researchers
• Both theoretically and experimentally proved
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• Novel control approach for optimal power flow
• Hybrid wind photovoltaic diesel generation systems
• Diesel generation systems
• Analytical control model
• Mobile ad hoc network
• Valid route testing mechanism
• Using Network Simulator
• Random movement network topology
• Rough set theory
• Polynomial time complexity
• Algorithm finding object reducts
• Improved genetic algorithm
• Test data generation for simulink models
• Conventional genetic algorithm
• Generate test data for Simulink models
• Nonholonomic wheeled mobile robot
• Wheeled mobile robot
• Function neural network
• Unknown external disturbances
• Modeling the differential motion of a mobile manipulator
• Designing a new visual servoing
• Tracking a flying target
• Reinforcement learning algorithm
• Efficient navigation framework
• Autonomous mobile robots
• The mobile robots
• Interpolation based on semantic distance weighting
• Hedge algebra and its application
• Semantic distance weighting
• Bi linear interpolation
• Linguistic rule base system
• Transform the current Web
• Conceptual data model
• Ti meER model
• The temporal databases into OWL ontology
• The ER model into ontology
• Sliding mode control
• Sliding mode control for a planar parallel robot driven
• Electric motors in a task space
• The substructure method
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• On the real world semantics interpretability
• Fuzzy rule based systems under fuzzy set approach
• Hedge algebra approach
• The RWS interpretability
• Alternating current electrical systems
• Integer quadratic programming
• Non linear knapsack problems arising
• Polynomial time approximation schemes
• Statistical implication rules
• Collaborative filtering recommender system
• Statistical implicative analysis
• The accuracy of recommender systems
• Picture fuzzy sets
• Picture fuzzy t norms
• Picture fuzzy t conorm
• De Morgan picture operator triple
• Taxonomic assignment for large scale metagenomic data
• High perfomance systems
• Large scale metagenomic data
• Achieve good performance