2011 Eighth Web Information Systems and Applications Conference

21-23 Oct. 2011

Filter Results

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

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

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

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

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

    Publication Year: 2011, Page(s):v - vii
    Request permission for reuse | PDF file iconPDF (145 KB)
    Freely Available from IEEE
  • Message from the Program Committee Chairs

    Publication Year: 2011, Page(s): viii
    Request permission for reuse | PDF file iconPDF (78 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference organization

    Publication Year: 2011, Page(s):ix - x
    Request permission for reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s):xi - xii
    Request permission for reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • Hybrid Fragmentation to Preserve Data Privacy for SaaS

    Publication Year: 2011, Page(s):3 - 6
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    SaaS is a novel software model that data and applications of service are outsourced to service provider. Although SaaS model offers many benefits for small and medium enterprises, data privacy issue is the most challenge for the development of SaaS. In this paper we propose a new hybrid fragmentation approach which is different from traditional data encryption to protect data. We define three kind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Entity Relation Extraction Model Based on Semantic Pattern Matching

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

    This paper proposes a relation extraction model based on semantic pattern matching in Web environment. It consists of frequent pattern extraction, pattern clustering based on density, and pattern matching based on semantic similarity. First, based on the entities with known relations in a limited training set, we extract relation patterns containing these named entities from the web page. Then the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Star Join for Column-oriented Data Store in the MapReduce Environment

    Publication Year: 2011, Page(s):13 - 18
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    Map Reduce is a parallel computing paradigm that has gained a lot of attention from both industry and academia recent years. Unlike parallel DBMSs, with Map Reduce, it is easier for non-expert to develop scalable parallel programs for analytical applications over huge data sets across clusters of commodity machines. As the nature of scan-oriented processing, the performance of Map Reduce for relat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting Image Spam Based on Cross Entropy

    Publication Year: 2011, Page(s):19 - 22
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    To detect image spam effectively, it is necessary to analyze the image content. We do research on the local invariant features of images, and thus propose a novel method: near-duplicate image spam detecting based on CE (cross entropy), in which the SURF (Speeded up Robust Features) is used to extract the local invariant features of each image (spam and ham); then the GMM (Gaussian Mixture Models) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A User-centered Approach to Recommending Business Process Slices

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

    In this paper, a novel model of process slicing and user-centered recommendation is presented to make flexible reuses of business rules. Business processes are sliced in such angles as condition, action and resource. Suitable process slices are recommended to end-users with a proposed algorithm. The approach has been trial-used in emergency management, for supporting the modeling, execution and ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Keyword Search for SLCA in Parallel XML Databases

    Publication Year: 2011, Page(s):29 - 34
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (196 KB) | HTML iconHTML

    Keyword search is a wildly popular way for querying XML document. However, the increasing volume of XML data poses new challenges to keyword search processing. Parallel database is an efficient solution for this problem. In this paper, we study the problem of effective keyword search for SLCA (Smallest lower common ancestor) in parallel XML databases. We propose two efficient algorithm SONB (Scan ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rule Description Model Based on Massive Data Processing

    Publication Year: 2011, Page(s):35 - 40
    Cited by:  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    Massive rules processing has attracted more attention in recently years. Firstly, we propose a rule description language that can express all kind of rules by structured nature language. We design a set of graphical symbols for rule nodes. We also propose a rule traffic flow model and a rule cost model. Thought these models, it is easier to process massive numbers rules and optimize them. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concept Similarity Computation for Ontology in the Automatic Question-Answering System

    Publication Year: 2011, Page(s):41 - 46
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB) | HTML iconHTML

    As the key point of the ontology research field, concept similarity computation has been widely used in the automatic question-answering systems. This paper firstly analyzes the existing concept similarity computation algorithm which is based on the semantic distance, and then proposes a new computation algorithm formula by modifying and adding some factors which can affect the accuracy of concept... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Concept Hierarchy from Folksonomy

    Publication Year: 2011, Page(s):47 - 51
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    Users often use tags to annotate and categorize web content. A folksonomy is a system of classification derived from the practice and method of collaboratively creating and managing tags. The most significant feature of a folksonomy is that it directly reflects the vocabulary of users. This feature is very useful in tag-based content searching and user browsing. Based on mutual-overlapping measure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Approach to Resource Provisioning in PaaS

    Publication Year: 2011, Page(s):52 - 57
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (177 KB) | HTML iconHTML

    In PaaS, the issue of resource provisioning becomes more challenging because a great number of applications share and compete for resources simultaneously. PaaS platform should be able to maximize the resources utilization, while satisfying the performance requirements of all applications. However on-line request workload can be fluctuated during the run time of applications and static resource al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scalable Web Service Composition Based on a Strategy Reused Reinforcement Learning Approach

    Publication Year: 2011, Page(s):58 - 62
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (246 KB) | HTML iconHTML

    A central problem in Web services domain is how to get optimal composition of Web services in an uncertain environment. Thousands of Web services published in the internet every day, a large portion of these services may become invalid, deleted or modified. Presently, the environment of Web services changes frequently. In this uncertain service environment, our main object is to find a way to get ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate Dynamic Cycle Matching Strategy for Homogeneous Symmetric Pub/Sub System

    Publication Year: 2011, Page(s):63 - 68
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    In this paper we consider the problem of approximate dynamic matching for homogeneous symmetric publish/subscribe system. In this kind of applications, besides one-to-one swap, exchange can occur between more than two subscriptions, which is called cycle matching. There the number of possible cycle matching increases exponentially with the number of subscriptions and cycle length, one challenge is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation Method of Information Credibility Based on the Trust Features of Web Page

    Publication Year: 2011, Page(s):69 - 72
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (161 KB) | HTML iconHTML

    The uncertainty of the trustworthiness of the information has been a great obstacle for users to obtain and share true information on the Internet. Therefore, it is worth to further study the evaluation of the information credibility. This paper introduces a kind of evaluation method of information credibility based on the trust features of web page. After the trust features are defined according ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WNOntoSim: A Hybrid Approach for Measuring Semantic Similarity between Ontologies Based on WordNet

    Publication Year: 2011, Page(s):73 - 77
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    Ontology is a conceptual model, which is used on data exchange between heterogeneous data sources in semantic web, and liked by many people. Because of the shortage of the uniform standards for constructing ontology, it brings in lots of problems of ontology heterogeneity. Ontology mapping aims at these problems, and semantic similarity between ontologies is the key part of ontology mapping. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dual-strategy Analysis Model Based on Clustering and Inter-transaction

    Publication Year: 2011, Page(s):78 - 81
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1513 KB) | HTML iconHTML

    Inter-transactional association rules mining is mainly used in mining significant association between different transaction, but the existing algorithm only focus on the efficiency or accuracy. In this study, we propose the inter-transactional association rules algorithm based on cluster and dual-strategy analysis model. The algorithm adopts dual-strategy interest model to judge the integrity of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Splog Filtering algorithm Based on Combinational Features

    Publication Year: 2011, Page(s):82 - 85
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (3056 KB) | HTML iconHTML

    This paper focuses on spam blog (splog) detection. Blogs are highly popular, new media social communication mechanisms. The existing algorithms of identifying splogs based on lexical frequency features which are quite redundancy and lack correlation, degrades blog search results as well as wastes network resources. In our approach we exploit a dynamic filtering algorithm based on the combinational... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Realization of Friend Inquiry System Based on Dynamic Location of Google Maps

    Publication Year: 2011, Page(s):86 - 89
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    With the growing of opening map service function based on Google Maps, Maps has entered the Internet and personal computers even handheld devices from the paper. This subject is based on Google Maps, when people visit their friends, achieving a visiting roadmap of the shortest as people's position changes, and display navigation path in real-time, providing travel advice for people. View full abstract»

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