Sciweavers

95 search results - page 13 / 19
» kdd 2010
Sort
View
95
Voted
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 3 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 3 months ago
Direct mining of discriminative patterns for classifying uncertain data
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
Chuancong Gao, Jianyong Wang
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 3 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 3 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
KDD
2010
ACM
203views Data Mining» more  KDD 2010»
15 years 3 months ago
Collusion-resistant privacy-preserving data mining
Recent research in privacy-preserving data mining (PPDM) has become increasingly popular due to the wide application of data mining and the increased concern regarding the protect...
Bin Yang, Hiroshi Nakagawa, Issei Sato, Jun Sakuma