Skip to main content

previous disabled Page of 13
and
  1. No Access

    Chapter and Conference Paper

    Mining Functional Dependency Rule of Relational Database

    This paper defines a kind of rule, functional dependency rule. The functional dependency degree of relational database can be depicted by this kind of rule. We give a algorithm to mine this kind of rule and pr...

    **aopeng Tao, Ning Wang, Shuigeng Zhou in Methodologies for Knowledge Discovery and … (1999)

  2. No Access

    Chapter and Conference Paper

    A Visual Method of Cluster Validation with Fastmap

    This paper presents a visual method of cluster validation using the Fastmap algorithm. Two problems are tackled with Fastmap in the interactive process of discovering interesting clusters from real world datab...

    Zhexue Huang, Tao Lin in Knowledge Discovery and Data Mining. Curre… (2000)

  3. No Access

    Chapter and Conference Paper

    Association Rules

    New association rules are presented for measure of association relationships between patterns. The new association rules are shown to not only measure three well-known association relationships correctly, but ...

    Tao Zhang in Knowledge Discovery and Data Mining. Current Issues and New Applications (2000)

  4. No Access

    Chapter and Conference Paper

    Validating an Access Cost Model for Wide Area Applications

    In this paper, we describe a case study in develo** an access cost model for WebSources in the context of a wrapper mediator architecture. We document our experiences in validating this model, and note succe...

    Vladimir Zadorozhny, Louiqa Raschid, Tao Zhan in Cooperative Information Systems (2001)

  5. No Access

    Chapter and Conference Paper

    Efficient OLAP Operations in Spatial Data Warehouses

    Spatial databases store information about the position of individual objects in space. In many applications however, such as traffic supervision or mobile communications, only summarized data, like the number ...

    Dimitris Papadias, Panos Kalnis, Jun Zhang in Advances in Spatial and Temporal Databases (2001)

  6. No Access

    Chapter and Conference Paper

    Estimating Joint Probabilities from Marginal Ones*

    Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are b...

    Tao Li, Shenghuo Zhu, Mitsunori Ogihara in Data Warehousing and Knowledge Discovery (2002)

  7. No Access

    Chapter and Conference Paper

    CoFD: An Algorithm for Non-distance Based Clustering in High Dimensional Spaces*

    The clustering problem, which aims at identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity clusters, has been widely studied. T...

    Shenghuo Zhu, Tao Li, Mitsuonri Ogihara in Data Warehousing and Knowledge Discovery (2002)

  8. No Access

    Chapter and Conference Paper

    A Bayesian Method for Content-Based Image Retrieval by Use of Relevance Feedback

    This paper proposes a new Bayesian method for content-based image retrieval using relevance feedback. In this method, the problem of contentbased image retrieval is first formulated as a two-class classificati...

    Tao Ju-Lan, Hung Yi-** in Recent Advances in Visual Information Systems (2002)

  9. No Access

    Chapter and Conference Paper

    Aggregate Processing of Planar Points

    Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such q...

    Yufei Tao, Dimitris Papadias, Jun Zhang in Advances in Database Technology — EDBT 2002 (2002)

  10. No Access

    Chapter and Conference Paper

    Site-Role Based GreedyDual-Size Replacement Algorithm

    Web caching is an effective Web performance enhancement technique that has been used widely. Web caching aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popula...

    **ngjun Zhang, Depei Qian, Dajun Wu, Yi Liu in Advances in Web-Age Information Management (2003)

  11. No Access

    Chapter and Conference Paper

    Exploiting Similarity of Subqueries for Complex Query Optimization

    Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing complex queries. To tackle this ch...

    Yingying Tao, Qiang Zhu, Calisto Zuzarte in Database and Expert Systems Applications (2003)

  12. No Access

    Chapter and Conference Paper

    Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds

    The results of traditional spatial queries (i.e., range search, nearest neighbor, etc.) are usually meaningless in spatio-temporal applications, because they will be invalidated by the movements of query and/o...

    Yufei Tao, Nikos Mamoulis, Dimitris Papadias in Advances in Spatial and Temporal Databases (2003)

  13. No Access

    Chapter and Conference Paper

    Wrap** Web Pages into XML Documents

    XML is gaining popularity as an industrial standard for presenting and exchanging structured information on the web. Meanwhile, the majority of documents on-line are still marked up with HTML, which are design...

    Tao Fu in Advances in Web-Age Information Management (2004)

  14. No Access

    Chapter and Conference Paper

    Ontology Based Sports Video Annotation and Summary

    With digital sports video increasing everyday, effective analyzing sports video content becomes more and more important. Effective and efficient representation of video for searching, retrieval, inference and ...

    Jian-quan Ouyang, Li **-tao, Zhang Yong-dong in Content Computing (2004)

  15. No Access

    Chapter and Conference Paper

    Determining the Number of Probability-Based Clustering: A Hybrid Approach

    While analyzing the previous methods for determining the number of probability-based clustering, this paper introduces an improved Monte Carlo Cross-Validation algorithm (iMCCV) and attempts to solve the posterio...

    Tao Dai, Chun** Li, Jiaguang Sun in Content Computing (2004)

  16. No Access

    Chapter and Conference Paper

    A Self-adaptive Scope Allocation Scheme for Labeling Dynamic XML Documents

    This paper proposes a self-adaptive scope allocation scheme for labeling dynamic XML documents. It is general, light-weight and can be built upon existing data retrieval mechanisms. Bayesian inference is used ...

    Yun Shen, Ling Feng, Tao Shen, Bing Wang in Database and Expert Systems Applications (2004)

  17. No Access

    Chapter and Conference Paper

    Clustering XML Documents by Structure

    This work explores the application of clustering methods for grou** structurally similar XML documents. Modeling the XML documents as rooted ordered labeled trees, we apply clustering algorithms using distan...

    Theodore Dalamagas, Tao Cheng in Methods and Applications of Artificial Int… (2004)

  18. No Access

    Chapter and Conference Paper

    Clustering Structured Web Sources: A Schema-Based, Model-Differentiation Approach

    The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data. Their schemas define the object domain and its query c...

    Bin He, Tao Tao, Kevin Chen-Chuan Chang in Current Trends in Database Technology - ED… (2005)

  19. No Access

    Chapter and Conference Paper

    Mining Maximal Frequent ItemSets Using Combined FP-Tree

    Maximal frequent itemsets mining is one of the most fundamental problems in data mining. In this paper, we present CfpMfi, a new depth-first search algorithm based on CFP-tree for mining MFI. Based on the new ...

    Yue** Yan, Zhoujun Li, Tao Wang in AI 2004: Advances in Artificial Intelligen… (2005)

  20. No Access

    Chapter and Conference Paper

    Clustering XML Documents Using Structural Summaries

    This work presents a methodology for grou** structurally similar XML documents using clustering algorithms. Modeling XML documents with tree-like structures, we face the ‘clustering XML documents by structur...

    Theodore Dalamagas, Tao Cheng in Current Trends in Database Technology - ED… (2005)

previous disabled Page of 13