By Topic

2005 IEEE International Conference on Granular Computing

Date 25-27 July 2005

Go

Filter Results

Displaying Results 1 - 25 of 79
  • [Cover]

    Publication Year: 2005, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (879 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2005, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2005, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):i - xiii
    Request permission for commercial reuse | PDF file iconPDF (1189 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2005, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (105 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organization charts

    Publication Year: 2005, Page(s):xvii - xviii
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Approximate reduct computation by rough sets based attribute weighting

    Publication Year: 2005, Page(s):383 - 386 Vol. 2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB) | HTML iconHTML

    Rough set theory provides the reduct and the core concepts for knowledge reduction. The cost of reduct set computation is highly influenced by the attribute set size of the dataset where the problem of finding reducts has been proven as an NP-hard problem. This paper proposes an approximate approach for reduct computation. The approach uses the discernibility matrix concept and a weighting mechani... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kolmogorov complexity based automata modeling for intrusion detection

    Publication Year: 2005, Page(s):387 - 392 Vol. 2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2728 KB) | HTML iconHTML

    According to Kolmogorov complexity, a string is considered patternless if the shortest Turing machine that can encode it is at least as long as the string itself. Conversely, a non-random string with patterns can be described by some Turing machine that is shorter than the string. Hence, special forms of Turing machines - such as functions, N-grams, finite automata and stochastic automata - can al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of non-distinct Solow economic growth model

    Publication Year: 2005, Page(s):393 - 396 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    A variety of fuzzy phenomena exist in economic systems in the realistic world, so it is of great significance to build a model with fuzzy numbers to solve them after analysis is done in research of Solow economic growth model. However, the function with fuzzy numbers is not differentiable. Moreover, the traditional operation rules can not be used to solve the fuzzy general quadrate equality. The a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DCf: a double clustering framework for fuzzy information granulation

    Publication Year: 2005, Page(s):397 - 400 Vol. 2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB) | HTML iconHTML

    In this paper, we present a framework for extracting well-defined and semantically sound information granules. The framework is mainly centered on a double clustering process, hence, it is called DCf (double clustering framework). A first clustering process identifies cluster prototypes in the multidimensional data space, then the projections of these prototypes are further clustered along each di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An e-intelligence approach to e-commerce intrusion detection

    Publication Year: 2005, Page(s):401 - 404 Vol. 2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1624 KB) | HTML iconHTML

    As enterprise level e-commerce applications are integrated over the Internet, security has become an increasingly important issue. Under this new integrated Web services environment, simple black-and-white logic is not sufficient to deal with complex intrusion detection problems. E-intelligence must be added into the application layer for a better detection of malicious intruders using legitimate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A kind of support vector fuzzy classifiers

    Publication Year: 2005, Page(s):405 - 408 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    Support vector machine (SVM) is a new promising machine learning method with good generalization ability, which learns the decision surface from two distinct classes of input points. But in many applications, the data are not always obtained precisely, i.e. there exist some fuzziness in the data. In this paper, we reformulated the conventional support vector classifiers such that they can learn fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of a matrix-based binary granular computing algorithm in RST

    Publication Year: 2005, Page(s):409 - 412 Vol. 2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    Upper approximation and lower approximation are the basic definitions in rough set theory (RST). Equivalent partition generates classification and brings granulation structures of a universe. As the extension of RST, in this paper, a matrix-based binary granular computing algorithm is proposed. Furthermore, a standardized algorithm is designed to compute the positive region, negative region, the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indiscernibility criterion based on rough sets in feature selection and detection of landmines

    Publication Year: 2005, Page(s):413 - 416 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 KB) | HTML iconHTML

    Metal detectors currently used by the teams engaged in decontamination of mines, cannot differentiate a mine from metallic debris where the soil contains large quantities of metal scraps and cartridge cases. Landmines are a significant barrier to financial, economic and social development in various parts of this world, so a sensor is required that reliably confirms that the ground being tested do... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal granular logic for temporal data mining

    Publication Year: 2005, Page(s):417 - 422 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB) | HTML iconHTML

    In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The formalism, based on first-order temporal logic, is then extended to include the concept of temporal granularity. Based on this theoretical framework, a detailed study is made to investigate the formal relationships between th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequent calculus system for rough sets based on rough Stone algebras

    Publication Year: 2005, Page(s):423 - 426 Vol. 2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    Many researchers study rough sets from the point of description of the rough set pairs (a rough set pair is also called a rough set), i.e., . An important result is that the collection of rough sets of an approximation space can be made into a Stone algebra. The collection of all subsets of a set forms a Boolean algebra under the usual set theoreti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and verification of train safety comprehensive monitoring system using temporal Petri nets

    Publication Year: 2005, Page(s):427 - 430 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Petri nets and temporal logic are efficient tools to study concurrent systems, but each has their own shortages. Thus, we introduce temporal Petri nets to model, analyze and verify train safety comprehensive monitoring system. On one hand, we describe frameworks of this system using Petri nets. On the other hand, we use temporal logic to describe temporal relationships of system states. Then, we a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent agent-based expert system architecture for generating work plan in marshalling station

    Publication Year: 2005, Page(s):431 - 434 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    The present approach for generating work plan is difficult to meet the dynamic and intelligent requirement, and it has not had the function of assistant decision yet. An agent that can simulate the reasoning process of human has the properties such as adaptability and intelligence, which can be used to solve the problems in making plan process. This paper has presented the initial architecture for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A weighting scheme based on emerging patterns for weighted support vector machines

    Publication Year: 2005, Page(s):435 - 440 Vol. 2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB) | HTML iconHTML

    Support vector machines (SVMs) are powerful tools for solving classification problems and have been applied to many application fields, such as pattern recognition and data mining, in the past decade. Weighted support vector machines (weighted SVMs) extend SVMs by considering that different input vectors make different contributions to the learning of decision surface. An important issue in traini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Qualitative Mapping, Criterion Trasformation and Artificial Neuron

    Publication Year: 2005, Page(s):441 - 446
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1530 KB) | HTML iconHTML

    A mathematical model for describing the disciplinarian that the true value of property p(x) varies according to it's qualitative criterion [alpha, beta], called the qualitative mapping taup (x,[alpha, beta]) is presented in this paper, and the inner product transformation of qualitative criterion [alpha, beta], denoted by w_[alpha, beta] is discussed. It is shown that an artificial neur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approach to linear programming with fuzzy coefficients based on fuzzy numbers distance

    Publication Year: 2005, Page(s):447 - 450 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    In this paper, we first present a new distance between fuzzy numbers, then rank fuzzy numbers with the help of the new distance, and then we apply the distance to linear programming with fuzzy coefficients, transforming linear programming with fuzzy coefficients into crisp linear programming. Finally, we give a numerical example to illustrate its feasibility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • v-support vector classification with uncertainty based on expert advices

    Publication Year: 2005, Page(s):451 - 453 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    Support vector techniques have been successfully applied to many real-world problems, but it is difficult to select the parameter C. The v-support vector classification (v-SVC) has the advantage of a parameter v on controlling the number of support vectors. However, it is required that every input must be exactly assigned to one of these two classes without any uncertainty. A new v-SVM technique i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of BP neural network based on MECA

    Publication Year: 2005, Page(s):454 - 457 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    This paper designs BP neural network with mind evolution clone algorithm (MECA). Taking the relation between diversity of mind evolution population and clone mechanism of biology into account, MECA is proposed in the paper. Not only can the algorithm converge to globally optimal solution, but also it solves premature convergence problem efficiently. The algorithm has been applied to training XOR. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy approximation operators based on internal/external factors analysis

    Publication Year: 2005, Page(s):458 - 461 Vol. 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Centered on the philosophic rule of the internal and external factors of the alteration and development of objects, the paper sets up a dynamic information system driven by the external factors. Accordingly, it proposes two pairs of fuzzy approximation operators based on internal/external factors analysis in dynamic information system. It applies the pairs into the study on the fuzzy actions of ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new multiresolution classification model based on partitioning of feature space

    Publication Year: 2005, Page(s):462 - 467 Vol. 2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2280 KB) | HTML iconHTML

    Multiresolution analysis is a hot topic in the past decade. In this paper, we propose a new multiresolution classification method which adopts a coarse-to-fine strategy both during the training and the testing processes based on decomposing of the feature space. The training algorithm locates the boundary between two classes from coarse to fine by dividing the hypercubes which lie on the boundary ... View full abstract»

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