Kambayashi / Mohania / Wöß | Data Warehousing and Knowledge Discovery | E-Book | sack.de
E-Book

E-Book, Englisch, Band 3181, 412 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Kambayashi / Mohania / Wöß Data Warehousing and Knowledge Discovery

6th International Conference, DaWaK 2004, Zaragoza, Spain, September 1-3, 2004, Proceedings
Erscheinungsjahr 2004
ISBN: 978-3-540-30076-2
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

6th International Conference, DaWaK 2004, Zaragoza, Spain, September 1-3, 2004, Proceedings

E-Book, Englisch, Band 3181, 412 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-30076-2
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



Kambayashi / Mohania / Wöß Data Warehousing and Knowledge Discovery jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Data Warehousing Design.- Conceptual Design of XML Document Warehouses.- Bringing Together Partitioning, Materialized Views and Indexes to Optimize Performance of Relational Data Warehouses.- GeoDWFrame: A Framework for Guiding the Design of Geographical Dimensional Schemas.- Workload-Based Placement and Join Processing in Node-Partitioned Data Warehouses.- Knowledge Discovery Framework and XML Data Minig.- Novelty Framework for Knowledge Discovery in Databases.- Revisiting Generic Bases of Association Rules.- Mining Maximal Frequently Changing Subtree Patterns from XML Documents.- Discovering Pattern-Based Dynamic Structures from Versions of Unordered XML Documents.- Data Cubes and Queries.- Space-Efficient Range-Sum Queries in OLAP.- Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees.- Computing Complex Iceberg Cubes by Multiway Aggregation and Bounding.- Multidimensional Schema and Data Aggregation.- An Aggregate-Aware Retargeting Algorithm for Multiple Fact Data Warehouses.- A Partial Pre-aggregation Scheme for HOLAP Engines.- Discovering Multidimensional Structure in Relational Data.- Inductive Databases and Temporal Rules.- Inductive Databases as Ranking.- Inductive Databases of Polynomial Equations.- From Temporal Rules to Temporal Meta-rules.- Industrial Track.- How Is BI Used in Industry?: Report from a Knowledge Exchange Network.- Towards an Adaptive Approach for Mining Data Streams in Resource Constrained Environments.- Data Clustering.- Exploring Possible Adverse Drug Reactions by Clustering Event Sequences.- SCLOPE: An Algorithm for Clustering Data Streams of Categorical Attributes.- Novel Clustering Approach that Employs Genetic Algorithm with New Representation Scheme and Multiple Objectives.- Data Visualizationand Exploration.- Categorical Data Visualization and Clustering Using Subjective Factors.- Multidimensional Data Visual Exploration by Interactive Information Segments.- Metadata to Support Transformations and Data & Metadata Lineage in a Warehousing Environment.- Data Classification, Extraction and Interpretation.- Classification Based on Attribute Dependency.- OWDEAH: Online Web Data Extraction Based on Access History.- Data Mining Approaches to Diffuse Large B–Cell Lymphoma Gene Expression Data Interpretation.- Data Semantics.- Deriving Multiple Topics to Label Small Document Regions.- Deriving Efficient SQL Sequences via Read-Aheads.- Diversity in Random Subspacing Ensembles.- Association Rule Mining.- Partitioned Approach to Association Rule Mining over Multiple Databases.- A Tree Partitioning Method for Memory Management in Association Rule Mining.- Mining Interesting Association Rules for Prediction in the Software Project Management Area.- Mining Event Sequences.- PROWL: An Efficient Frequent Continuity Mining Algorithm on Event Sequences.- Algorithms for Discovery of Frequent Superset, Rather Than Frequent Subset.- Pattern Mining.- Improving Direct Counting for Frequent Itemset Mining.- Mining Sequential Patterns with Item Constraints.- Mining Borders of the Difference of Two Datacubes.- Mining Periodic Patterns in Sequence Data.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.