Sciweavers

388 search results - page 35 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
14 years 4 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Self-Similar Mining of Time Association Rules
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
Daniel Barbará, Ping Chen, Zohreh Nazeri
CIKM
2006
Springer
14 years 1 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
14 years 4 months ago
FpViz: a visualizer for frequent pattern mining
Over the past 15 years, numerous algorithms have been proposed for frequent pattern mining as it plays an essential role in many knowledge discovery and data mining (KDD) tasks. M...
Carson Kai-Sang Leung, Christopher L. Carmichael