ACM SAC 2004: Data Mining Track

Accepted Papers

Paper Title Paper Id Authors
An new algorithm for gap constrained sequence mining p1330309 Claudio Silvestri, Salvatore Orlando, Raffaele Perego
GraphZip: A Fast and Automatic Compression Method for Spatial Data Clustering p1070109 Yu Qian, Kang Zhang
K-Nearest-Neighbor Consistency in Data Clustering: Incorporating local information into global optimization p1380409 Chris Ding
Statistical Properties of Transactional Databases p0870109 Paolo Palmerini, Salvatore Orlando, Raffaele Perego
Framework for Mining Web Content Outliers p0462508 Malik Agyemang, Ken Barker, Reda Alhajj
SDS-Rules and Association Rules p0552708 Tomas Karban, Jan Rauch, Milan Simunek
Spatial Neighborhood based outlier detection in multidimensional spatio-temporal datasets p0692908 Nabil Adam, Vandana Janeja, Vijay Atluri
On Support Thresholds in Associative Classification p0652908 Paolo Garza, Elena Baralis, Silvia Chiusano
An Optimized Approach for KNN Text Categorization using P-trees p1711809 Imad Rahal, William Perrizo
Reducing Borders of k-Disjunction Free Representations of Frequent Patterns p1752209 Marzena Kryszkiewicz
Memory issues in frequent itemset mining p1140109 Bart Goethals
Rule Discovery from Textual Data based on Key Phrase Patterns p0452508 Shigeaki Sakurai
Interval and Dynamic Time Warping-based Decision Trees p1500909 Rodriguez Juan J., Alonso Carlos J.
Optimizing subset queries: a step towards SQL-based Inductive Databases for Itemsets p1040109 Cyrille Masson, Celine Robardet, Jean-Francois Boulicaut
Mining Dependence Rules by Finding Largest Itemset Support Quota p0662908 Alexandr Savinov
Assigning Document Identifiers to Enhance Compressibility of Web Search p0800109 Fabrizio Silvestri, Raffaele Perego
A model for mining outliers from complex data sets p0582808 Hongwei Qi, Jue Wang
Frequent Free Tree Discovery p1360309 Stefan Kramer, Ulrich Rueckert