Skip to main content

18 Result(s)

within English Remove this filter Popular Science Remove this filter Data Mining and Knowledge Discovery Remove this filter Information Systems Applications (incl. Internet) Remove this filter Jian** ** Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Recognition of JPEG Compressed Face Images Based on AdaBoost

    This paper presents an advanced face recognition system based on AdaBoost algorithm in the JPEG compressed domain. First, the dimensionality is reduced by truncating some of the block-based DCT coefficients an...

    Chunmei Qing, Jianming Jiang in Semantic Multimedia (2007)

  2. No Access

    Chapter and Conference Paper

    PPN 2007 PC Co-chairs’ Message

    Welcome to the proceedings of the 1st International Workshop on Peer-to-Peer Networks (PPN 2007). The workshop was held in conjunction with the On The Move Federated Conference and Workshops (OTM2007), Novembe...

    Farid Naüt-Abdesselam, Jiankun Hu… in On the Move to Meaningful Internet Systems… (2007)

  3. No Access

    Chapter and Conference Paper

    Spectral Edit Distance Method for Image Clustering

    The spectral graph theories have been widely used in the domain of image clustering where editing distances between graphs are critical. This paper presents a method for spectral edit distance between the grap...

    Nian Wang, Jun Tang, Jiang Zhang, Yi-Zheng Fan… in Advances in Data and Web Management (2007)

  4. No Access

    Chapter and Conference Paper

    Camera Motion Analysis Towards Semantic-Based Video Retrieval in Compressed Domain

    To reduce the semantic gap between low-level visual features and the richness of human semantics, this paper proposes new algorithms, by virtue of the combined camera motion descriptors with multi-threshold, t...

    Ying Weng, Jianmin Jiang in Semantic Multimedia (2007)

  5. No Access

    Chapter and Conference Paper

    (α, k)-anonymity Based Privacy Preservation by Lossy Join

    Privacy-preserving data publication for data mining is to protect sensitive information of individuals in published data while the distortion to the data is minimized. Recently, it is shown that (α,k)-anonymity i...

    Raymond Chi-Wing Wong, Yubao Liu, Jian Yin… in Advances in Data and Web Management (2007)

  6. No Access

    Chapter and Conference Paper

    Mining Invisible Tasks from Event Logs

    Most existing process mining algorithms have problems in dealing with invisible tasks. In this paper, a new process mining algorithm named α # is proposed, which extends the mining capacity of the...

    Lijie Wen, Jianmin Wang, Jiaguang Sun in Advances in Data and Web Management (2007)

  7. No Access

    Chapter and Conference Paper

    Study on Efficiency and Effectiveness of KSORD

    KSORD(Keyword Search Over Relational Databases) is an easy and effective way for casual users or Web users to access relational databases. In recent years, much research on KSORD has been done, and many protot...

    Shan Wang, Jun Zhang, Zhaohui Peng, Jiang Zhan… in Advances in Data and Web Management (2007)

  8. No Access

    Chapter and Conference Paper

    Active Rules Termination Analysis Through Conditional Formula Containing Updatable Variable

    While active rules have been applied in many areas including active databases, XML documentation and Semantic Web, current methods remain largely uncertain of how to terminate active behaviors. Some existing m...

    Zhongmin **ong, Wei Wang, Jian Pei in Advances in Data and Web Management (2007)

  9. No Access

    Chapter and Conference Paper

    SAM: An Efficient Algorithm for F&B-Index Construction

    Using index to process structural queries on XML data is a natural way. F&B-Index has been proven to be the smallest index which covers all branching path queries. One disadvantage which prevents the wide usag...

    **anmin Liu, Jianzhong Li, Hongzhi Wang in Advances in Data and Web Management (2007)

  10. No Access

    Chapter and Conference Paper

    Combining Smooth Graphs with Semi-supervised Learning

    The key points of the semi-supervised learning problem are the label smoothness and cluster assumptions. In graph-based semi-supervised learning, graph representations of the data are so important that differe...

    Liang Liu, Weijun Chen, Jianmin Wang in Advances in Data and Web Management (2007)

  11. No Access

    Chapter and Conference Paper

    Efficient Keyword Search over Data-Centric XML Documents

    We in this paper investigate keyword search over data-centric XML documents. We first present a novel method to divide an XML document into self-integrated subtrees, which are connected subtrees and can captur...

    Guoliang Li, Jianhua Feng, Na Ta, Lizhu Zhou in Advances in Data and Web Management (2007)

  12. No Access

    Chapter and Conference Paper

    Record Extraction Based on User Feedback and Document Selection

    In recent years, the research of record extraction from large document data is becoming popular. However there still exist some problems in record extraction. 1) when large document data is used for the target...

    Jianwei Zhang, Yoshiharu Ishikawa, Hiroyuki Kitagawa in Advances in Data and Web Management (2007)

  13. No Access

    Chapter and Conference Paper

    Discovering Web Services Based on Probabilistic Latent Factor Model

    Recently, web services have been increasingly used to integrate and build business applications on the Internet. Once a web service is published and deployed, clients and other applications can discover and in...

    Yanchun Zhang, Jiangang Ma in Advances in Data and Web Management (2007)

  14. No Access

    Chapter and Conference Paper

    Web Service Search: Who, When, What, and How

    Web service search is an important problem in service oriented architecture that has attracted widespread attention from academia as well as industry. Web service searching can be performed by various stakehol...

    Jianguo Lu, Yijun Yu in Web Information Systems Engineering – WISE 2007 Workshops (2007)

  15. No Access

    Chapter and Conference Paper

    Extracting Trend of Time Series Based on Improved Empirical Mode Decomposition Method

    Solving overshoot and undershoot problems existed in the spline interpolation of empirical mode decomposition (EMD), improving this method and extracting trend of time series with it are the main tasks of this...

    Hui-ting Liu, Zhi-wei Ni, Jian-yang Li in Advances in Data and Web Management (2007)

  16. No Access

    Chapter and Conference Paper

    Tight Correlated Item Sets and Their Efficient Discovery

    We study the problem of mining correlated patterns. Correlated patterns have advantages over associations that they cover not only frequent items, but also rare items.Tight correlated item sets is a concise re...

    Lizheng Jiang, Dongqing Yang, Shiwei Tang, **uli Ma… in Advances in Data and Web Management (2007)

  17. No Access

    Chapter and Conference Paper

    Web Service Composition: A Reality Check

    Automated web service composition is one of the major promises of service-oriented architecture, where services can be discovered and composed dynamically and automatically. To investigate the methods for comp...

    Jianguo Lu, Yijun Yu, Debashis Roy… in Web Information Systems Engineering – WISE… (2007)

  18. No Access

    Chapter and Conference Paper

    A Survey of Job Scheduling in Grids

    The problem of optimally scheduling tasks onto heterogeneous resources in grids, minimizing the makespan of these tasks, has proved to be NP-complete. There is no best scheduling algorithm for all grid computi...

    Congfeng Jiang, Cheng Wang, **aohu Liu, Yinghui Zhao in Advances in Data and Web Management (2007)