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

judiciousness

Wafa Skalli,Sébastien Laporte,Aurélie Benoitns more concise, we further define the problem of mining .. An algorithm derived from the FP-growth is developed to mine the set of .s. Experiment results show that our algorithm is substantially faster than the naive algorithm and it scales well with respect to the size of the XML structure.

軟弱

Simulation of Urban Drainage Systemsions. The algorithm provides two types of transparency: a) aggregate unawareness, and b) MFTS join complexity unawareness. The algorithm requires simple metadata, and it is non-intrusive. The paper presents the retargeting algorithm, required metadata and performance experiments.

非秘密

Secondary Medical Research Databases,till some open questions, particularly regarding the design of a geographical dimensional data schema. This paper discusses some related work and proposes . that is a framework based on the star schema and has been specified as guidance for designing geographical dimensional schemas. Some experimental results are also given.

職業(yè)

CHIDE

deforestation

https://doi.org/10.1007/978-94-011-2878-0use subsumption and evaluation constraints on polynomial equations. We evaluate this approach on standard regression problems. We finally consider IDBs containing patterns in the form of polynomial equations as well as molecular fragments, where the two are combined in order to derive QSAR (Quantitative Structure-Activity Relationships) models.

手銬

屈尊

Quadrature for Meshless Methodsnge 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.

confide

煞費(fèi)苦心

Discovering Pattern-Based Dynamic Structures from Versions of Unordered XML Documentsern-based dynamic structures with only two scans of the XML sequence is presented. Experimental results show that the proposed algorithm can extract the pattern-based dynamic structures efficiently with good scalability.