Titlebook: Data Warehousing and Knowledge Discovery; 6th International Co Yahiko Kambayashi,Mukesh Mohania,Wolfram W?? Conference proceedings 2004 Spr

metropolitan

Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guaranteesnge aggregate queries on OLAP data cubes efficiently with theoretical error guarantees. Our basic idea is to build different data structures for outliers and the rest of the data. Experimental results verified the effectiveness of our proposed methods.

誘惑

BUST

Conceptual Design of XML Document Warehouses self-describing hierarchical structure and its associated XML Schema (XSD) provides the flexibility and the manipulative power needed to accommodate complex, disconnected, heterogeneous data. The issue of large volume of data appearing deserves investigating XML Document Warehouses. But due to XML’

fulcrum

Ossification

GeoDWFrame: A Framework for Guiding the Design of Geographical Dimensional Schemasgy also used to provide decision support is Geographical Information System (.). Much research aims at integrating these technologies, but there are still some open questions, particularly regarding the design of a geographical dimensional data schema. This paper discusses some related work and prop

巧辦法

plasma

Novelty Framework for Knowledge Discovery in DatabasesUse of objective measures of interestingness in popular data mining algorithms often leads to another data mining problem, although of reduced complexity. The reduction in the volume of the discovered rules is desirable in order to improve the efficiency of the overall KDD process. Subjective measur

stratum-corneum

Revisiting Generic Bases of Association Rulese Iceberg. Data Mining in conjunction with the Formal Concept Analysis, is a clear promise to furnish adequate tools to do so and specially to be able to derive concise generic and easy understandable bases of “hidden” knowledge, that can be reliable in a decision making process. In this paper, we p

打算

Mining Maximal Frequently Changing Subtree Patterns from XML Documentsent may exhibit some particular patterns. In this paper, we focus on the sequence of changes to the structures of an XML document to find out which subtrees in the XML structure frequently change together, which we call Frequently Changing Subtree Patterns (.). In order to keep the discovered patter

Pastry