Sciweavers

252 search results - page 18 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
PODS
2003
ACM
151views Database» more  PODS 2003»
14 years 8 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
ICTAI
2006
IEEE
14 years 1 months ago
Sequence Mining Without Sequences: A New Way for Privacy Preserving
During the last decade, sequential pattern mining has been the core of numerous researches. It is now possible to efficiently discover users’ behavior in various domains such a...
Stéphanie Jacquemont, François Jacqu...
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
13 years 9 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
IDEAS
2006
IEEE
98views Database» more  IDEAS 2006»
14 years 1 months ago
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang