By Topic

2009 IEEE International Conference on Granular Computing

17-19 Aug. 2009

Filter Results

Displaying Results 1 - 25 of 175
  • [Front matter]

    Publication Year: 2009, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • Contents

    Publication Year: 2009, Page(s):i - x
    Request permission for commercial reuse | PDF file iconPDF (1204 KB)
    Freely Available from IEEE
  • Generalized bags and their relations: An alternative model for fuzzy set theory and applications

    Publication Year: 2009, Page(s): 3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (471 KB)

    Bags alias multisets have been known to be a fundamental tool for information system models. Hence bags have been studied for a long time by famous computer scientists. Fuzzy bags have originally been proposed by Yager, and several researches about their applications have been done. Miyamoto established fundamental operations of fuzzy bags, and proposed generalized bags that include real-valued ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ubiquitous/pervasive intelligence: Visions and challenges

    Publication Year: 2009, Page(s): 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB)

    Ubiquitous/pervasive computers, networks and information are paving a road towards a smart world (SW) in which computational intelligence is distributed throughout the physical environment to provide trustworthy and relevant services to people. This ubiquitous/pervasive intelligence (UI/PI) will change the computing landscape because it will enable new breeds of applications and systems to be deve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ubiquitous personalized information processing with wildcards

    Publication Year: 2009, Page(s): 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB)

    Summary form only given. With the rapid development of computer, communication and networking technologies, Web information resources are becoming increasingly rich, and on-line applications are required to be more and more flexible. Therefore, a new generation of information models and mechanisms for these information processing requirements has become a major challenge. This talk will discuss fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational models in systems biology

    Publication Year: 2009, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (591 KB)

    While much of molecular biology research has led to a wealth of knowledge about individual cellular components and their functions, it has become increasingly clear that most cellular functions are carried out by complex networks of interconnected components, and that the characterization of isolated cellular components is not sufficient to understand the cell's complexity. In recent years, the de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-throughput DNA sequencing and bioinformatics: Bottlenecks and opportunities

    Publication Year: 2009, Page(s): 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    With the emergence of high-throughput genome sequencers from various companies including Applied Biosystems, Illumina and Roche, the conventional approach of genomic investigation has been revolutionized and new applications involving these sequencers have been designed and adopted not only in genome centres, but also in general laboratories working on biological and biomedical research. These gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal theory of granular computing, and two major applications

    Publication Year: 2009, Page(s): 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    This talk will focus on the formal theory and nature of granular computing, concept analysis in Web informatics, and it will give a brief discussion on the problem of information propagation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of trends of technical phrases in text mining

    Publication Year: 2009, Page(s):7 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    In text mining processes, the importance indices of the technical terms play a key role in finding valuable patterns from various documents. Further, methods for finding emergent terms have attracted considerable attention as an important issue called temporal text mining. However, many conventional methods are not robust against changes in technical terms. In order to detect remarkable temporal t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust stability of Fuzzy Elman Neural Network

    Publication Year: 2009, Page(s):13 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    This paper proposed three methods for existence of a common quadratic Lyapunov function for robust stability analysis of fuzzy Elman neural network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On SP-closedness in L-topological spaces

    Publication Year: 2009, Page(s):19 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB) | HTML iconHTML

    By means of semi-pre-open L-sets and their inequality, a new form of SP-closedness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This new form does not depend on the structure of basis lattice L and L does not require any distributivity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Maximal Frequent Pattern mining of DNA sequence

    Publication Year: 2009, Page(s):23 - 26
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1577 KB) | HTML iconHTML

    The DNA sequence data is one of the basic and important data among biological data. The DNA sequence pattern mining has got wide attention and rapid development. Traditional algorithms for the sequential pattern mining may generate lots of redundant patterns when dealing with the DNA sequence. The maximal frequent pattern is preferable to express the function and structure of the DNA sequence. Bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence rates for a class of neural networks with logarithmic function

    Publication Year: 2009, Page(s):27 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (113 KB) | HTML iconHTML

    The aim of this paper is to estimate the approximation error which results from the method of feedforward neural networks (FNNs) with logarithmic sigmoidal function s(x) = (1 + e-x)-1. By means of an extending function approach, a class of FNNs with single hidden layer and the active function s(x) is constructed to approximate the continuous function defined on a compact inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of second-order Dominance-based approximation space by neighborhood systems

    Publication Year: 2009, Page(s):33 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (131 KB) | HTML iconHTML

    This paper introduces the representation of generalized dominance-based decision tables by neighborhood systems. Dominance-based rough set approach (DRSA) introduced by Greco et al. is a useful tool for multi-criteria data analysis problems. Recently, Dembczynski et al. introduced the concept of generalized decisions as a generalization of the DRSA where criteria in a decision table may be assigne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse Bayesian learning for ranking

    Publication Year: 2009, Page(s):39 - 44
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    In this paper, we propose a sparse Bayesian kernel approach to learn ranking function. In sparse Bayesian framework, a relevance determination prior over weights is used to automatic relevance determination. The inference techniques based on Laplace approximation is derived for model selection. By this approach accurate prediction models can be derived, which typically utilize dramatically fewer b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Appending mining data of spatial object for query

    Publication Year: 2009, Page(s):53 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    Object-area related mining is an important topic in the application of spatial data. In this paper, we propose ten fundamental mining items for R-tree data access. To reflect the overlap characteristic of spatial object, we add three advanced mining items to R-tree. The values of these proposed items are pre-calculated and distributed to each entry of node of R-tree in advance. The time of searchi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gain-ratio-Based Selective classifiers for incomplete data

    Publication Year: 2009, Page(s):57 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB) | HTML iconHTML

    By deleting irrelevant or redundant attributes of a data set, selective classifiers can effectively improve the accuracy and efficiency of classification. Though many selective classifiers have been proposed, most of them deal with complete data. Yet actual data sets are often incomplete and have many redundant or irrelevant attributes. So constructing selective classifiers for incomplete data is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive action selection using utility-based reinforcement learning

    Publication Year: 2009, Page(s):67 - 72
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    A basic problem of intelligent systems is choosing adaptive action to perform in a non-stationary environment. Due to the combinatorial complexity of actions, agent cannot possibly consider every option available to it at every instant in time. It needs to find good policies that dictate optimum actions to perform in each situation. This paper proposes an algorithm, called UQ-learning, to better s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Granular Matrix and redefined RST system

    Publication Year: 2009, Page(s):95 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    The main objective of this paper is to put forward Granular Matrix (GrM). By the definition of GrM, all the fundamental algebraic definitions of Rough Set Theory (RST) are redefined by simple matrix operation. Furthermore, two different definitions (algebraic definition and rough membership function definition) for rough inclusion and rough equivalence are united by GrM. GrM help us understand the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting gene function with positive and unlabeled examples

    Publication Year: 2009, Page(s):89 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (130 KB) | HTML iconHTML

    Predicting gene function is usually formulated as binary classification problem. However, we only know which gene has some function while we are not sure that it doesn't belong to a function class, which means that only positive examples are given. Therefore, selecting a good training example set becomes a key step. In this paper, we cluster the genes on integrated weighted graph by generalizing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic unsupervised Chinese sentence compression

    Publication Year: 2009, Page(s):61 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Research on sentence compression has been undergoing for many years in other languages, especially in English, but research on Chinese sentence compression is rarely found. In this paper, we describe an efficient probabilistic and syntactic approach to Chinese sentence compression. We introduce the classical noisy-channel approach into Chinese sentence compression and improve it in many ways. Sinc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on the approach of dynamically maintenance of approximations in rough set theory while attribute values coarsening and refining

    Publication Year: 2009, Page(s):45 - 48
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (147 KB) | HTML iconHTML

    In rough set theory (RST), upper and lower approximations of a concept will change dynamically while the information system varies over time. How to update approximations based on the original approximations' information is an important problem since it may improve the efficiency of knowledge discovery. This paper focuses on the approach for dynamically updating approximations when attribute value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for identification of real belief measures

    Publication Year: 2009, Page(s):83 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (166 KB) | HTML iconHTML

    Belief measures are widely applied to management of uncertainty in information fusion. In most published applications, the estimations of belief measures that come from empirical rescouses, such as expert systems, are considered to be real belief measures without any validation. We proposed an efficient algorithm that can quickly detect the contradiction between the estimation and requirements of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An incremental updating principle for computing approximations in information systems while the object set varies with time

    Publication Year: 2009, Page(s):49 - 52
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (167 KB) | HTML iconHTML

    Approximations of a concept in the variable precision rough set model will change when an information system varies with time. Usually, it is an effective method to carry out incremental updating approximations by using existing information in the dynamic environment. This paper focuses on the incremental updating principle of computing approximations while objects in information systems dynamical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • License plate text localization using DWT and neural network

    Publication Year: 2009, Page(s):73 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    The license plate text automatic localization is one of the important research subjects in the intelligent transportation system. License plate texts provide highly condensed information about the contents of images. It proposes a license plate text localization method using discrete wavelet transform (DWT) and neural network. Because the DWT coefficients provide important information of text regi... View full abstract»

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