4. DaWaK 2002: Aix-en-Provence, France

Yahiko Kambayashi, Werner Winiwarter, Masatoshi Arikawa (Eds.): Data Warehousing and Knowledge Discovery, 4th International Conference, DaWaK 2002, Aix-en-Provence, France, September 4-6, 2002, Proceedings. Lecture Notes in Computer Science 2454 Springer 2002, ISBN 3-540-44123-9

Association Rules

Marco Botta, Jean-François Boulicaut, Cyrille Masson, Rosa Meo:
A Comparison between Query Languages for the Extraction of Association Rules. 1-10
Choh-Man Teng:
Learning from Dissociations. 11-20
Daniele Braga, Alessandro Campi, Mika Klemettinen, Pier Luca Lanzi:
Mining Association Rules from XML Data. 21-30
Tao Li, Shenghuo Zhu, Mitsunori Ogihara, Yinhe Cheng:
Estimating Joint Probabilities from Marginal Ones. 31-41

Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen:
Self-Tuning Clustering: An Adaptive Clustering Method for Transaction Data. 42-51
Shenghuo Zhu, Tao Li, Mitsunori Ogihara:
CoFD : An Algorithm for Non-distance Based Clustering in High Dimensional Spaces. 52-62
Shu-Chuan Chu, John F. Roddick, Jeng-Shyang Pan:
An Efficient K -Medoids-Based Algorithm Using Previous Medoid Index, Triangular Inequality Elimination Criteria, and Partial Distance Search. 63-72

Søren E. Jespersen, Jesper Thorhauge, Torben Bach Pedersen:
A Hybrid Approach to Web Usage Mining. 73-82
Carsten Pohle, Myra Spiliopoulou:
Building and Exploiting Ad Hoc Concept Hierarchies for Web Log Analysis. 83-93
Bharat K. Bhargava, Yuhui Zhong:
Authorization Based on Evidence and Trust. 94-103
Evimaria Terzi, Yuhui Zhong, Bharat K. Bhargava, Pankaj, Sanjay Kumar Madria:
An Algorithm for Building User-Role Profiles in a Trust Environment. 104-113

Yue-Shi Lee, Show-Jane Yen:
Neural-Based Approaches for Improving the Accuracy of Decision Trees. 114-123
Fabrizio Angiulli, Clara Pizzuti:
Approximate k -Closest-Pairs with Space Filling Curves. 124-134
Christian Böhm, Florian Krebs, Hans-Peter Kriegel:
Optimal Dimension Order: A Generic Technique for the Similarity Join. 135-149
Ming-Yen Lin, Suh-Yin Lee:
Fast Discovery of Sequential Patterns by Memory Indexing. 150-160

Zhao Li, Sam Yuan Sung, Qi Xiao Yang, Sun Peng:
Dynamic Similarity for Fields with NULL Values. 161-169
Simon Hawkins, Hongxing He, Graham J. Williams, Rohan A. Baxter:
Outlier Detection Using Replicator Neural Networks. 170-180
Viet Phan Luong:
The Closed Keys Base of Frequent Itemsets. 181-190

Yujin Lee, Wootaek Kim, Kyungsook Han:
New Representation and Algorithm for Drawing RNA Structure with Pseudoknots. 191-201
Stijn Viaene, Richard A. Derrig, Guido Dedene:
Boosting Naive Bayes for Claim Fraud Diagnosis. 202-211
Su-Jeong Ko, Jung-Hyun Lee:
Optimization of Association Word Knowledge Base through Genetic Algorithm. 212-221
Weiqiang Lin, Mehmet A. Orgun, Graham J. Williams:
Mining Temporal Patterns from Health Care Data. 222-231

Pedro Bizarro, Henrique Madeira:
Adding a Performance-Oriented Perspective to Data Warehouse Design. 232-244
Dennis Pedersen, Karsten Riis, Torben Bach Pedersen:
Cost Modeling and Estimation for OLAP-XML Federations. 245-254
Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria, Mukesh K. Mohania:
Constraint-Free Join Processing on Hyperlinked Web Data. 255-264
Cristina Dutra de Aguiar Ciferri, Fernando da Fonseca de Souza:
Focusing on Data Distribution in the WebD²W System. 265-274

Wolfgang Hümmer, Wolfgang Lehner, Andreas Bauer, Lutz Schlesinger:
A Decathlon in Multidimensional Modeling: Open Issues and Some Solutions. 275-285
Xintao Wu, Daniel Barbará:
Modeling and Imputation of Large Incomplete Multidimensional Datasets. 286-295
Ladjel Bellatreche, Michel Schneider, Mukesh K. Mohania, Bharat K. Bhargava:
PartJoin: An Efficient Storage and Query Execution for Data Warehouses. 296-306

Bin Liu, Songting Chen, Elke A. Rundensteiner:
A Transactional Approach to Parallel Data Warehouse Maintenance. 307-316
Robert M. Bruckner, Beate List, Josef Schiefer:
Striving towards Near Real-Time Data Integration for Data Warehouses. 317-326
Pedro Furtado, João Pedro Costa:
Time-Interval Sampling for Improved Estimations in Data Warehouses. 327-338