158 search results - page 13 / 32 » Discovering frequent patterns in sensitive data |
FIMI
2003
13 years 9 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
EOR
2007
13 years 7 months ago
2007
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
ICTAI
2003
IEEE
14 years 23 days ago
2003
IEEE
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...
APWEB
2006
Springer
13 years 11 months ago
2006
Springer
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...