WhatToSee
Index of
KDD 2004
2PXMiner - An Efficient Two Pass Mining of Frequent XML Query Patterns
A Bayesian Network Framework for Reject Inference
A Cross-Collection Mixture Model for Comparative Text Mining
A DEA Approach for Model Combination
A Data Mining Approach to Modeling Relationships Among Categories in Image Collection
A Framework for Ontology-Driven Subspace Clustering
A General Approach to Incorporate Data Quality Matrices into Data Mining Algorithms
A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
A Generative Probabilistic Approach to Visualizing Sets of Symbolic Sequences
A Graph-Theoretic Approach to Extract Storylines from Search Results
A Microeconomic Data Mining Problem: Customer-Oriented Catalog Segmentation
A Probabilistic Framework for Semi-Supervised Clustering
A Quickstart in Frequent Structure Mining Can Make a Difference
A Rank Sum Test Method for Informative Gene Discovery ∗
A System for Automated Mapping of Bill-of-Materials Part Numbers
ANN Quality Diagnostic Models for Packaging Manufacturing: An Industrial Data Mining Case Study
Adversarial Classification
An Iterative Method for Multi-class Cost-sensitive Learning
An Objective Evaluation Criterion for Clustering
Analytical View of Business Data
Approximating a Collection of Frequent Sets
Automatic Multimedia Cross-modal Correlation Discovery∗
Belief State Approaches to Signaling Alarms in Surveillance Systems
Cluster-based Concept Invention for Statistical Relational Learning
Clustering Time Series from ARMA Models with Clipped Data
Column-Generation Boosting Methods for Mixture of Kernels
Cross Channel Optimized Marketing by Reinforcement Learning
Cyclic Pattern Kernels for Predictive Graph Mining∗
Data Mining in Metric Space: An Empirical Analysis of Supervised Learning Performance Criteria
Dense Itemsets
Density-Based Spam Detector
Diagnosing Extrapolation: Tree-Based Density Estimation
Discovering Additive Structure in Black Box Functions
Discovering Complex Matchings across Web Query Interfaces: A Correlation Mining Approach
Document Preprocessing For Naive Bayes Classification and Clustering with Mixture of Multinomials
Early Detection of Insider Trading in Option Markets
Effective Localized Regression for Damage Detection in Large Complex Mechanical Structures
Eigenspace-based Anomaly Detection in Computer Systems
Estimating the Size of the Telephone Universe: A Bayesian Mark-Recapture Approach
Exploiting A Support-based Upper Bound of Pearson’s Correlation Coefficient for Efficiently Identifying Strongly Correlated Pairs
Exploiting Dictionaries in Named Entity Extraction: Combining Semi-Markov Extraction Processes and Data Integration Methods
Exploring the Community Structure of Newsgroups
Fast Discovery of Connection Subgraphs
Fast Mining of Spatial Collocations∗
Fast Nonlinear Regression via Eigenimages Applied to Galactic Morphology
Feature Selection in Scientific Applications
Fully Automatic Cross-Associations∗
GPCA: An Efficient Dimension Reduction Scheme for Image Compression and Retrieval
Generalizing the Notion of Support
IDR/QR: An Incremental Dimension Reduction Algorithm via Q R D ecomposition
Identifying Early Buyers from Purchase Data
Improved Robustness of Signature-Based Near-Replica Detection via Lexicon Randomization
IncSpan: Incremental Mining of Sequential Patterns in Large Database ∗
Incorporating Prior Knowledge with Weighted Margin ∗ Support Vector Machines
Incremental Maintenance of Quotient Cube for Median
Interactive Training of Advanced Classifiers for Mining Remote Sensing Image Archives
Interestingness of Frequent Itemsets Using Bayesian Networks as Background Knowledge
Kernel k-means, Spectral Clustering and Normalized Cuts
Learning Spatially Variant Dissimilarity (SVaD) Measures
Learning a Complex Metabolomic Dataset using Random Forests and Support Vector Machines
Learning to Detect Malicious Executables in the Wild
Locating Secret Messages in Images
Machine Learning for Online Query Relaxation
Mining Coherent Gene Clusters from Gene-Sample-Time Microarray Data
Mining Reference Tables for Automatic Text Segmentation
Mining Scale-free Networks using Geodesic Clustering
Mining and Summarizing Customer Reviews
Mining the Space of Graph Properties
Mining, Indexing, and Querying Historical Spatiotemporal Data
On Demand Classification of Data Streams
On Detecting Space-Time Clusters
On the Discovery of Significant Statistical Quantitative Rules
Ordering Patterns by Combining Opinions from Multiple Sources
Parallel Computation of High Dimensional Robust Correlation and Covariance Matrices
Predicting Customer Shopping Lists from Point-of-Sale Purchase Data
Predicting Prostate Cancer Recurrence via Maximizing the Concordance Index
Privacy Preserving Regression Modelling Via Distributed Computation
Probabilistic Author-Topic Models for Information Discovery
Programming the K-means Clustering Algorithm in SQL
Rapid Detection of Significant Spatial Clusters
Recovering Latent Time-Series from their Observed Sums: Network Tomography with Particle Filters.
Redundancy Based Feature Selection for Microarray Data
Regularized Multi–Task Learning
SPIN: Mining Maximal Frequent Subgraphs from Graph Databases
Scalable Mining of Large Disk-based Graph Databases
Selection, Combination, and Evaluation of Effective Software Sensors for Detecting Abnormal Computer Usage
Semantic Representation, Search and Mining of Multimedia Content
Sleeved CoClustering ∗
Systematic Data Selection to Mine Concept-Drifting Data Streams
The Complexity of Mining Maximal Frequent Itemsets and Maximal Frequent Patterns
The IOC algorithm: Efficient Many-Class Non-parametric Classification for High-Dimensional Data
TiVo: Making Show Recommendations Using a Distributed Collaborative Filtering Architecture
Towards Parameter-Free Data Mining
Tracking Dynamics of Topic Trends Using a Finite Mixture Model
Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions
V-Miner: Using Enhanced Parallel Coordinates to Mine Product Design and Test Data 1
Visually Mining and Monitoring Massive Time Series
Web Usage Mining Based on Probabilistic Latent Semantic Analysis
Why Collective Inference Improves Relational Classification
k-TTP: A New Privacy Model for Large-Scale Distributed Environments ∗