## Proceedings of the Third SIAM International Conference on Data MiningThe third SIAM International Conference on Data Mining provided an open forum for the presentation, discussion and development of innovative algorithms, software and theories for data mining applications and data intensive computation. This volume includes 21 research papers. |

### From inside the book

Page xi

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 47

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 102

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 217

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 225

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

### What people are saying - Write a review

User Review - Flag as inappropriate

aas

### Contents

Decision Tree Classiﬁcation of Spatial Data Patterns from Videokeratography Using | 3 |

Feature Mining Paradigms for Scientiﬁc Data | 13 |

A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection | 25 |

Fast Online SVD Revisions for Lightweight Recommender Systems | 37 |

Finding Clusters of Different Sizes Shapes and Densities in Noisy High Dimensional Data | 47 |

Hierarchical Document Clustering Using Frequent lternsets | 59 |

Scalable Balanced ModelBased Clustering | 71 |

A New Gravitational Clustering Algorithm | 83 |

interactive Visual Classiﬁcation Using Star Coordinates | 178 |

Anytime QueryTuned Kernel Machines via Cholesky Factorization | 186 |

Estimation of Topological Dimension | 194 |

Toward Computational Tractabiilty | 203 |

On Discovery of Statistically important Pattern Repeats in Long Sequential Data | 224 |

Application to Clustering | 239 |

The Application of Text Mining Software to Examine Coded Information | 254 |

The Analysis of Asthma and Exposure Data Using Geographic information Systems | 269 |

Mining Changes of Classiﬁcation by Correspondence Tracing | 95 |

Dynamic Classiﬁcation of Online Customers | 107 |

Communication and Memory Efficient Parallel Decision Tree Construction | 119 |

A Native Extension of SQL for Data Mining | 130 |

Contents | 137 |

Approximate Query Answering by Model Averaging | 142 |

On Using Page Cooccurrences for Computing Clickstream Similarity | 154 |

Mining Closed Sequential Patterns in Large Datasets | 166 |

Learning Bayesian Network Structure from Distributed Data | 284 |

Relationship between Users DB and the Web | 299 |

A Highly Adaptive | 316 |

An OutlierBased Data Association Method for Linking Criminal Incidents | 326 |

Mining Temporal Databases for Subsequence Patterns | 336 |

347 | |

### Common terms and phrases

accuracy analysis applied approach approximation association rules ATLaS attributes AVC groups average Bayesian networks candidate changes classiﬁ cation classiﬁer clickstream CloSpan clustering algorithm computation constraint data mining data set database decision tree deﬁned deﬁnition density detection dimensionality distance distribution document edit distance efﬁcient estimation evaluation example feature selection ﬁeld Figure ﬁnd ﬁrst ﬁxed frequent itemsets function identiﬁed information gain input itemsets iteration K-means keratoconus kernel Knowledge Discovery Machine Learning matrix memory method mixture model nearest neighbor node normal number of clusters obtained optimization outliers PageRank paper parameters partition pattern mining performance prediction preﬁx problem Proc proﬁles proposed pruning query random replacement cost sample Satimage Section sequence sequential pattern SIGKDD signiﬁcant similar speciﬁc speedups StarClass statistical step structure subset Table techniques threshold tion training data tuples update variables vector Zernike polynomial