By Topic

2009 International Conference on Web Information Systems and Mining

7-8 Nov. 2009

Filter Results

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

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

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

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

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

    Publication Year: 2009, Page(s):v - xv
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2009, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (72 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009, Page(s):xviii - xix
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009, Page(s):xx - xxi
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • A Mail Community Partition Algorithm with Correction

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

    This paper discussed the mail community partition and the property of the mail community, and proposed an algorithm, called ACCD/C, to partition mail communities based on adjusting community center dynamically with correction. The algorithm adopted a method of cosine measure to evaluate the similarity between two mailboxes based on the characteristics of mailboxes' communication behavior, partitio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Quantized Analyzing Method for Finding a User's Interested Web Pages Based on the User's Browsing Actions and Query Words

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

    How to capture a user's interested Web pages (IWPs) is very important in a Web personalized service. In this paper, a method to capture a user's IWPs by combining a quantized analysis of the user's browsing actions and query words has been presented. To distinguish the differences among users and at different time of a user, a set of parameters have been introduced when calculating the contributio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Bayesian Rules Based on Improved K-Means Cassification on Credit Card

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

    K-means clustering algorithm is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. It is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. It is similar to the expectation-maximization algorithm for mixtures of Gaussians in that they both attempt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach of Finding Localized Preferences Based-On Clustering for Collaborative Filtering

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

    Collaborative filtering has been very successful in both research and applications. Current collaborative filtering based on clustering compute the whole set of items during the process of clustering or selecting nearest-neighbors, because the researchers believed if users have similar preferences on some of items, they will have the similar preferences on other items. But we think that users have... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to the Collaborative Workflow Control Algorithm for Web-Based Composite Model Solving

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

    Firstly, it discusses the main characteristic of workflow management system (WfMS) which is used to solve Web-based domain problem, then it put forward a collaborative control system structure including three key modules under cooperative network environment, named as domain process rule base (RB), workflow template base (WfTB) and workflow collaborative solving cooperator(WfCC) separately. Furthe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collective Intelligence Based Computational Approach to Web Intelligence

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

    The World Wide Web has undergone major transformation during last few years, primarily due to its newly discovered ability to harness collective intelligence of the millions of users across the world. Users are no longer only passive consumers; they are actively participating to create new and useful content and more rich & personalized Web applications. Techniques to leverage user contributio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digging Digg: Comment Mining, Popularity Prediction, and Social Network Analysis

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

    Using comment information available from Digg we define a co-participation network between users. We focus on the analysis of this implicit network, and study the behavioral characteristics of users. Using an entropy measure, we infer that users at Digg are not highly focused and participate across a wide range of topics. We also use the comment data and social network derived features to predict ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge Learning in Interactive Evolutionary Computation Based on Information Flow

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

    Reducing users' fatigue and improving the performance are two focuses of the research of interactive evolutionary computation (IEC). Aiming at the focuses, knowledge learning in IEC is put forward. Before the discussion of knowledge learning, the issue of information sampled from history evolution is discussed, from which the knowledge is extracted. The knowledge learning based on gene-sense-unit ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping Mechanism Based on Ontology Extended Semantic Related Groups

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

    Query interfaces provided by the Deep Web are clues to disclose the hidden schemas. But the complicated semantic relationships in the query interfaces lead to the lower generality and ability of local-as-view (LAV) method in the traditional information fusion system. To address the problem, an Ontology extended semantic related group algorithm is presented. The algorithm is to extract attributes u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notice of Violation of IEEE Publication Principles
    Architecture of an Object-Level Vertical Search

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

    Notice of Violation of IEEE Publication Principles

    "Architecture of an Object-level Vertical Search"
    By Jianfeng Zheng and Zaiqing Nie
    in the Proceedings of the 2009 International Conference on Web Information Systems and Mining (WISM), November 2009, pp. 51-55

    After careful and considered review of the content and authorship of this paper by a duly constituted expert committee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chinese Word Segmentation and Out-of-Vocabulary Words Detection Using Suffix Array

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

    At present Chinese word segmentation roughly consists of two mature methods: dictionary-based method and statistical method. Both methods have their own relative merits. To achieve a better performance, this paper proposes an algorithm using amended dictionary integrating with suffix array to detect OOV words. The essential idea is to accurately and efficiently extract medium and high frequency le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Content-Based Image Retrieval with HSV Color Space and Texture Features

    Publication Year: 2009, Page(s):61 - 63
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1354 KB) | HTML iconHTML

    An image retrieval system is presented, which used HSV color space and wavelet transform approach for feature extraction. Firstly, we quantified the color space in non-equal intervals, then constructed one dimension feature vector and represented the color feature. Similarly, the work of texture feature extraction is obtained by using wavelet. Finally, we combine color feature and texture feature ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypergraph Partitioning for Community Discovery in Complex Network

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

    Hypergraph partitioning has been considered as a promising method to address the challenges of high dimensionality in clustering. Many complex networks possess the scale-free property, which makes the task of community discobery from these networks difficult. In this paper we present a method of detecting community structure based on hypergraph model to address this problem. The hypergraph model m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Web Crawler Wrappers to Collect User Reviews on Shopping Mall with Various Hierarchical Tree Structure

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

    Along with the increased number of Internet shopping mall users, high quantities of reviews on products are often found in many shopping malls. In order to extract effective information from those reviews, many studies on opinion mining have been actively performed. Due to the various type of structure of shopping malls, it is difficult to apply a single Web crawler on all the shopping malls, so p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Automatic Summarization Based on Search Engine Result

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

    Applying automatic summarization to search engine can make it easier for users to find out the content of the Web page. In this paper, the results of search engine are analyzed. On the basis of query keywords expansion, we propose a new summary approach which calculates the sentence weight utilizing the information of the distance between words. The results of experiment show that this method can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Automatic Summarization System Based on Topic Partition

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

    Automatic summarization is an important issue in natural language processing and becomes more and more important in some domains such as web information retrieval. This paper describes an automatic summarization system based on topic partition: Firstly, it analyzes the text structure of the web pages, then proposes an algorithm for multi-topic text partitioning based on semantic distance between p... View full abstract»

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