Data Warehousing and Knowledge Discovery: 4th International Conference, DaWaK 2002, Aix-en-Provence, France, September 4-6, 2002. Proceedings

Overview

This book constitutes the refereed proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2002, held in Aix-en-Provence, France, in September 2002.
The 32 revised full papers presented were carefully reviewed and selected from more than 100 submissions. The papers are organized in topical sections on association rules, clustering, web mining and security, data mining techniques, data cleansing, ...

See more details below
Paperback (2002)
$71.56
BN.com price
(Save 27%)$99.00 List Price
Other sellers (Paperback)
  • All (4) from $25.00   
  • New (3) from $70.76   
  • Used (1) from $25.0   
Sending request ...

Overview

This book constitutes the refereed proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2002, held in Aix-en-Provence, France, in September 2002.
The 32 revised full papers presented were carefully reviewed and selected from more than 100 submissions. The papers are organized in topical sections on association rules, clustering, web mining and security, data mining techniques, data cleansing, applications, data warehouse design, OLAP, and data warehouse maintenance.

Read More Show Less

Product Details

  • ISBN-13: 9783540441236
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 10/3/2002
  • Series: Lecture Notes in Computer Science Series , #2454
  • Edition description: 2002
  • Edition number: 1
  • Pages: 339
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.75 (d)

Table of Contents

Association Rules.- A Comparison between Query Languages for the Extraction of Association Rules.- Learning from Dissociations*.- Mining Association Rules from XML Data.- Estimating Joint Probabilities from Marginal Ones*.- Clustering.- Self-Tuning Clustering: An Adaptive Clustering Method for Transaction Data.- CoFD: An Algorithm for Non-distance Based Clustering in High Dimensional Spaces*.- An Efficient K-Medoids-Based Algorithm Using Previous Medoid Index, Triangular Inequality Elimination Criteria, and Partial Distance Search.- Web Mining and Security.- A Hybrid Approach to Web Usage Mining.- Building and Exploiting Ad Hoc Concept Hierarchies for Web Log Analysis.- Authorization Based on Evidence and Trust*.- An Algorithm for Building User-Role Profiles in a Trust Environment1.- Data Mining Techniques.- Neural-Based Approaches for Improving the Accuracy of Decision Trees.- Approximate k-Closest-Pairs with Space Filling Curves.- Optimal Dimension Order: A Generic Technique for the Similarity Join.- Fast Discovery of Sequential Patterns by Memory Indexing.- Data Cleansing.- Dynamic Similarity for Fields with NULL Values.- Outlier Detection Using Replicator Neural Networks.- The Closed Keys Base of Frequent Itemsets.- Applications.- New Representation and Algorithm for Drawing RNA Structure with Pseudoknots*.- Boosting Naive Bayes for Claim Fraud Diagnosis.- Optimization of Association Word Knowledge Base through Genetic Algorithm.- Mining Temporal Patterns from Health Care Data*.- Data Warehouse Design.- Adding a Performance-Oriented Perspective to Data Warehouse Design.- Cost Modeling and Estimation for OLAP-XML Federations.- Constraint-Free Join Processing on Hyperlinked Web Data.- Focusing on Data Distribution in the WebD2W System.- OLAP.- A Decathlon in Multidimensional Modeling: Open Issues and Some Solutions.- Modeling and Imputation of Large Incomplete Multidimensional Datasets.- PartJoin:An Efficient Storage and Query Execution for Data Warehouses.- Data Warehouse Maintenance.- A Transactional Approach to Parallel Data Warehouse Maintenance.- Striving towards Near Real-Time Data Integration for Data Warehouses.- Time-Interval Sampling for Improved Estimations in Data Warehouses.

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)

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