By Topic

2007 International Conference on Machine Learning and Cybernetics

Date 19-22 Aug. 2007

Go

Filter Results

Displaying Results 1 - 25 of 109
  • On Choquet Integrals of Fuzzy-Valued Functions with Respect to Fuzzy-Valued Fuzzy Measures

    Publication Year: 2007, Page(s):3653 - 3656
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Recently, Mesiar[6] suggested that, as a generalization linked to the standard fuzzy measure, set-valued[4] or fuzzy-valued fuzzy measures[10] should be given a deep investigation. In the paper, a continuation in the research on choquet integrals valued in fuzzy number sets is further showed. Its integrand is a fuzzy-valued function, and the measure is a fuzzy-valued fuzzy measure. The definition,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Application of Rough Sets on Network Intrusion Detection

    Publication Year: 2007, Page(s):3657 - 3660
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (459 KB) | HTML iconHTML

    With a growing amount of network information flowing, the limitations of the traditional network IDSs become more and more obvious, which can not adapt to the increasing trend of novel network attacks and data quantities. As a result, the analysis process becomes time-consuming. Fortunately, as is well known, rough set's reduction theory can effectively avoid redundancy and reduce extra attributes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Infromation Content of Fuzzy Relations and Fuzzy Rules

    Publication Year: 2007, Page(s):3661 - 3666
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (685 KB) | HTML iconHTML

    The appraisement of fuzzy relations is a significant problem in fuzzy theory. The related literatures done before almost focused on the similarity or equivalence fuzzy relations with a probability distribution preassigned. In this paper, a new measure named the information content of fuzzy relations is proposed, which estimates the information conveyed by a general fuzzy relations defined on multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Granular Computing Based on Fuzzy Similarity Relations

    Publication Year: 2007, Page(s):3667 - 3671
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (537 KB) | HTML iconHTML

    In this paper, we propose the class of granular fuzzy sets related to a fuzzy relation by constructive approach, relationship between special granular fuzzy sets and special fuzzy relations is also presented. As application of granular fuzzy sets, we describe the granular structure of approximation operators in fuzzy rough sets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Discretization: A Combination Approach

    Publication Year: 2007, Page(s):3672 - 3677
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB) | HTML iconHTML

    Supervised discretization refers to the problem of transforming continuous attributes of a decision table into discredited ones. It is important for some artificial intelligence theories where nominal data are required or preferred. Instead of depending on the experience of human experts, supervised discretization algorithms learn from the data. However, the results of such algorithms may be sensi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Method for Locating Solder Joint Based on Rough Set

    Publication Year: 2007, Page(s):3678 - 3681
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (793 KB) | HTML iconHTML

    Continual increases in IC-chip complexity and performance are placing demands on the density and functionality of package I/Os. Therefore, various SMT (surface mounting technology) interconnection techniques are being developed to satisfy this need. Non-destructive inspection technology based on image captured by CCD (charge couple device) has been widely used in a production of PCB (printed circu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discretization of Continuous Interval-Valued Attributes in Rough Set Theory and its Application

    Publication Year: 2007, Page(s):3682 - 3686
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (741 KB) | HTML iconHTML

    Rough set theory is a relatively new soft computing tool to deal with vagueness and uncertainty, and is regarded as a field of leading edge. But it cannot deal with continuous attributes, thus discretization is a problem which we cannot neglect. Discretization based on rough set has some particular characteristics, and consistency must be satisfied for discretization of decision systems. Existing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Fuzzy Discretization Way for Decision Tables with Continuous Attributes

    Publication Year: 2007, Page(s):3687 - 3692
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (607 KB) | HTML iconHTML

    In this paper, a discretization method for continuous decision tables is put forward. The method includes two steps called crisp discretization and fuzzy discretization. The first step is to get some crisp "cuts" based on information entropy and discernibility matrix for the decision table. The second step is to carry out fuzzy operation based on the former crisp discretization. In the second step... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Weighted Rough Set Method to Address the Class Imbalance Problem

    Publication Year: 2007, Page(s):3693 - 3698
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (851 KB) | HTML iconHTML

    The class imbalance problem has been said recently to hinder the performance of learning systems. Most of traditional learning algorithms are designed with the assumption of well-balanced datasets, and are biased towards the majority class and thus may predict poorly the minority class examples. In this paper, we develop weighted rough sets (WRS) to deal with this problem. In weighted rough sets, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fuzzy Rough Communication Model and its Properties

    Publication Year: 2007, Page(s):3699 - 3703
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB) | HTML iconHTML

    More accurate information is required in the process of information communication, and the communicated concept is a fuzzy set, according to the above situations, this paper proposes a new fuzzy rough communication model using rough fuzzy sets. It investigates its properties, analyzes relationships between knowledge and fuzzy information invariability, knowledge and fuzzy information loss, and obt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of the Knowledge System Based on Basic Rules

    Publication Year: 2007, Page(s):3704 - 3707
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB) | HTML iconHTML

    According to the ideas of the space base in linear algebra, this article applies techniques of database and object-oriented programming to present a method of design of the knowledge system based on basic rules. The concept of the basic decision rule is given, the result that any certain (or uncertain) rule can be generated by some certain (or certain and uncertain) basis decision rules is proved,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy-Rough Data Reduction Based on Information Entropy

    Publication Year: 2007, Page(s):3708 - 3712
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (510 KB) | HTML iconHTML

    Presently, many researches have been carried out on rough set based data reduction. However, this method encounters a problem when dealing with real-valued data and fuzzy information. By lucubrating the theory of fuzzy rough set and utilizing the definition of information entropy presented in literature [5], the information entropy model of fuzzy rough set has been constructed. Then the conditiona... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rough Approximations of Intuitionistic Fuzzy Sets

    Publication Year: 2007, Page(s):3713 - 3718
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    In this paper, rough approximations in intuitionistic fuzzy set theory are discussed. The concepts of intuitionistic rough fuzzy sets and intuitionistic fuzzy rough sets are introduced. Their basic properties and operations are examined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Rough Sets in Image Median Filter

    Publication Year: 2007, Page(s):3719 - 3721
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (553 KB) | HTML iconHTML

    An improved median filter algorithm based on Rough Sets is presented in the paper. The algorithm first divides the image into several parts and uses Rough Sets theory to classify the pixel in each part then noise pixels can be separated and be removed by median filtering. Compared with standard median filter, the results of computer simulation experiments show that this new filter has better filte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further Discussions on Rough Probability and Rough Random Variables

    Publication Year: 2007, Page(s):3722 - 3727
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (649 KB) | HTML iconHTML

    Rough set is a new mathematical tool to handle problems of imprecision, uncertainty, and vagueness. The phenomena of roughness and randomness appear at the same time in our real world, but the rough set can not deal with the case, so it is essential to establish a rough probability theory to handle these phenomena. The rough probability theory is further discussed in this paper. Firstly, rough pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Granularity Lattices

    Publication Year: 2007, Page(s):3728 - 3733
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (765 KB) | HTML iconHTML

    The theory of rough sets, formal concept analysis and granular computing are important mathematical tool for data analysis and knowledge processing. In the paper, we propose the notion of information granules in information systems by combining the theory of rough sets and formal concept analysis. We show all the information granule forms a complete lattice in information systems, and we present t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic Incident Detection Based on Rough Sets Approach

    Publication Year: 2007, Page(s):3734 - 3739
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    This paper presents an approach to detect traffic incident which uses the rules generated by rough sets theory to classify traffic patterns for incident detection. Performance metrics such as detection rate, false alarm rate, mean time to detection and classification rate are computed. By way of illustration, a simulated traffic data set which is balanced and the real 1-880 freeway traffic data co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Granules and Approximations in Incomplete Information Systems

    Publication Year: 2007, Page(s):3740 - 3745
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (697 KB) | HTML iconHTML

    In this paper three types of information granular structures, called similarity classes, maximal consistent blocks, and labeled blocks, in incomplete information systems are introduced. Their properties are examined. Based on the three structures of granules, three types of rough set approximation models are derived for mining of certain and possible rules in incomplete decision tables. The relati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of the Third Type of Covering-Based Rough Sets

    Publication Year: 2007, Page(s):3746 - 3751
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations, or partitions. This paper studies covering-based generalized rough sets. In this setting, a covering can generate a lower approximation operation and an upper approx... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Rough Set Operators Based on the Neighborhood Systems and its Applications

    Publication Year: 2007, Page(s):3752 - 3757
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB) | HTML iconHTML

    In present paper, we give two rough set new operators based on the neighborhood system, under this two operators, the two important inequalities in rough set theory is modified to become equalities. The usefulness information will not be lost. In the other hand, it is also decreased the mistake information. Meanwhile, we also discuss the roughness and precision of a fuzzy set in the generalized ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Granular Ranking Algorithm Based on Rough Sets

    Publication Year: 2007, Page(s):3758 - 3763
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (686 KB) | HTML iconHTML

    Based on the original granular ranking algorithm proposed by the author, this paper proposes a granularity set combination algorithm with the time complexity of O(mn), thus constructs an incremental granular ranking algorithm. The computation result of new algorithm is in the form of ranked list, which can avoid many disadvantages in traditional data mining techniques, and can be applied for the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on VRPTW of Optimizing Based on Hierarchy Clustering Method and HGA for Electronic Commerce

    Publication Year: 2007, Page(s):3764 - 3769
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (747 KB) | HTML iconHTML

    Electronic commerce is a new commercial mode. Its logistics enterprise will face with such modern logistics distribution market of customers' individual and various demand, high service level and quality, high cost and risk. Therefore, the traditional vehicle scheduling is not easy to satisfy with the real demand of logistics distribution under electronic commerce so as that distribution cost cann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design of Embedded LCMS Broker with Load- Balancing Function

    Publication Year: 2007, Page(s):3770 - 3776
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (967 KB) | HTML iconHTML

    This paper proposes a design for embedded learning content management system broker (embedded LCMS broker) with load balancing capabilities. Through this load balancing capable embedded LCMS broker, one is able to balance the loading of multiple LCMS by dynamic recording method. The proposed system platform includes the learning management system that records online education, LCMS that provides t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fault Detection Mechanism for Fault-Tolerant SOA-Based Applications

    Publication Year: 2007, Page(s):3777 - 3781
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    Fault tolerance is an important capability for SOA-based applications, since it ensures the dynamic composition of services and improves the dependability of SOA-based applications. Fault detection is the first step of fault detection, so this paper focuses on fault detection, and puts forward a fault detection mechanism, which is based on the theories of artificial neural network and probability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical Facility Costs Optimal Methods Based on Disperse Move

    Publication Year: 2007, Page(s):3782 - 3787
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    In this paper, we study a variant of the facility location problem where facility cost depends on the set of clients assigned to the facility and the local search method. Consider the facility location problem with hierarchical facility costs, and give the first constant factor approximation algorithm for the problem independent of the number of levels in the hierarchy tree. By using the disperse ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.