Bimonthly    Since 1986
ISSN 1004-9037
Indexed in:
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
  • Table of Content
      15 May 2004, Volume 19 Issue 3   
    For Selected: View Abstracts Toggle Thumbnails
    From Sequential Pattern Mining to Structured Pattern Mining: A Pattern-Growth Approach
    Jia-Wei Han, Jian Pei, and Xi-Feng Yan
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(1102KB) ( 2790 )  
    Sequential pattern mining is an important data mining problem with broad applications. However, it is also a challenging problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Recent studies have developed two major classes of sequential pattern mining methods: (1) a candidate generation-and-test approach, represented by (I) GSP, a horizontal format-based sequential pattern mining method, and (ii) SPADE, a vertical format-based method; and (2) a pattern-growth method, represented by PrefixSpan and its further extensions, such as gSpan for mining structured patterns.In this study, we perform a systematic introduction and presentation of the pattern-growth methodology and study its principles and extensions. We first introduce two interesting pattern-growth algorithms, FreeSpan and PrefixSpan, for efficient sequential pattern mining. Then we introduce gSpan for mining structured patterns using the same methodology. Their relative performance in large databases is presented and analyzed. Several extensions of these methods are also discussed in the paper, including mining multi-level, multi-dimensional patterns and mining constraint-based patterns.
    Process Algebra Approach to Reasoning About Concurrent Actions
    Yuan Feng and Ming-Sheng Ying
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(323KB) ( 1336 )  
    A reasonable transition rule is proposed for synchronized actions and some equational properties of bisimilarity and weak bisimilarity in the process algebra for reasoning about concurrent actions are presented.
    Single View Based Measurement on Space Planes
    Guang-Hui Wang, Zhan-Yi Hu, and Fu-Chao Wu
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(585KB) ( 1917 )  
    The plane metrology using a single uncalibrated image is studied in the paper, and three novel approaches are proposed. The first approach, namely key-line-based method, is an improvement over the widely used key-point-based method, which uses line correspondences directly to compute homography between the world plane and its image so as to increase the computational accuracy. The second and third approaches are both based on a pair of vanishing points from two orthogonal sets of parallel lines in the space plane together with two unparallel referential distances, but the two methods deal with the problem in different ways. One is from the algebraic viewpoint which first maps the image points to an affine space via a transformation constructed from the vanishing points, and then computes the metric distance according to the relationship between the affine space and the Euclidean space, while the other is from the geometrical viewpoint based on the invariance of cross ratios. The second and third methods avoid the selection of control points and are widely applicable. In addition, a brief description on how to retrieve other geometrical entities on the space plane, such as distance from a point to a line, angle formed by two lines, etc., is also presented in the paper. Extensive experiments on simulated data as well as on real images show that the first and the second approaches are of better precision and stronger robustness than the key-point-based one and the third one, since these two approaches are fundamentally based on line information.
    Unified Probabilistic Models for Face Recognition from a Single Example Image per Person
    Pin Liao and Li Shen
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(720KB) ( 1522 )  
    This paper presents a new technique of unified probabilistic models for face recognition from only one single example image per person. The unified models, trained on an obtained training set with multiple samples per person, are used to recognize facial images from another disjoint database with a single sample per person. Variations between facial images are modeled as two unified probabilistic models: within-class variations and between-class variations. Gaussian Mixture Models are used to approximate the distributions of the two variations and exploit a classifier combination method to improve the performance. Extensive experimental results on the ORL face database and the authors' database (the ICT-JDL database) including totally 1,750 facial images of 350 individuals demonstrate that the proposed technique, compared with traditional eigenface method and some well-known traditional algorithms, is a significantly more effective and robust approach for face recognition.
    Droplet: A Virtual Brush Model to Simulate Chinese Calligraphy and Painting
    Xiao-Feng Mi, Min Tang, and Jin-Xiang Dong
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(699KB) ( 1931 )  
    This paper proposes a virtual brush model based on droplet operation to simulate Chinese calligraphy and traditional Chinese painting in real time. Two ways of applying droplet model to virtual calligraphy and painting are discussed in detail. The second droplet model is more elaborated and can produce more vivid results while being slightly more time-consuming. The novel feature of the proposed droplet virtual brush model successfully enables the simulation painting system to overcome the poor expressional ability of virtual brush based on particle system and avoids the complex evaluation of physical brush with solid model. The model, derived from the actual calligraphy and painting experience, due to the simplicity of the droplet operation and its powerful expressive ability, considerably improves the performance of the simulation system and maintains painting effect comparable with real brush by supporting special Chinese brush effect such as dry brush, feng and stroke diffusion.
    Super-Resolution Reconstruction of Image Sequence Using Multiple Motion Estimation Fusion
    Cheng Wang and Run-Sheng Wang
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(544KB) ( 1507 )  
    Super-resolution reconstruction algorithm produces a high-resolution image from a low-resolution image sequence. The accuracy and the stability of the motion estimation (ME) are essential for the whole restoration. In this paper, a new super-resolution reconstruction algorithm is developed using a robust ME method, which fuses multiple estimated motion vectors within the sequence. The new algorithm has two major improvements compared with the previous research. First, instead of only two frames, the whole sequence is used to obtain a more accurate and stable estimation of the motion vector of each frame; second, the reliability of the ME is quantitatively measured and introduced into the cost function of the reconstruction algorithm. The algorithm is applied to both synthetic and real sequences, and the results are presented in the paper.
    Improving Retrieval Performance by Region Constraints and Relevance Feedback
    Tao Wang, Yong Rui, and Jia-Guang Sun
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(709KB) ( 1176 )  
    In this paper, region features and relevance feedback are used to improve the performance of CBIR. Unlike existing region-based approaches where either individual regions are used or only simple spatial layout is modeled, the proposed approach simultaneously models both region properties and their spatial relationships in a probabilistic framework. Furthermore, the retrieval performance is improved by an adaptive filter based relevance feedback. To illustrate the performance of the proposed approach, extensive experiments have been carried out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries.
    Representing Topological Relationships Among Heterogeneous Geometry-Collection Features
    Zhi-Nong Zhong, Ning Jing, Luo Chen, and Qiu-Yun Wu
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(518KB) ( 1861 )  
    Topological relationships between two spatial features represent important knowledge in Geographical Information Systems (GIS). In the last few years, many models that represent topological relationships have been proposed. But these models cannot represent the topological relationships between heterogeneous geometrycollection features, which are composed of different dimensional geometries. In this paper, the formal definition of regular heterogeneous geometrycollection and regularization rules are given. Based on the spatial model, two methods for representing topological relationships between these complex features are proposed. The first method is Dimensionally Extended Nine-Intersection Model Based on Components (DE-9IMBC) that extends Dimensionally Extended Nine-Intersection Model (DE-9IM) and takes into account the topological relationships between components of these complex features. The advantage of DE-9IMBC is that a large number of different topological relationships can be checked. The second method extends the definitions of topological relationships in Open Geodata Interoperability Specification (OpenGIS), and redefines the seven named topological relationships: Disjoint, Touches, Within, Crosses, Overlaps, Contains and Equal, to represent the topological relationships between heterogeneous geometrycollection features. It is proven that the seven extended topological relationships are complete and mutually exclusive, and they are suitable for being embedded in spatial query languages.
    Domain-Specific Formal Ontology of Archaeology and Its Application in Knowledge Acquisition and Analysis
    Chun-Xia Zhang, Cun-Gen Cao, Fang Gu, and Jin-Xin
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(980KB) ( 1412 )  
    Inherent heterogeneity and distribution of knowledge strongly prevent knowledge from sharing and reusing among different agents and software entities, and a formal ontology has been viewed as a promising means to tackle this problem. In this paper, a domain-specific formal ontology of archaeology is presented. The ontology mainly consists of three parts: archaeological categories, their relationships and axioms. The ontology not only captures the semantics of archaeological knowledge, but also provides archaeology with an explicit and formal specification of a shared conceptualization, thus making archaeological knowledge shareable and reusable across humans and machines in a structured fashion. Further, we propose a method to verify ontology correctness based on the individuals of categories. As applications of the ontology, we have developed an ontology-driven approach to knowledge acquisition from archaeological text and a question answering system for archaeological knowledge.
    Incremental Maintenance of Quotient Cube Based on Galois Lattice
    Cui-Ping Li, Kum-Hoe Tung, and Shan Wang
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(507KB) ( 1496 )  
    Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.
    Chopper:Efficient Algorithm for Tree Mining
    Chen Wang, Qing-Qing Yuan, Hao-Feng Zhou, Ming-Sheng Hong, Wei Wang, and Bai-Le Shi
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(1006KB) ( 1612 )  
    With the development of Internet, frequent pattern mining has been extended to more complex patterns like tree mining and graph mining. Such applications arise in complex domains like bioinformatics, web mining, etc. In this paper, we present a novel algorithm, named Chopper, to discover frequent subtrees from ordered labeled trees. An extensive performance study shows that the newly developed algorithm outperforms TreeMinerV, one of the fastest methods proposed previously, in mining large databases. At the end of this paper, the potential improvement of Chopper is mentioned.
    Discovering User Profiles for Web Personalized Recommendation
    Ai-Bo Song, Mao-Xian Zhao, Zuo-Peng Liang, Yi-Sheng Dong, and Jun-Zhou Luo
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(575KB) ( 2087 )  
    With the growing popularity of the World Wide Web, large volume of user access data has been gathered automatically by Web servers and stored in Web logs. Discovering and understanding user behavior patterns from log files can provide Web personalized recommendation services. In this paper, a novel clustering method is presented for log files called Clustering large Weblog based on Key Path Model (CWKPM), which is based on user browsing key path model, to get user behavior profiles. Compared with the previous Boolean model, key path model considers the major features of users' accessing to the Web: ordinal, contiguous and duplicate. Moreover, for clustering, it has fewer dimensions. The analysis and experiments show that CWKPM is an efficient and effective approach for clustering large and high-dimension Web logs.
    Regular Disjunction-Free Default Theories
    Xi-Shun Zhao
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(381KB) ( 1259 )  
    In this paper, the class of regular disjunction-free default theories is introduced and investigated. A transformation from regular default theories to normal default theories is established. The initial theory and the transformed theory have the same extensions when restricted to old variables. Hence, regular default theories enjoy some similar properties (e.g., existence of extensions, semi-monotonicity) as normal default theories. Then, a new algorithm for credulous reasoning of regular theories is developed. This algorithm runs in a time not more than O(1.45^n), where n is the number of defaults. In case of regular prerequisite-free or semi-2CNF default theories, the credulous reasoning can be solved in polynomial time. However, credulous reasoning for semi-Horn default theories is shown to be NP-complete although it is tractable for Horn default theories. Moreover, skeptical reasoning for regular unary default theories is co-NP-complete.
    A Framed Temporal Logic Programming Language
    Zhen-Hua Duan and Maciej Koutny
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(512KB) ( 1795 )  
    We discuss the projection temporal logic (PTL), based on a primitive projection operator, prj. A framing technique is also presented, using which a synchronization operator, await, is defined within the underlying logic. A framed temporal logic programming language (FTLL) is presented. To illustrate how to use both the language and framing technique, some examples are given.
    Towards a Theory of Bisimulation for the Higher-Order Process Calculi
    Yong-Jian Li and Xin-Xin Liu
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(403KB) ( 1455 )  
    In this paper, a labelled transition semantics for higher-order process calculi is studied. The labelled transition semantics is relatively clean and simple, and corresponding bisimulation equivalence can be easily formulated based on it. And the congruence properties of the bisimulation equivalence can be proved easily. To show the correspondence between the proposed semantics and the well-established ones, the bisimulation is characterized as a version of barbed equivalence and a version of context bisimulation.
    An Orientation Update Message Filtering Algorithm in Collaborative Virtual Environment
    Mao-Jun Zhang and Nicolas D. Georganas
    Journal of Data Acquisition and Processing, 2004, 19 (3): 0-0. 
    Abstract   PDF(527KB) ( 1491 )  
    Orientation update message filtering is an important issue in collaborative virtual environments (CVEs). Dead-reckoning (DR) is a known effective mechanism for update message filtering. Yet, previous dead-reckoning techniques mainly focus on the update message filtering for positions. The existing orientation dead-reckoning algorithms are based on fixed threshold values. The drawbacks of fixed thresholding for orientations (FTO) are discussed in this paper. We propose a variable thresholding for orientations (VTO) based on average recent angular velocity. The main advantage of the proposed VTO is the ability of balancing the number of state update messages and shift frequency of direction and speed of rotation.
SCImago Journal & Country Rank

ISSN 1004-9037


Editorial Board
Author Guidelines
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China

E-mail: info@sjcjycl.cn
  Copyright ©2015 JCST, All Rights Reserved