Sciweavers

2065 search results - page 189 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
16 years 4 days ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 10 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...
ICTAI
2003
IEEE
15 years 11 months ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo
TKDE
2010
137views more  TKDE 2010»
15 years 4 months ago
A Survey on Transfer Learning
—A major assumption in many machine learning and data mining algorithms is that the training and future data must be in the same feature space and have the same distribution. How...
Sinno Jialin Pan, Qiang Yang
ICDE
2008
IEEE
498views Database» more  ICDE 2008»
17 years 6 months ago
Injector: Mining Background Knowledge for Data Anonymization
Existing work on privacy-preserving data publishing cannot satisfactorily prevent an adversary with background knowledge from learning important sensitive information. The main cha...
Tiancheng Li, Ninghui Li