By Topic

Web-Age Information Management Workshops, 2006. WAIM '06. Seventh International Conference on

Date 17-19 June 2006

Filter Results

Displaying Results 1 - 25 of 31
  • Seventh International Conference on Web-Age Information Management Workshops [Cover]

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Web-Age Information Management Workshops-Title

    Publication Year: 2006 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Web-Age Information Management Workshops-Copyright

    Publication Year: 2006 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (443 KB)  
    Freely Available from IEEE
  • Seventh International Conference on Web-Age Information Management Workshops - TOC

    Publication Year: 2006 , Page(s): v
    Save to Project icon | Request Permissions | PDF file iconPDF (33 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2006 , Page(s): vii
    Save to Project icon | Request Permissions | PDF file iconPDF (32 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organization

    Publication Year: 2006 , Page(s): viii - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (30 KB)  
    Freely Available from IEEE
  • Challenges in Preserving Location Privacy in Peer-to-Peer Environments

    Publication Year: 2006 , Page(s): 1
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (307 KB) |  | HTML iconHTML  

    In location-based services (LBS), users have to continuously report their locations to the database server to entertain the service. For example, a user asking about her nearest gas station has to report her exact location to the database server. With untrustworthy servers, LBS may pose a major privacy threat on its users. In other words, the existing model of LBS trades service for user privacy. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research and Implementation on Routing Scheme Based on Interest Mining in Unstructured P2P Systems

    Publication Year: 2006 , Page(s): 2
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (130 KB) |  | HTML iconHTML  

    In the environment of unstructured peer-to-peer (P2P), routing scheme is one of the key factors affecting information searches. A routing scheme based on interest indexical table is proposed in this paper. Moreover, on the basis of it, we implement a P2P full text information retrieval prototype system, Isearch. Firstly, we represent local file content of a peer with vector space model. After that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Slack Factors Based Real-Time Query Processing Approach in Wireless Sensor Networks

    Publication Year: 2006 , Page(s): 3
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (301 KB) |  | HTML iconHTML  

    For mission-critical applications such as emergency monitoring over wireless sensor networks, query deadline must be satisfied. Otherwise, the query results would be useless. Thus, it is better to query the nodes as many as possible within the deadline. On the other hand, the energy consumption should be saved to prolong the life of the network. For this purpose, we propose a slack factor based re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rule-Based Mailing System for an Organization

    Publication Year: 2006 , Page(s): 4
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (331 KB) |  | HTML iconHTML  

    An organization usually operates its own mailing system to provide each person with an e-mail address under its domain name. There may exist a number of mailing lists in use, each of which refers to a group of its subscribers. The problem entailed in this conventional mailing scheme is that it requires constant administration from its initiation to its maintenance. This paper proposes a rule-based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Masquerader Detection Using OCLEP: One-Class Classification Using Length Statistics of Emerging Patterns

    Publication Year: 2006 , Page(s): 5
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (142 KB) |  | HTML iconHTML  

    We introduce a new method for masquerader detection that only uses a user¿s own data for training, called Oneclass Classification using Length statistics of Emerging Patterns (OCLEP). Emerging patterns (EPs) are patterns whose support increases from one dataset/class to another with a big ratio, and have been very useful in earlier studies. OCLEP classifies a case T as self or masquerader by usin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing Path Generation Algorithm with Network Performance Constraints for Nondeterministic Parallel Programs

    Publication Year: 2006 , Page(s): 6
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (458 KB) |  | HTML iconHTML  

    Nondeterministic behaviors of parallel programs require dedication software testing functionality. It is very difficult to test nondeterministic parallel programs systematically. Although plain reachability testing method can deal with the non-determinism, it may generate huge number of execution paths during the testing procedure. This condition is intractable to cope with in practice. Adding som... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache Strategies for Semantic Prefetching Data

    Publication Year: 2006 , Page(s): 7
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (277 KB) |  | HTML iconHTML  

    In this paper, we propose a Semantic Prefetching (SP) scheme as a new dissemination method for semantic information, using a dynamic caching strategy that considers a preference of user in Semantic Prefetching Area (SPA). Our contribution is that a proposed mechanism maintains query results in the cache before a user requests a query. In SP, an efficient algorithm for searching a prefetching descr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining Aggregate Views over Streams

    Publication Year: 2006 , Page(s): 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Sliding-window aggregate queries over streams are an important class of continuous queries for online monitoring applications. In this paper, the evaluation results of sliding-window aggregates are seen as views, and we propose an aggregate framework with a baseline algorithm and an extended self-adaptive algorithm for maintaining sliding-window aggregate views over streams. We propose a taxonomy ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Subset Matching

    Publication Year: 2006 , Page(s): 9
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (210 KB) |  | HTML iconHTML  

    The subset matching problem is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text location is a set of characters drawn from some alphabet. The pattern is said to occur at text position i if the set p[j] is a subset of the set t[i + j - 1], for all j (1 leqslant j leqslant m). This is an extension of the classic string matching and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Optimization of Complex XML Queries over XML Streams under DTD

    Publication Year: 2006 , Page(s): 10
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (346 KB) |  | HTML iconHTML  

    Time and Space complexity is a critical factor for a successful stream-based continuous query processing system. In this paper, we address the optimization of complex XML queries over XML Streams by using the semantic and structural constraints of its DTD. The optimization is preprocessed before the runtime of matching XML stream against user¿s queries in order to simplify XPathes. An approach th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Cube Blocks Effectively for Stream Data Analysis

    Publication Year: 2006 , Page(s): 11
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    With the rapid growth of WWW, many applications based on web are generating tremendous amount of data. Analyzing and mining such data will be important for administrators and other users. Because these data are increasing continuously and rapidly, retrieving these data efficiently and effectively are challenging tasks. In this paper, we propose a new Cube Block model to organize multi-dimensional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining Materialized Relations Incrementally to Improve Performance of Ontology Query

    Publication Year: 2006 , Page(s): 12
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    For ontology-based applications, the efficiency of ontology query is vital. Different from existing approaches, the paper improves performance of ontology query by materializing some derived relations. Experimental results show that the integrated performance of ontology query can be improved greatly by maintaining materialized relations and the materialized relations technique has good scalabilit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Even Partition to Accelerate Structure Join

    Publication Year: 2006 , Page(s): 13
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (497 KB) |  | HTML iconHTML  

    Among most of the approaches about XML query processing, structure join is more popular and efficient. The evaluation of structural relationship in the join, specifically the parent-child or ancestordescendant relationship, between XML element sets has imposed a great challenge on efficient XML query processing. In this paper, we present, PRIAM, an efficient algorithm for structure join by evenly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group Insert Tree with Projection for Handling Vehicle Information Effectively in LBS

    Publication Year: 2006 , Page(s): 14
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (382 KB) |  | HTML iconHTML  

    The dynamic advances of wireless telecommunication and positioning technologies lead to develop the moving object management system and provide suitable services according to the vehicle locations. To provide these location based services smoothly, it is necessary for an index technique to store and search lots of moving object data rapidly. However, most of the existing bulk loading techniques of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering Research Based on Density Gradient

    Publication Year: 2006 , Page(s): 15
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (268 KB) |  | HTML iconHTML  

    Cluster analysis, intending to help users understand the natural grouping or structure in a data set, has received a lot of attention in the last few years. Aimed to solve difficult problems in clustering with irregularly distributed data set, a new clustering algorithm based on density gradient is provided. With analysis of density of each point and its neighbors, the algorithm searches points wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Clustering Algorithm for Small Text Documents

    Publication Year: 2006 , Page(s): 16
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    Clustering text documents into different category groups is an important problem. The size of desired clusters is an important requirement for a clustering solution. In this paper, we present an efficient clustering algorithm called RTC based on the spherical k-means algorithm for small text documents. In RTC, we present a new initial centers choice method based on the density and farthest distanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic Algorithm-based Text Clustering Technique: Automatic Evolution of Clusters with High Efficiency

    Publication Year: 2006 , Page(s): 17
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    In this paper, we propose a modified variable string length genetic algorithm (MVGA) for text clustering. Our algorithm has been exploited for automatically evolving the optimal number of clusters as well as providing proper data set clustering. The chromosome is encoded by a string of real numbers with special indices to indicate the location of each gene. More effective versions of operators for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining Frequent Induced Subtrees by Prefix-Tree-Projected Pattern Growth

    Publication Year: 2006 , Page(s): 18
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1207 KB) |  | HTML iconHTML  

    Frequent subtree pattern mining is an important data mining problem with broad applications. Most existing algorithms, such as Apriori-like algorithms, are based on candidate-generation-and-test framework, except for Chopper and XSpanner [8]. Unfortunately, candidate pattern generation and test used in Apriori-like algorithms are always time and space consuming, and this is especially true when ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying Multi-Word Terms by Text-Segments

    Publication Year: 2006 , Page(s): 19
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (263 KB) |  | HTML iconHTML  

    Traditional statistical approaches for identifying multi-word terms have to handle a large amount of noisy data and are extremely time consuming. This paper presents a new statistical approach for identifying multiword terms based on the co-related text-segments existing in a group of documents. The approach involves three stages: (a) using a short predefined stoplist as an initial input to segmen... View full abstract»

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