Sciweavers

158 search results - page 9 / 32
» Discovering frequent patterns in sensitive data
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 8 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
WWW
2005
ACM
14 years 1 months ago
X-warehouse: building query pattern-driven data
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
Ji Zhang, Wei Wang, Han Liu, Sheng Zhang
RCIS
2010
13 years 5 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
13 years 11 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski
IEAAIE
2009
Springer
14 years 2 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...