Data Warehousing and Knowledge Discovery: 5th International Conference, DaWaK 2003, Prague, Czech Republic, September 3-5,2003, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$79.14
(Save 12%)
Used and New from Other Sellers
Used and New from Other Sellers
from $25.00
Usually ships in 1-2 business days
(Save 72%)
Other sellers (Paperback)
  • All (9) from $25.00   
  • New (5) from $59.50   
  • Used (4) from $25.00   

More About This Textbook

Overview

This book constitutes the refereed proceedings of the 5th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2003, held in Prague, Czech Republic in September 2003.

The 41 revised full papers presented were carefully reviewed and selected from more than 130 submissions. The papers are organized in topical sections on data cubes and queries, multidimensional data models, Web warehousing, change detection, Web mining and association rules, association rules and decision trees, clustering, association rule mining, data analysis and discovery, ontologies and improving data quality, queries and data patterns, improving database query engines, and sampling and vector classification.

Read More Show Less

Product Details

  • ISBN-13: 9783540408079
  • Publisher: Springer-Verlag New York, LLC
  • Publication date: 9/29/2003
  • Series: Lecture Notes in Computer Science Series , #2737
  • Edition description: 2003
  • Edition number: 1
  • Pages: 448
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.92 (d)

Table of Contents

XML for Data Warehousing Chances and Challenges 1
CPM: A Cube Presentation Model for OLAP 4
Computation of Sparse Data Cubes with Constraints 14
Answering Joint Queries from Multiple Aggregate OLAP Databases 24
An Approach to Enabling Spatial OLAP by Aggregating on Spatial Hierarchy 35
A Multidimensional Aggregation Object (MAO) Famework for Computing Distributive Aggregations 45
The GMD Data Model for Multidimensional Information: A Brief Introduction 55
An Application of Case-Based Reasoning in Multidimensional Database Architecture 66
MetaCube XTM: A Multidimensional Metadata Approach for Semantic Web Warehousing Systems 76
Designing Web Warehouses for XML Schemas 89
Building XML Data Warehouse Based on Frequent Patterns in User Queries 99
A Temporal Study of Data Sources to Load a Corporate Data Warehouse 109
Automatic Detection of Structural Changes in Data Warehouses 119
Performance Tests in Data Warehousing ETLM Process for Detection of Changes in Data Origin 129
Recent Developments in Web Usage Mining Research 140
Parallel Vector Computing Technique for Discovering Communities on the Very Large Scale Web Graph 151
Ordinal Association Rules towards Association Rules 161
Rough Set Based Decision Tree Model for Classification 172
Inference Based Classifier: Efficient Construction of Decision Trees for Sparse Categorical Attributes 182
Generating Effective Classifiers with Supervised Learning of Genetic Programming 192
Clustering by Regression Analysis 202
Handling Large Workloads by Profiling and Clustering 212
Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering 224
On Complementarity of Cluster and Outlier Detection Schemes 234
Cluster Validity Using Support Vector Machines 244
FSSM: Fast Construction of the Optimized Segment Support Map 257
Using a Connectionist Approach for Enhancing Domain Ontologies: Self-Organizing Word Category Maps Revisited 267
Parameterless Data Compression and Noise Filtering Using Association Rule Mining 278
Performance Evaluation of SQL-OR Variants for Association Rule Mining 288
A Distance-Based Approach to Find Interesting Patterns 299
Similarity Search in Structured Data 309
Using an Interest Ontology for Improved Support in Rule Mining 320
Fraud Formalization and Detection 330
Combining Noise Correction with Feature Selection 340
Pre-computing Approximate Hierarchical Range Queries in a Tree-Like Histogram 350
Comprehensive Log Compression with Frequent Patterns 360
Non Recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations 371
A New Computation Model for Rough Set Theory Based on Database Systems 381
Computing SQL Queries with Boolean Aggregates 391
Fighting Redundancy in SQL 401
"On-the-fly" VS Materialized Sampling and Heuristics 412
Incremental and Decremental Proximal Support Vector Classification Using Decay Coefficients 422
Author Index 431
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)