By Topic

2008 IEEE 8th International Conference on Computer and Information Technology Workshops

8-11 July 2008

Filter Results

Displaying Results 1 - 25 of 126
  • [Front cover]

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

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • [Copyright notice]

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

    Publication Year: 2008, Page(s):v - xiii
    Request permission for commercial reuse | PDF file iconPDF (157 KB)
    Freely Available from IEEE
  • Message from the Chairs

    Publication Year: 2008, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (110 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Organization

    Publication Year: 2008, Page(s):xv - xx
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • Website Data Storage Management during Data Lifecycle Taking into Account of Time Effect

    Publication Year: 2008, Page(s):3 - 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (64 KB) | HTML iconHTML

    The data lifecycle means the process from datapsilas advent to its disappearance; the data management runs through the whole data lifecycle. Data management aims at providing the data which are complete, accurate and conducts time effect for userspsila data retrieval. At each stage of datapsilas life cycle, different demands exist upon data management, among which data store management is the most... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Strategy for Attributes Selection in Cost-Sensitive Decision Trees Induction

    Publication Year: 2008, Page(s):8 - 13
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Decision tree learning is one of the most widely used and practical methods for inductive inference. A fundamental issue in decision tree inductive learning is the attribute selection measure at each non-terminal node of the tree. However, existing literatures have not taken both classification ability and cost-sensitive into account well. In this paper, we present a new strategy for attributes se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of Chinese Event and Their Argument Roles

    Publication Year: 2008, Page(s):14 - 19
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    Event detection and recognition is a major task in ACE evaluation plan. In this paper, we focus on solving the two subtasks: (1) event detection and classification, (2) their argument role identification. For the first subtask, the strategy of local feature selection and explicit discrimination of positive and negative features is used in order to ensure the performance of each type. For the secon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Indexing Compression for Spatial Databases

    Publication Year: 2008, Page(s):20 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    The KDB-tree is a traditional point access method for retrieving multidimensional data. Many literatures frequently address the low storage utilization and insufficient retrieval performance as two bottlenecks for KDB-tree family of structures. A large amount of unnecessary splits caused by data insertion orders and data skewness is the fatal reason for these two bottlenecks. Compressing KDB-trees... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Association Rule Algorithms for Logical Equality Relationships

    Publication Year: 2008, Page(s):26 - 30
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (110 KB) | HTML iconHTML

    The association rule has become one of the most important techniques in data mining. New algorithms must be developed in order to apply it to more areas. This paper proposes association rule algorithms for logical equality relationships, modified from the original Apriori and FP-Growth algorithms. Logical equality is defined as truerarrtrue (1rarr1) or falserarrfalse (0rarr0) associations. This sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Control of Symmetric Data Interpolation Surface

    Publication Year: 2008, Page(s):31 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1327 KB) | HTML iconHTML

    This paper discuss the property of symmetric data interpolation surface. For the given data, when the parameters very, the interpolating surface varies, so the interpolating surfaces can be modified by selecting suitable parameters under the condition that the interpolation data are not changed. The problem is that when the two parameters vary, how does the interpolating surface change. The discus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Algorithm for Mining Closed Frequent Itemsets in Data Streams

    Publication Year: 2008, Page(s):37 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    Mining closed frequent itemsets in the sliding window is one of important topics of data streams mining. In this paper, we propose a novel algorithm, FPCFI-DS, which mines closed frequent itemsets in the sliding window of data streams efficiently, and maintains the precise closed frequent itemsets in the current window at any time. The algorithm uses a single-pass lexicographical-order FP-Tree-bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CUZ: An Improved Clustering Algorithm

    Publication Year: 2008, Page(s):43 - 48
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    Clustering is for many years now one of the most complex and most studied problems in data mining. Until now the most commonly used algorithm for finding groups of similar objects in large databases is CURE. The main advantage of CURE, compared to other clustering algorithms, is its ability to identify non spherical or rectangular shaped objects. In this paper we present a new algorithm called CUZ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robot Task Planning for Mixed-Initiative Human Robot Interaction in Home Service Robot

    Publication Year: 2008, Page(s):49 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    The main reason of current robotics research is the difficulties of coping with dynamic environment, uncertainty, operational limitation, etc. Human robot interaction (HRI) becomes important role in robotics research and especially humanpsilas roles in HRI is increasing. In this paper, we made robot task planning framework for MI HRI in home service environment. We suggest an structure of task net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Robust Bagging Method Using Median as a Combination Rule

    Publication Year: 2008, Page(s):55 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    Bagging has been known to be successful in increasing the accuracy of prediction of the unstable classifiers. In bagging predictors are constructed using bootstrap samples from the training sets and then aggregated to form a bagged predictor. The robust bagging discard the bootstrapped classifiers generating extreme error rates, as estimated by the out-of-bag error rate and to combine over the rem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application Research of Dominance Relation Rough Set on Seismology Data

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

    In this paper, after discussing classical rough set theory based on indiscemibility relation and the problem of its reduction algorithms on Seismology Data, we arrived at a new definition of dominance distinguishing matrix by taking advantage of the unique characteristic of the extended model. Then the corresponding reduction and rule extracting algorithms are accordingly presented to enhance the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring the Influence of Sampling on Pattern Support Distribution

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

    Identifying the pattern support distribution (PSD) in datasets is useful for many data mining tasks, such as market basket analysis. The support of a pattern is the frequency of its occurrence in a dataset. Calculating the distribution of these supports over an entire dataset is computationally expensive; this cost can be reduced by sampling from the dataset and computing the PSD on a relatively s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CRFP: A Novel Adaptive Replacement Policy Combined the LRU and LFU Policies

    Publication Year: 2008, Page(s):72 - 79
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    A variety of cache replacement algorithms have been proposed and applied in different situations, in which the LRU (least recently used) and LFU (least frequently used) replacement policies are two of the most popular policies. However, most real systems donpsilat consider obtaining a maximized throughput by switching between the two policies in response to the access pattern. In this paper, we pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding Dependency Trees from Binary Data

    Publication Year: 2008, Page(s):80 - 85
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (217 KB) | HTML iconHTML

    Much work has been done in finding interesting subsets of items, since it has broad applications in financial data analysis, e-commerce, text data mining, and so on. Though the well-known frequent pattern mining attracted much attention in research community, recently, more work has been devoted to analysis of more sophisticated relationships among items. Chow-Liu tree and low-entropy tree, for ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Defining Keys for XML

    Publication Year: 2008, Page(s):86 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Keys are an important part of any data model. In relational model, keys are well studied and are widely used. In recent years, XML has emerged as an widely used data representation and storage format in the world wide Web. The data centric approach of XML has necessitated the definition of integrity constraints for XML. XML key is regarded as one of those integrity constraints. In this paper, we d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An HRV Patterns Discovering Neural Network for Mobile Healthcare Services

    Publication Year: 2008, Page(s):92 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    Implantable devices such as pulse, ECG, and movement sensors that can be embedded in day to day wearables have been drawn a lot of research attentions in the field of wireless sensor network nowadays. In this research, we focus on developing an incremental adaptive network to detect subject at risk of coronary heart disease based on long-term Heart Rate Variability (HRV) measurement under blood pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robot with Emotion for Triggering Mixed-Initiative Interaction Planning

    Publication Year: 2008, Page(s):98 - 103
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    Emotion is one of human communication' channels; and in this paper -as part of mixed-initiative-emotion is used for triggering user interaction. Three interaction-planning modes which agglutinate seven interaction-types are introduced. This work shows how the existing framework changes by adding emotion to robot. For planning, scripts are used for the implementation of the ideas presented, where e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hashed Multiple Lists: A Stream Filter for Processing Continuous Query with Multiple Attributes in Geosensor Networks

    Publication Year: 2008, Page(s):104 - 109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1742 KB) | HTML iconHTML

    Many researches for processing continuous query are important to be processed in real time on data stream environments. Continuous query should be inserted and searched in real time on data stream environments. Some indexing techniques are applied in order to process continuous queries. Previous work is not able to support the dynamic insertion and deletion operation for building an index previous... View full abstract»

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